DocumentCode :
2501357
Title :
Wavelength Assignment in Optical Networks with Limited Reconfigurability
Author :
Alnaimi, Majid ; Subramaniam, Suresh
Author_Institution :
George Washington Univ., Washington
fYear :
2007
fDate :
26-30 Nov. 2007
Firstpage :
2292
Lastpage :
2297
Abstract :
Reconfigurability of optical networks is a very important feature for supporting dynamic traffic demands and to enable new services. Optical network reconfigurability is enabled by reconfigurable optical add drop multiplexers (ROADMs) and tunable transceivers. Limiting the range of wavelengths that can be accessed at a node reduces costs, and possibly reduces flexibility in reconfigurability. The limited range (band-size) of wavelengths is a result of the limited add/drop range of the ROADMs and/or limited tuning range of transceivers. In either case, limited reconfigurability introduces a new constraint in the wavelength assignment of connections called as the wavelength termination constraint. In this paper, we consider a uni-directional ring network with limited reconfigurability and take up the problem of supporting two traffic types - permutation traffic and all-to-all traffic - while minimizing the worst-case wavelength range of the ROADMs and respecting the wavelength termination and continuity constraints. ROADMs can be limited in range (L-ROADMs) or have full range (F-ROADMs). For permutation traffic, we show that at least one F-ROADM is necessary, and we also give an upper bound on the number of F-ROADMs needed as a function of the range of the other nodes that are L-ROADMs. For all-to-all traffic, we give an integer linear programming formulation and present a heuristic algorithm to minimize the worst-case range. Our results show that all ROADMs can be L-ROADMs and the worst-case range is only about 65% of the full range for large network sizes.
Keywords :
multiplexing equipment; reconfigurable architectures; wavelength assignment; wavelength division multiplexing; dynamic traffic demands; heuristic algorithm; integer linear programming formulation; limited reconfigurability; optical networks; reconfigurable optical add drop multiplexers; ring network; tunable transceivers; wavelength assignment; wavelength termination constraint; Add-drop multiplexers; Costs; Heuristic algorithms; Integer linear programming; Optical add-drop multiplexers; Optical fiber networks; Telecommunication traffic; Transceivers; Upper bound; Wavelength assignment;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-1042-2
Electronic_ISBN :
978-1-4244-1043-9
Type :
conf
DOI :
10.1109/GLOCOM.2007.437
Filename :
4411347
Link To Document :
بازگشت