A New PROMISE Algorithm in Networks with Shared Risk Link Groups

Dahai Xu; Yizhi Xiong; Chunming Qiao

A New PROMISE Algorithm in Networks with Shared Risk Link Groups

Dahai Xu
, Yizhi Xiong
, Chunming Qiao

Department of Computer Science and Engineering

SUNY Buffalo

Research output: Contribution to conference › Paper › peer-review

23 Scopus citations

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.

Original language	English
Pages	2536-2540
Number of pages	5
State	Published - 2003
Event	IEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States Duration: Dec 1 2003 → Dec 5 2003

Conference

Conference	IEEE Global Telecommunications Conference GLOBECOM'03
Country/Territory	United States
City	San Francisco, CA
Period	12/1/03 → 12/5/03

Keywords

Bandwidth Sharing
Optical Network
Segment Protection
Shared Risk Link Groups
Trap

Cite this

@conference{663ace12fec547aa99fe503a8447b069,

title = "A New PROMISE Algorithm in Networks with Shared Risk Link Groups",

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 = "Bandwidth Sharing, Optical Network, Segment Protection, Shared Risk Link Groups, Trap",

author = "Dahai Xu and Yizhi Xiong and Chunming Qiao",

year = "2003",

language = "English",

pages = "2536--2540",

note = "IEEE Global Telecommunications Conference GLOBECOM'03 ; Conference date: 01-12-2003 Through 05-12-2003",

}

TY - CONF

T1 - A New PROMISE Algorithm in Networks with Shared Risk Link Groups

AU - Xu, Dahai

AU - Xiong, Yizhi

AU - Qiao, Chunming

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Bandwidth Sharing

KW - Optical Network

KW - Segment Protection

KW - Shared Risk Link Groups

KW - Trap

UR - https://www.scopus.com/pages/publications/0842288483

M3 - Paper

AN - SCOPUS:0842288483

SP - 2536

EP - 2540

T2 - IEEE Global Telecommunications Conference GLOBECOM'03

Y2 - 1 December 2003 through 5 December 2003

ER -

A New PROMISE Algorithm in Networks with Shared Risk Link Groups

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this