Algorithmic study of complexity of two quality-of-service packet models in an optical slotted ring network - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Optical Networking Année : 2006

Algorithmic study of complexity of two quality-of-service packet models in an optical slotted ring network

Lynda Gastal
  • Fonction : Auteur
  • PersonId : 836643
Stéphane Rousseau
  • Fonction : Auteur
  • PersonId : 836644

Résumé

We consider an optical slotted ring network. We distinguish two quality-of-service packet models. In the first, each subpacket of a same packet can be routed independently, and in the second, each subpacket has to be routed in consecutive slots (no jitter). We evaluate performances in terms of jitter and delay of routed packets. First, we study the algorithmic complexity of minimizing delay in the second model and show it is NP incomplete. Then, we propose distributed and online algorithms for the two models. Finally, we compare these algorithms using an OMnet++ simulator.
Fichier non déposé

Dates et versions

inria-00113681 , version 1 (14-11-2006)

Identifiants

  • HAL Id : inria-00113681 , version 1

Citer

Dominique Barth, Lynda Gastal, Thierry Mautor, Stéphane Rousseau. Algorithmic study of complexity of two quality-of-service packet models in an optical slotted ring network. Journal of Optical Networking, 2006, 5 (11), pp.780--789. ⟨inria-00113681⟩
136 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More