Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

Lecture Notes in Computer Science, vol. 3981, pp. 856-865, May 2006

Won Jin Yoon, Duk Hun Kim, Min Young Chung, Tae-Jin Lee, and Hyunseung Choo

Abstract

The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach for EDP (BGAforEDP). The proposed algorithm outperforms by approximately 20% under the traditional fixed topology (NSFNET) and approximately 32% under random topologies, using the BGAforEDP algorithm.

Keyword

 

 

View Full Text