Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

https://hal.inria.fr/inria-00113681
Contributor : Johanne Cohen Épouse Bournez <>
Submitted on : Tuesday, November 14, 2006 - 11:02:11 AM
Last modification on : Wednesday, September 16, 2020 - 4:51:45 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

238