A new PROMISE algorithm in networks with shared risk link groups

Author

Xu, Dahai ; Xiong, Yizhi ; Qiao, Chunming

Author_Institution

Dept. of Comput. Sci. & Eng., State Univ. of New York, USA

Volume

5

fYear

2003

fDate

1-5 Dec. 2003

Firstpage

2536

Abstract

Shared risk link group (SRLG) has been widely recognized as an important concept in survivable optical networks. The issues of avoiding the so-called "traps" in the path determination phase and maximizing bandwidth sharing are more challenging in providing shared SRLG protection than in providing shared path protection without considering SRLG. In this paper, we extend a algorithm for the scheme of protection with multiple segments (PROMISE) to provide efficient SRLG protection. The proposed algorithm uses a novel dynamic programming technology and achieves a higher bandwidth efficiency and lower request blocking probability.

Keywords

computational complexity; dynamic programming; optical fibre networks; probability; telecommunication network reliability; telecommunication traffic; bandwidth sharing; blocking probability; dynamic programming technology; network traffic; polynomial time-complexity; segment protection; shared path protection; shared risk link group; survivable optical network; Bandwidth; Charge carrier processes; Computer science; Dynamic programming; Intelligent networks; Optical fiber cables; Optical fiber networks; Optical switches; Physical layer; Protection;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

Print_ISBN

0-7803-7974-8

Type

conf

DOI

10.1109/GLOCOM.2003.1258694

Filename

1258694