Journals and Proceedings ? Brought to you by The Optical Society

Journal of Lightwave Technology

Journal of Lightwave Technology

| A JOINT IEEE/OSA PUBLICATION

  • Vol. 27, Iss. 20 — Oct. 15, 2009
  • pp: 4471–4479

Sparse Traffic Grooming in Translucent Optical Networks

Gangxiang Shen and Rodney S. Tucker

Journal of Lightwave Technology, Vol. 27, Issue 20, pp. 4471-4479

» View Full Text: Acrobat PDF (375 KB)

Citation
Gangxiang Shen and Rodney S. Tucker, "Sparse Traffic Grooming in Translucent Optical Networks," J. Lightwave Technol. 27, 4471-4479 (2009)
http://www.opticsinfobase.org/JLT/abstract.cfm?URI=JLT-27-20-4471

Click for help

Abstract

Traffic grooming is important in the design and operation of translucent optical networks. This paper investigates sub-wavelength traffic grooming in a translucent optical network and shows how to take advantage of sub-wavelength traffic grooming capability of sparsely distributed opaque switch nodes. An efficient heuristic, called the virtual nodal degree ranked algorithm, is employed to select the best locations for opaque switch nodes. New mixed-integer linear programming (MILP) optimization models are developed to optimally groom sub-wavelength traffic demand in the translucent optical network. The models maximize served sub-wavelength traffic demand under a limited network capacity and minimize required wavelength capacity subject to the condition that all the traffic demands are served. The models are novel in optimization methodology because they incorporate both the arc-node and the arc-path multi-commodity optimization techniques for a single problem. Based on simulation studies, it is found that the performance of sub-wavelength traffic grooming of a translucent network is substantially improved by increasing the number of opaque switch nodes. For some network topologies, the performance saturates as the number of opaque switch nodes increases, though the phenomenon is not general for any type of network topology.

© 2009 IEEE

» View Full Text: Acrobat PDF (375 KB)

References

Please [login to View References]

Cited By

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

Click for help

 

OSA is a member of CrossRef.

CrossCheck Deposited








Browse by Journal and Year


   


Lookup Conference Papers

More News