Paper Info
Title
On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks
Abstract
We study the diverse routing problem in optical mesh networks under shared risk link groups (SRLGs) constraints. We first generalize the diverse routing formulation in [1] for finding two disjoint paths into K shortest span-disjoint paths. We then propose three integer linear programming (ILP) models for finding K shortest span-disjoint paths (KSDP), maximum span-disjoint paths (MSDP) and K least-coupled paths (KLCP) in SRLG networks. The complexity analysis and the simulation results show that the complexity of our proposed models are not dependent on the number of disjoint paths required, but a polynomial time algorithm. In addition, the proposed models are still solvable for most optical mesh networks which have up to a few hundred nodes and spans.
Year
DOI
Venue
2007
10.1109/ICON.2007.4444092
Adelaide, SA
Keywords
Field
DocType
computational complexity,integer programming,linear programming,optical fibre networks,search problems,telecommunication network routing,complexity analysis,diverse routing problem,integer linear programming,k least-coupled path,k shortest span-disjoint path,maximum span-disjoint path,optical mesh networks,shared risk link groups
Topology,Mesh networking,Mathematical optimization,Optical mesh network,Disjoint sets,Computer science,Computer network,Integer programming,Floyd–Warshall algorithm,Linear programming,Time complexity,Computational complexity theory
Conference
ISSN
ISBN
Citations 
1556-6463 E-ISBN : 978-1-4244-1230-3
978-1-4244-1230-3
0
PageRank 
References 
Authors
0.34
7
3
Name
Order
Citations
PageRank
Viet Q. Phung196.21
Daryoush Habibi28220.85
Hoang Nam Nguyen3357.98