Abstract
All-optical packets networks represent a challenging and attractive technology to provide a large bandwidth for future networks. The motivations for an all-optical network and a description of the ROM project may be found in [5]. With current optical technology, optical switches do not have large buffers or even buffers at all. Delay loops allow some computation time for the routing algorithms but they are not designed to store a large amount of packets. Therefore routing algorithms are quite different from the algorithms designed for store and forward networks based on electronic buffering. In this paper, we study packet routing strategies without intermediate storage of data packets (hereafter simply called packets) [8], such as deflection routing [3,10] and Eulerian routing [2,6,1]. These routing strategies do not allow packet loss. Thus the performance guarantee in terms of packets loss is just the physical loss rate which is very low for optical fibers. However these strategies keep the packets inside the network and reduce the bandwidth. The usable bandwidth (i.e., the goodput) of the network and the routing protocol is therefore a major measure of interest. In this paper, we focus on two performance criteria: the goodput of the network, and the ending guarantee. First let us define them more precisely.
This work has been supported by the French RNRT project ROM
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
D. Barth, P. Berthomé, A. Borrero, J.M. Fourneau, C. Laforest, F. Quessette, and S. Vial. Performance comparisons of Eulerian routing and deflection routing in a 2d-mesh all optical network. In ESM’2001, 2001.
D. Barth, P. Berthomé, and J. Cohen. The Eulerian stretch of a digraph and the ending guarantee of a convergence routing. Technical Report A00-R-400, LORIA, BP 239-F54506 Vandoeuvre-lès-Nancy, France, 2000.
J. C. Brassil and R. L. Cruz. Bounds on maximum delay in networks with deflection routing. IEEE Trans. on Parallel and Distributed Systems, 6(7):724–732, 1995.
U. Feige. Observations on hot potato routing. In ISTCS: 3rd Israeli Symposium on the Theory of Computing and Systems, 1995.
P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, and I. Kotuliak. Multiservice optical network: Main concepts and first achievements of the ROM program. Journal of Ligthwave Technology, 19:23–31, January 2001.
C. Laforest and S. Vial. Short cut Eulerian routing of datagrams in all optical point-to-point networks. In IPDPS, 2002.
A. Mayer, Y. Ofek, and M. Yung. Local fairness in general-topology networks with convergence routing. In Infocom, volume 2, pages 891–899. IEEE, June 1995.
Y. Ofek and M. Yung. Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link. In ACM Symposium On Principles of Distributed Computing, pages 161–175, 1990.
D. Potier. New user’s introduction to QNAP2. Technical Report RT40, INRIA, Roquencourt FRANCE, 1984.
A. Schuster. Optical Interconnections and Parallel Processing: The Interface, chapter Bounds and analysis techniques for greedy hot-potato routing, pages 284–354. Kluwer Academic Publishers, 1997.
B. Yener, S. Matsoukas, and Y. Ofek. Iterative approach to optimizing convergence routing priorities. IEEE/ACM Trans. on Networking, 5(4):530–542, August 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barth, D., Berthomé, P., Czarchoski, T., Fourneau, J.M., Laforest, C., Vial, S. (2002). A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_107
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive