DocumentCode
3508755
Title
A wavelength assignment heuristic to minimize SONET ADMs in WDM rings
Author
Yuan, Xin ; Fulay, Amit
Author_Institution
Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
fYear
2001
fDate
2001
Firstpage
257
Lastpage
262
Abstract
Optical Wavelength Division Multiplexing (WDM) rings are being deployed to support multiple SONET/SDH self-healing rings over a single physical optical ring. In such systems, the dominating cost is the SONET Add/Drop Multiplexers (ADMs). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADMs required is minimized. However the problem of optimal wavelength assignment to minimize SONET ADMs is NP-hard. Existing heuristic algorithms for this problem include the assign first, the iterative matching and the iterative merging heuristics. In this paper we propose a new wavelength assignment heuristic to minimize SONET ADMs. Our heuristic is on average 3% to 5% more effective in finding the opportunities to share ADMs (and thus to reduce the total number of ADMs required) than the most effective existing heuristic, the iterative merging algorithm
Keywords
SONET; computational complexity; iterative methods; multiplexing equipment; wavelength division multiplexing; NP-hard; SONET ADMs; WDM rings; heuristic algorithms; iterative matching; iterative merging algorithm; iterative merging heuristics; optical wavelength division multiplexing rings; optimal wavelength assignment; wavelength assignment heuristic; Add-drop multiplexers; Computer science; Costs; Iterative algorithms; Merging; Protection; SONET; Synchronous digital hierarchy; Wavelength assignment; Wavelength division multiplexing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Workshops, 2001. International Conference on
Conference_Location
Valencia
ISSN
1530-2016
Print_ISBN
0-7695-1260-7
Type
conf
DOI
10.1109/ICPPW.2001.951959
Filename
951959
Link To Document