2nd International ICST Conference on Broadband Networks

Research Article

Routing and QoS in an all-optical packet network

  • @INPROCEEDINGS{10.1109/ICBN.2005.1589725,
        author={D. Barth and J.M. Fourneau and D. Nott and D. Chiaroni},
        title={Routing and QoS in an all-optical packet network},
        proceedings={2nd International ICST Conference on Broadband Networks},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2006},
        month={2},
        keywords={},
        doi={10.1109/ICBN.2005.1589725}
    }
    
  • D. Barth
    J.M. Fourneau
    D. Nott
    D. Chiaroni
    Year: 2006
    Routing and QoS in an all-optical packet network
    BROADNETS
    IEEE
    DOI: 10.1109/ICBN.2005.1589725
D. Barth1,*, J.M. Fourneau1,*, D. Nott1,*, D. Chiaroni2,*
  • 1: PRiSM, Universit´e de Versailles Saint-Quentin, 45 Av. des Etats Unis, 78000 Versailles, France
  • 2: Alcatel CIT/Alcatel R&I, URP, Route de Nozay, 91460 Marcoussis, France
*Contact email: barth@prism.uvsq.fr, jmf@prism.uvsq.fr, dnott@prism.uvsq.fr, Dominique.Chiaroni@alcatel.fr

Abstract

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