Dynamic RWA algorithms under shared-risk-link-group constraints

Author

Wen, Haibo ; Li, Lemin ; Wang, Sheng

Author_Institution

Nat. Key Lab of Broadband Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China

Volume

1

fYear

2002

fDate

29 June-1 July 2002

Firstpage

871

Abstract

In IP over WDM optical networks, there are many traffic flows within every light-path. Failure of one light-path leads to great loss. Therefore, path protection should be provided for every primary light-path, that is, one backup light-path must be provided to the primary light-path. The concept of shared risk link group (SRLG) has been introduced in optical networks, and the primary light-path and the backup light-path are requested to be SRLG-disjoint. We first propose a heuristic algorithm without wavelength assignment. This algorithm can compute two SRLG-disjoint paths simultaneously, and the total cost of the two paths is near optimal. Then, by virtue of a layered-graph, based on the first algorithm, an algorithm for dynamic routing and wavelength assignment (RWA) under SRLG-disjoint constraints is proposed. Analysis of each algorithm is given.

Keywords

graph theory; optical fibre networks; resource allocation; telecommunication network routing; wavelength division multiplexing; IP over WDM; backup lightpath; dynamic RWA algorithms; dynamic routing and wavelength assignment; heuristic algorithm; layered-graph; optical networks; primary lightpath; shared-risk-link-group constraints; Cost function; Heuristic algorithms; Image motion analysis; Optical fiber networks; Optical losses; Protection; Telecommunication traffic; WDM networks; Wavelength assignment; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on

Print_ISBN

0-7803-7547-5

Type

conf

DOI

10.1109/ICCCAS.2002.1180750

Filename

1180750