A practical RWA algorithm based on maximum EDPS and path conflict graph

Author

Kim, Duk Hun ; Chung, Min Young ; Lee, Tae-Jin ; Choo, Hyunseung

Author_Institution

Sch. of Inf. & Commun. Eng., Sungkyunkwan Univ., Suwon, South Korea

Volume

C

fYear

2004

fDate

21-24 Nov. 2004

Firstpage

97

Abstract

In optical transport networks based on wavelength division multiplexing (WDM) technique, one of the important issues is a routing and wavelength assignment (RWA) problem. The performance of optical networks may differ from RWA algorithms. In general, the more complex RWA algorithm is used, the more wavelength resource is saved. In this paper, we propose a novel approach using path conflict graph and an algorithm for finding edge disjoint paths (EDPs) as many as possible. And then we compare performance of the proposed algorithm with that of bounded greedy approach for EDP (BGA for EDP) algorithm.

Keywords

graph theory; optical fibre networks; telecommunication network routing; wavelength division multiplexing; bounded greedy approach; finding edge disjoint path; optical transport networks; path conflict graph; routing and wavelength assignment problem; wavelength division multiplexing; Optical fiber networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON 2004. 2004 IEEE Region 10 Conference

Print_ISBN

0-7803-8560-8

Type

conf

DOI

10.1109/TENCON.2004.1414716

Filename

1414716