A simple and efficient RWA algorithm based on priority of edge disjoint paths

Authors:
Soon-Bin Yim;Min Young Chung;Hyunseung Choo;Tae-Jin Lee
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 3
Cited 0

Provisioning algorithms for WDM optical networks

IEEE/ACM Transactions on Networking (TON)
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Lightpath (wavelength) routing in large WDM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.