RWA based on approximated path conflict graphs in optical networks

Authors:
Zhanna Olmes;Kun Myon Choi;Min Young Chung;Tae-Jin Lee;Hyunseung Choo
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;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Year:
2005

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

Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conclude that the running time of the PCG algorithm can be reduced by half even in the worst case scenario while expending fewer wavelengths than or equal to that of the BGAforEDP and MAX_EDP algorithms by using the proposed PCG approximation technique.