Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM rings

Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM... In high-speed SONET/WDM rings, the dominant system cost may be the cost of electronic components, or in other words, the cost of SONET ADMs (S-ADMs). The number of S-ADMs can be dramatically reduced by using wavelength ADMs (WADMs) and grooming traffic (i.e., multiplexing lower rate signals) appropriately. In this paper, we proposed optimal or near- optimal algorithms for traffic grooming and wavelength assignment to reduce both the number of wavelengths and the number of S-ADMs. The algorithms proposed are generic in that they can be applied to both unidirectional and bidirectional rings with an arbitrary number of nodes under both uniform and non-uniform traffic with an arbitrary grooming (multiplexing) factor. Lower bounds on the number of wavelengths and S-ADMs required for a given traffic pattern are derived, and used to determine the optimality of the proposed algorithms. Our study shows that these lower bounds can be closely approached in most cases or even achieved in some cases using the proposed algorithms. In addition, even when using the minimum number of wavelengths, the savings in S-ADMs due to traffic grooming (and the use of WADMs) are significant, especially for large networks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings of SPIE SPIE

Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM rings

Proceedings of SPIE , Volume 3531 (1) – Oct 7, 1998

Loading next page...
 
/lp/spie/effective-and-comprehensive-solution-to-traffic-grooming-and-8zDwNNgd3y

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
SPIE
Copyright
Copyright © 2003 COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
ISSN
0277-786X
eISSN
1996-756X
DOI
10.1117/12.327061
Publisher site
See Article on Publisher Site

Abstract

In high-speed SONET/WDM rings, the dominant system cost may be the cost of electronic components, or in other words, the cost of SONET ADMs (S-ADMs). The number of S-ADMs can be dramatically reduced by using wavelength ADMs (WADMs) and grooming traffic (i.e., multiplexing lower rate signals) appropriately. In this paper, we proposed optimal or near- optimal algorithms for traffic grooming and wavelength assignment to reduce both the number of wavelengths and the number of S-ADMs. The algorithms proposed are generic in that they can be applied to both unidirectional and bidirectional rings with an arbitrary number of nodes under both uniform and non-uniform traffic with an arbitrary grooming (multiplexing) factor. Lower bounds on the number of wavelengths and S-ADMs required for a given traffic pattern are derived, and used to determine the optimality of the proposed algorithms. Our study shows that these lower bounds can be closely approached in most cases or even achieved in some cases using the proposed algorithms. In addition, even when using the minimum number of wavelengths, the savings in S-ADMs due to traffic grooming (and the use of WADMs) are significant, especially for large networks.

Journal

Proceedings of SPIESPIE

Published: Oct 7, 1998

There are no references for this article.