Abstract
We analyze the performance of all optical packet networks. As optical storage of packets is not available, we assume that the routing protocol is based on deflection. This routing strategy does not allow packets loss. However it keeps the packets inside the network, increases the delay and reduces the bandwidth. Thus the transport delay distribution is the key performance issue for these networks. Here, we consider a 2D torus the size of which is odd. The method is based on a fixed point system between two sub-models. The first subsystem describes the global network performance while the other one models the stochastic behavior of two types of packets.
This work has been partially supported by the French RNRT project ROMEO, by a research project between CNRS and Polish Akademia Nauk and by the EURO NGI European Network of Excellence.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bannister, J., Borgonovo, F., Fratta, L., Gerla, M.: A versatile model for predicting the performance of deflection routing networks. Performance Evaluation 16, 201–222 (1992)
Baran, P.: On distributed communication networks. IEEE Transactions on Communication Systems CS-12 (1964)
Barth, D., Berthomé, P., Borrero, A., Fourneau, J.M., Laforest, C., Quessette, F., Vial, S.: Performance comparisons of Eulerian routing and deflection routing in a 2d-mesh all optical network. In: ESM 2001 (2001)
Bonnoni, A., Prucnal, P.P.: Analytical evaluation of improved access techniques in deflection routing networks. IEEE/ACM Trans. on Networking 4(5) (1996)
Borrero, A., Fourneau, J.M., Quessette, F.: Packet Selection in a deflection routing algorithm. In: ISCIS 2002, Orlando, USA, CRC Press, Boca Raton (2002)
Czachórski, T., Fourneau, J.M.: Performance evaluation of an optimal deflection routing algorithm on an odd torus. Archiwum informatyki teoretycznej i stosowanej 16(4), 257–277 (2004)
Fabrega, J., Muñoz, X.: A study of Network Capacity under Deflection routing schemes. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 989–994. Springer, Heidelberg (2003)
Gravey, P., Gosselin, S., Guillemot, C., Chiaroni, D., Le Sauze, N., Jourdan, A., Dotaro, E., Barth, D., Berthomé, P., Laforest, C., Vial, S., Atmaca, T., Hébuterne, G., El Biaze, H., Laalaoua, R., Gangloff, E., Kotuliak, I.: Multiservice optical network: Main concepts and first achievements of the ROM program. Journal of Ligthwave Technology 19, 23–31 (2001)
Mneimeh, S., Quessette, F.: Minimum Deflection Routing Algorithm, Alcatel Patent Application #135945 (2002)
Yao, S., Mukherjee, B., Dixit, S.: Plato: a generic modeling technique for optical packet switched networks. International Journal on Wireless and Optical Communications 1(1), 91–101 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fourneau, J.M., Czachórski, T. (2005). Transport Time Distribution for Deflection Routing on an Odd Torus. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_107
Download citation
DOI: https://doi.org/10.1007/11549468_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)