OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Richard A. Linke
  • Vol. 5, Iss. 11 — Nov. 1, 2006
  • pp: 780–789

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

Dominique Barth, Johanne Cohen, Lynda Gastal, Thierry Mautor, and Stéphane Rousseau  »View Author Affiliations


Journal of Optical Networking, Vol. 5, Issue 11, pp. 780-789 (2006)
http://dx.doi.org/10.1364/JON.5.000780


View Full Text Article

Acrobat PDF (325 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

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.

© 2006 Optical Society of America

OCIS Codes
(060.4510) Fiber optics and optical communications : Optical communications
(200.4260) Optics in computing : Neural networks

ToC Category:
RESEARCH PAPERS

History
Original Manuscript: March 22, 2006
Revised Manuscript: August 16, 2006
Manuscript Accepted: August 16, 2006
Published: October 4, 2006

Citation
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)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-5-11-780


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. B. Rajagopalan, D. Pendarakis, D. Saha, R. S. Ramamoorthy, and K. Bala, 'IP over optical network: architectural aspects,' IEEE Commun. Mag. 38(9), 94-102 (2000). [CrossRef]
  2. International Telecommunications Union, 'Convergence between internet and optical networks,' ITU News Mag. , October 2003, www.itu.int/itunews.
  3. N. Chandhok, A. Durresi, R. Jagannathan, and R. Jain, 'IP over optical networks: summary of issues,' www.cs.wustl.edu/rjain/ietf/issues.htm (2000).
  4. D. Barth, J. Cohen, P. Fragopoulou, and G. Hébuterne, 'Wavelengths assignment on a ring all-optical metropolitan area network,' presented at the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, Rome, Italy, 21 September 2002.
  5. A. Bianco, M. Bonsignori, E. Leonardi, and F. Neri, 'Variable-size packets in slotted WDM ring networks' presented at the 6th IFIP Working Conference on Design and Modelling, Torino, Italy, 4-6 February 2002.
  6. A. Zapata, J. Spencer, I. de Miguel, M. Dser, P. Bayvel, D. Breuer, N. Hanik, and A. Gladisch, 'Investigation of future optical metro ring networks based on 100-gigabit ethernet,' presented at ITG-Fachtagung 'Photonische Netze,' Leipzig, Germany, 5-6 May 2003.
  7. X. Yu, Y. Chen, and C. Qiao, 'A study of traffic statistics of assembled burst traffic in optical burst switched networks,' www.cse.buffalo.edu/ qiao/wobs/ obs/papers/Yulowbaropti02.pdf 2003.
  8. S. Yao, B. Mukherjee, S. J. Ben Yoo, and S. Dixit, 'All-optical packet-switched networks: a study of contention-resolution schemes in irregular mesh network with variable packet size,' Proc. SPIE 4233, 235-246 (2000).
  9. Yao, S. J. Ben Yoo, and B. Mukerjee, 'A comparison study between slotted and unslotted all-optical packet-switched network with priority-based routing,' networks.cs.ucdavis.edu/ syao/ofc01.pdf (2002).
  10. P. Brucker, Scheduling Algorithms (Springer-Verlag, 2001).
  11. M. Pinedo, Scheduling: Theory, Algorithms, and System (Prentice-Hall, 2002).
  12. H. Amet, J. Cohen, F. Deppner, M.-C. Portmann, and S. Rousseau, 'Un probleme d'ordonnancement de messages: Partie 1 modélisations; partie 2 approches de résolution,' presented at the 6th Congress of the French Society of Operations Research and Decision-Making Analysis, Tours, France, 14-16 February 2005.
  13. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).
  14. European project of the 5th PCRD. Data and voice integration over DWDM (david).
  15. D. Barth, J. Cohen, L. Gastal, T. Mautor, and S. Rousseau, 'A comparison of splittable and non-splittable packet models in an optical ring network,' Res. Rep.2005/83 (Universite Versailles, Saint Quentin, 2005), http://wwwex.prism.uvsq.fr/rapports/bin/abstract.php?id=316&lang=fr.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited