OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Keren Bergman
  • Vol. 7, Iss. 10 — Oct. 1, 2008
  • pp: 895–904

Maximum throughput traffic grooming in optical networks

Yong Wang and Qian-Ping Gu  »View Author Affiliations


Journal of Optical Networking, Vol. 7, Issue 10, pp. 895-904 (2008)
http://dx.doi.org/10.1364/JON.7.000895


View Full Text Article

Acrobat PDF (143 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

In synchronous optical networks (SONETs) and WDM networks, low-rate traffic demands are usually multiplexed to share a high-speed wavelength channel. The multiplexing-demultiplexing is known as traffic grooming and is performed by SONET add-drop multiplexers (SADM). The grooming factor, denoted by k, is the maximum number of low-rate traffic demands that can be multiplexed into one wavelength channel. SADMs are expensive, and thus an important optimization problem for traffic grooming is to maximize the number of accommodated traffic demands subject to a given number of SADMs. We focus on the unidirectional path-switched ring (UPSR) networks with unitary duplex traffic demands. We assume that each network node is equipped with a limited number L of SADMs, and our objective is to maximize the number of accommodated traffic demands in a given set. We prove the NP-hardness of this maximum throughput traffic grooming problem and propose a (k+1)-approximation algorithm. Extensive simulations are conducted to validate the performance of the algorithm. We also study the all-to-all traffic pattern for the maximum throughput traffic grooming problem and propose an algorithm that accommodates at least (nL⌊k⌋)/2 demands for a UPSR with n nodes. We also prove that any optimal solution can accommodate at most (nLk)/2 demands. Thus the solution of our algorithm is at most a constant factor (approximately 2) away from the optimum.

© 2008 Optical Society of America

OCIS Codes
(060.4254) Fiber optics and optical communications : Networks, combinatorial network design
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

History
Original Manuscript: January 8, 2008
Revised Manuscript: July 14, 2008
Manuscript Accepted: September 5, 2008
Published: September 30, 2008

Citation
Yong Wang and Qian-Ping Gu, "Maximum throughput traffic grooming in optical networks," J. Opt. Netw. 7, 895-904 (2008)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-7-10-895

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited