Title
Survivable Traffic Grooming with Impairment Constraints
Abstract
In this paper, we address the problem of survivable traffic grooming in optical WDM networks in which lightpaths are hop constrained. Survivability is provisioned at the wavelength granularity through either dedicated or shared path protection schemes. We propose an auxiliary-graph-based algorithm that addresses grooming, protection, and impairment constraints in a combined manner and that determines the placement of regenerators and grooming equipment in the network with the goal of minimizing equipment cost. Numerical results illustrate that the proposed algorithm outperforms an algorithm in which grooming, protection, and impairments are handled separately. We also evaluate effects of different equipment placement policies on the network cost and evaluate the cost-performance trade-offs for different network line rates.
Year
DOI
Venue
2010
10.1109/ICCCN.2010.5560081
Computer Communications and Networks
Keywords
Field
DocType
optical fibre networks,telecommunication network reliability,telecommunication traffic,wavelength division multiplexing,impairment constraints,optical WDM networks,survivable traffic grooming,wavelength granularity
Survivability,Computer science,Computer network,Telecommunication network reliability,Distributed computing,Traffic grooming
Conference
ISSN
ISBN
Citations 
1095-2055
978-1-4244-7114-0
1
PageRank 
References 
Authors
0.36
1
6
Name
Order
Citations
PageRank
Ankitkumar N. Patel1627.14
Jason P. Jue253359.51
Xi Wang36120.91
Qiong Zhang415135.79
Paparao Palacharla55219.22
Takao Naito6103.25