Title

On diverse routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks

Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Computing, Health and Science

School

School of Engineering and Mathematics

RAS ID

5363

Comments

Originally published as: Phung, Q., Habibi, D., Nguyen, H.N. (2007). On diverse routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks. In Proceedings of the 2007 15th IEEE International Conference on Networks (ICON2007). (pp. 235 - 239). Original paper available here

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.

 

Link to publisher version (DOI)

10.1109/ICON.2007.4444092