Routing and QoS in an all-optical packet network

We present the ROMEO project, a collaboration between Alcatel and French Universities to design all optical core and access networks. Inside the core, the QoS requirements are a high throughput, low latency and bounded transport delays. Our new routing algorithm combines deflection routing and convergence routing. Deflection routing is known to avoid deadlocks but some packets never reach their destination within a finite delay while convergence routing provides a deterministic bounded delay for transport but has in general a very low network throughput. The mixed strategies we design allow an ending guarantee and are almost as efficient as deflection routing. We study the performance guarantees provided by this new algorithm using graph arguments for the ending property and simulations to give some insights into the throughput and the distribution of delays. We also show how we can optimize the two main components of the algorithm. Finally, we present how bursts are implemented inside the ROMEO core network. ROMEO bursts are not based on the usual reservation without acknowledgment mechanism. Using an Eulerian decomposition of the network topology and our routing algorithm, the bursts arrive with a probability one within a bounded delay, once they have been inserted

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

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

[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]  Yoram Ofek,et al.  Iterative approach to optimizing convergence routing priorities , 1997, TNET.

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

[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]  D. Barth,et al.  The Eulerian stretch of a digraph and the ending guarantee of a convergence routing , 2000 .

[10]  Jean-Michel Fourneau,et al.  Transport Time Distribution for Deflection Routing on an Odd Torus , 2005, Euro-Par.

[11]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[12]  George N. Rouskas,et al.  Techniques for optical packet switching and optical burst switching , 2001, IEEE Commun. Mag..

[13]  Daniel Popa,et al.  On Optical Packet Format and Traffic Characteristics , 2005, 2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops).

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

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

[16]  I. Kotuliak.  Optical networks access node performance , 2004, Proceedings. Elmar-2004. 46th International Symposium on Electronics in Marine.

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

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

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