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.
© 2006 Optical Society of America
Original Manuscript: March 22, 2006
Revised Manuscript: August 16, 2006
Manuscript Accepted: August 16, 2006
Published: October 4, 2006
Dominique Barth, Johanne Cohen, Lynda Gastal, Thierry Mautor, and Stéphane Rousseau, "Algorithmic study of complexity of two quality-of-service packet models in an optical slotted ring network," J. Opt. Netw. 5, 780-789 (2006)