A practical RWA algorithm based on lookup table for edge disjoint paths

Authors:
Myung Hee Kim;Hyunseung Choo;Byung Ho Yae;JongHyun Lee
Affiliations:
School of Information and Communication, Sungkyunkwan University, Suwon, Korea;School of Information and Communication, Sungkyunkwan University, Suwon, Korea;Network Technology Laboratory, Electronics and Telecommunication Research Institute, Daejeon, Korea;Network Technology Laboratory, Electronics and Telecommunication Research Institute, Daejeon, Korea
Venue:
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Year:
2003

Citing 5
Cited 2

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
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
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

Routing with maximum EDPs and wavelength assignment with path conflict graphs

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Traffic grooming algorithm using shortest EDPs table in WDM mesh networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing and wavelength assignment (RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing (WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the proposed algorithm uses similar or fewer number of wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP [2] which is currently known to be effective in practice.