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

Abstract : 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.
Type de document :
Article dans une revue
Journal of Optical Networking, Optical Society of America, 2006, 5 (11), pp.780--789
Liste complète des métadonnées

https://hal.inria.fr/inria-00113681
Contributeur : Johanne Cohen Épouse Bournez <>
Soumis le : mardi 14 novembre 2006 - 11:02:11
Dernière modification le : mardi 24 avril 2018 - 13:28:59

Identifiants

  • HAL Id : inria-00113681, version 1

Collections

Citation

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, Optical Society of America, 2006, 5 (11), pp.780--789. 〈inria-00113681〉

Partager

Métriques

Consultations de la notice

138