DocumentCode :
785739
Title :
Offline Impairment-Aware Routing and Wavelength Assignment Algorithms in Translucent WDM Optical Networks
Author :
Manousakis, Konstantinos ; Christodoulopoulos, Konstantinos ; Kamitsas, Euaggelos ; Tomkos, Ioannis ; Varvarigos, Emmanouel A.
Author_Institution :
Athens Inf. Technol. Center, Peania
Volume :
27
Issue :
12
fYear :
2009
fDate :
6/15/2009 12:00:00 AM
Firstpage :
1866
Lastpage :
1877
Abstract :
Physical impairments in optical fiber transmission necessitate the use of regeneration at certain intermediate nodes, at least for certain lengthy lightpaths. We design and implement impairment-aware algorithms for routing and wavelength assignment (IA-RWA) in translucent optical networks. We focus on the offline version of the problem, where we are given a network topology, the number of available wavelengths and a traffic matrix. The proposed algorithm selects the 3R regeneration sites and the number of regenerators that need to be deployed on these sites, solving the regenerator placement problem for the given set of requested connections. The problem can be also posed in a slightly different setting, where a (sparse) placement of regenerators in the network is given as input and the algorithm selects which of the available regenerators to use, solving the regenerator assignment problem. We formulate the problem of regenerator placement and regenerator assignment, as a virtual topology design problem, and address it using various algorithms, ranging from a series of integer linear programming (ILP) formulations to simple greedy heuristic algorithms. Once the sequence of regenerators to be used by the non-transparent connections has been determined, we transform the initial traffic matrix by replacing non-transparent connections with a sequence of transparent connections that terminate and begin at the specified 3R intermediate nodes. Using the transformed matrix we then apply an IA-RWA algorithm designed for transparent (as opposed to translucent) networks to route the traffic. Blocked connections are re-routed using any remaining regenerator(s) in the last phase of the algorithm.
Keywords :
greedy algorithms; heuristic programming; linear programming; matrix algebra; optical fibre networks; telecommunication network routing; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; 3R regeneration sites; IA-RWA algorithm; greedy heuristic algorithms; integer linear programming; network topology; offline impairment-aware routing; optical fiber transmission; traffic matrix; translucent WDM optical networks; virtual topology design problem; wavelength assignment algorithms; Physical layer impairments; regenerator assignment; regenerator placement; routing and wavelength assignment; translucent versus transparent networks; virtual topology;
fLanguage :
English
Journal_Title :
Lightwave Technology, Journal of
Publisher :
ieee
ISSN :
0733-8724
Type :
jour
DOI :
10.1109/JLT.2009.2021534
Filename :
4895698
Link To Document :
بازگشت