Time Disjoint Paths (TDP) - RWA on Scheduled Lightpath Demands in Optical Transport Networks 


Vol. 30,  No. 11, pp. 979-986, Nov.  2005


PDF Full-Text
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. G. Ahn, T. Lee, M. Y. Chung, H. Choo, "Time Disjoint Paths (TDP) - RWA on Scheduled Lightpath Demands in Optical Transport Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 979-986, 2005. DOI: .

[ACM Style]

Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, and Hyunseung Choo. 2005. Time Disjoint Paths (TDP) - RWA on Scheduled Lightpath Demands in Optical Transport Networks. The Journal of Korean Institute of Communications and Information Sciences, 30, 11, (2005), 979-986. DOI: .

[KICS Style]

Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseung Choo, "Time Disjoint Paths (TDP) - RWA on Scheduled Lightpath Demands in Optical Transport Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 979-986, 11. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880