Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks

We present two routing algorithms based on deflection and convergence, which are able to provide high bandwidth and an ending guarantee for the end-to-end delay in a core network. We study the performance of these routing techniques by using simulations, and we prove the bounds on the delay.

[1]  Uriel Feige,et al.  Observations on hot potato routing , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[2]  Robert Krauthgamer,et al.  Networks on which hot-potato routing does not livelock , 2000, Distributed Computing.

[3]  D. Chiaroni,et al.  Routing and QoS in an all-optical packet network , 2005, 2nd International Conference on Broadband Networks, 2005..

[4]  Paul Baran,et al.  On Distributed Communications: I. Introduction to Distributed Communications Networks , 1964 .

[5]  Chris Develder,et al.  The European IST project DAVID: a viable approach toward optical packet switching , 2003, IEEE J. Sel. Areas Commun..

[6]  Assaf Schuster,et al.  Bounds and Analysis Techniques for Greedy Hot-Potato Routing , 1998 .

[7]  Christian Laforest,et al.  Short cut Eulerian routing of datagrams in all optical point-to-point networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[9]  Dominique Barth,et al.  Multiservice optical network: main concepts and first achievements of the ROM program , 2001 .

[10]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[11]  Moti Yung,et al.  Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link , 1990, PODC '90.

[12]  D. Barth,et al.  Two cycles routing and End to End delay bound in an all optical network , 2008, 2008 International Conference on Photonics in Switching.

[13]  D. Potier,et al.  Modelling Techniques and Tools for Performance Analysis , 1985 .

[14]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[15]  Dominique Barth,et al.  A Mixed Deflection and Convergence Routing Algorithm: Design and Performance , 2002, Euro-Par.

[16]  Yoram Ofek,et al.  Iterative approach to optimizing convergence routing priorities , 1997, TNET.

[17]  Johanne Cohen,et al.  The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing , 2004, J. Interconnect. Networks.

[18]  Yoram Ofek,et al.  Hamiltonian Decompositions of Regular Topology Networks with Convergence Routing , 1994 .

[19]  Antonios Symvonis.  A Note on Deflection Routing on Undirected Graphs Technical Report Number 493 November 1994 , 2003 .

[20]  Moti Yung,et al.  Local fairness in general-topology networks with convergence routing , 1995, Proceedings of INFOCOM'95.

[21]  Bruce E. Hajek,et al.  Bounds on evacuation time for deflection routing , 1991, Distributed Computing.

[22]  Takuo Tanemura,et al.  80Gb/s Multi-wavelength Optical Packet Switching Using PLZT Switch , 2007, ONDM.

[23]  Geoff Huston,et al.  Quality of Service: Delivering QoS on the Internet and in Corporate Networks , 1998 .

[24]  S. Mneimneh,et al.  Linear complexity algorithms for maximum advance deflection routing in some networks , 2006, 2006 Workshop on High Performance Switching and Routing.

[25]  D. Barth,et al.  The Eulerian stretch of a digraph and the ending guarantee of a convergence routing , 2000 .