RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths

Lecture Notes in Computer Science, vol. 3391, pp. 342-351, Feb. 2005 (SCI, IF 0.402)

Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, and Hyunseung Choo

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.

 

Keyword

 

 

View Full Text