Performance evaluation of short-cut Eulerian routing

We analyze the performance of a new routing strategy for all-optical packet networks. This strategy improves the Eulerian routing technique, a convergence routing based on a an Eulerian directed cycle. This new technique allows to use shortcuts along the Eulerian cycle. Usual Eulerian routing provides deterministic transport delays but has a very low network utilization. With this new strategy the average transport time is much smaller and we can prove a deterministic upper bound of the transport delay, unlike deflection routing which suffers from livelocks. We study the performance guarantees provided by this new algorithm using graph arguments for the ending property and simulations to give some insights for the performance of the algorithm.

[1]  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.

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

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

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

[5]  Alberto Bononi,et al.  Analytical evaluation of improved access techniques in deflection routing networks , 1996, TNET.

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

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

[8]  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.

[9]  Jean-Michel Fourneau,et al.  Performance evaluation of an optimal deflection routing Algorithm on an Odd Torus , 2004 .

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

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

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

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

[14]  Ireneusz Szczesniak.  Analysis of a Finite Number of Deflections in Fully and Uniformly Loaded Regular Networks , 2004, NETWORKING.

[15]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[16]  Nihal Pekergin.  Stochastic bounds on delays of fair queueing algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Flaminio Borgonovo,et al.  A Versatile Model for Predicting the Performance of Deflection-Routing Networks , 1992, Perform. Evaluation.

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