Path computation algorithms for dynamic service provisioning in SDH networks under SRLG constraints

Author

Reddy, O. Manikumar ; Madangopal, R. ; Rani, N. Usha ; Gonsalves, Timothy A.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Madras, Chennai

fYear

2007

fDate

17-18 Dec. 2007

Firstpage

1

Lastpage

2

Abstract

SDH is the dominant transport technology for delivery of voice and private-line bandwidth services in access and backbone networks. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Shared Risk Link Group (SRLG) has been widely recognized as an important concept in survivable optical networks. In this paper, a new heuristic SRLG-disjoint path computation algorithm proposed for dedicated protection that take into account the multiplexing structure and standard protection mechanisms defined by SDH.

Keywords

optical communication; quality of service; synchronous digital hierarchy; SDH network; SRLG constraints; Shared Risk Link Group; disjoint path computation algorithm; dynamic service provisioning; multiplexing structure; path computation algorithm; private-line bandwidth services; Bandwidth; Computer networks; Computer science; Heuristic algorithms; Optical fiber networks; Protection; Software algorithms; Spine; Synchronous digital hierarchy; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Networks and Telecommunication Systems, 2007 First International Symposium on

Conference_Location

Mumbai

Print_ISBN

978-1-4244-1859-6

Electronic_ISBN

978-1-4244-1860-2

Type

conf

DOI

10.1109/ANTS.2007.4620215

Filename

4620215