Routing with maximum EDPs and wavelength assignment with path conflict graphs

Authors:
Won Jin Yoon;Duk Hun Kim;Min Young Chung;Tae-Jin Lee;Hyunseung Choo
Affiliations:
Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Kyunggi-do, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 6
Cited 0

Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Provisioning algorithms for WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Path set selection in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A practical RWA algorithm based on lookup table for edge disjoint paths

HSI'03 Proceedings of the 2nd international conference on Human.society@internet
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

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.