RWA on scheduled lightpath demands in WDM optical transport networks with time disjoint paths

Authors:
Hyun Gi Ahn;Tae-Jin Lee;Min Young Chung;Hyunseung Choo
Affiliations:
Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 5
Cited 1

Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Efficient coloring of a large spectrum of graphs

DAC '98 Proceedings of the 35th annual Design Automation Conference
Tabu Search

Tabu Search
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications

RWA algorithm for scheduled lightpath demands in WDM networks

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A RWA problem for scheduled lightpath demands (SLDs) has been solved by combinatorial optimal solution (COS) and graph coloring, or heuristic sequential RWA (sRWA). Such methods are very complex and incurs large computational overhead. In this paper, we propose an efficient RWA algorithm to utilize the time disjoint property as well as space disjoint property through fast grouping of SLDs. The computer simulation shows that our proposed algorithm indeed achieves up to 54% faster computation with similar number of wavelengths than the existing heuristic sRWA algorithm.