A Simple and Efficient RWA Algorithm Based on Priority of Edge Disjoint Paths

May. 2006Lecture Notes in Computer Science, vol. 3981, pp. 1121-1130, May 2006

Soon-Bin Yim, Min Young Chung, Hyunseung Choo, and Tae-Jin Lee

Abstract

Routing and wavelength assignment (RWA) is an important issue in WDM optical transport networks. The objective is to find lightpaths for given demands with minimal use of wavelengths. It is typically solved using combination of linear programming and graph coloring, or heuristic path selection algorithms. Such methods are complex or yield sub-optimal paths. In this paper, we propose an efficient algorithm, RWA based on Priorities of Shortest Path (RPSP). The proposed algorithm utilizes the lengths of the shortest paths for the source-destination demand pairs and assigns disjoint lightpaths to the ordered demands. The computer simulation shows that our proposed algorithm indeed requires up to 34% fewer wavelengths with almost identical running time than the previously proposed effective BGAforEDP algorithm.

Keyword

 

 

View Full Text