A new PROMISE algorithm in networks with shared risk link groups

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.