Diverse routing in WDM optical networks with shared risk link group (SRLG) failures

Author

Luo, XuBin ; Bin Wang

Author_Institution

Dept. of Comput. Sci. & Eng., Wright State Univ., Dayton, OH, USA

fYear

2005

fDate

16-19 Oct. 2005

Abstract

We study the diverse routing problem in WDM optical networks with SRLG failures. We consider a more general case of SRLG failures than those considered in Datta and Somani (2004) and Doucette and Grover (2002). All the optical links in an SRLG share a common endpoint. In addition, a link can belong to arbitrary number of SRLG groups and an SRLG may include more than two links. We develop a polynomial time optimal algorithm to find a pair of least cost SRLG-disjoint paths between a source and a destination. We prove the correctness of the algorithm which is also shown to be more time efficient than the graph transformation based algorithm of Datta and Somani (2004).

Keywords

graph theory; optical fibre networks; polynomial approximation; telecommunication network reliability; telecommunication network routing; wavelength division multiplexing; WDM optical mesh network; diverse routing; graph transformation based algorithm; polynomial time algorithm; shared risk link group failure; Computer science; Intelligent networks; Optical fiber communication; Optical fiber networks; Physical layer; Polynomials; Protection; Routing; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Design of Reliable Communication Networks, 2005. (DRCN 2005). Proceedings.5th International Workshop on

Print_ISBN

0-7803-9439-9

Type

conf

DOI

10.1109/DRCN.2005.1563905

Filename

1563905