Paper Info
Title
Survivable traffic grooming in WDM mesh networks under SRLG constraints.
Abstract
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multi-granularity connection services in optical networks. In this paper, we study the static STG problem in WDM mesh networks employing path protection at the lightpath level. To make connections survivable under various failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. In addition to providing the results from the integer linear programming (ILP) approach, we propose three efficient heuristics, namely separated grooming algorithm (SGA), integrated grooming algorithm (IGA) and tabu search grooming algorithm (TSGA). While SGA and IGA correspond to an overlay model and a peer model respectively, TSGA further improves SGA and IGA by incorporating the tabu search method. Numerical results show that the heuristics use much shorter running times to generate network throughputs close to those of the ILP formulations.
Year
DOI
Venue
2005
10.1109/ICC.2005.1494642
IEEE International Conference on Communications
Keywords
Field
DocType
survivable traffic grooming,WDM,SRLG,path protection,tabu search,integer linear programming
Mesh networking,Computer science,Computer network,Heuristics,Integer programming,Linear programming,Overlay,Path protection,Tabu search,Distributed computing,Traffic grooming
Conference
ISSN
Citations 
PageRank 
1550-3607
8
0.74
References 
Authors
2
2
Name
Order
Citations
PageRank
Wang Yao18511.45
Byrav Ramamurthy21283110.58