Browse > Article

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

Ahn Hyun Gi (성균관대학교 정보통신공학부 네트워크시스템 연구실)
Lee Tae-Jin (성균관대학교 정보통신공학부 네트워크시스템 연구실)
Chung Min Young (성균관대학교 정보통신공학부 네트워크기술 연구실)
Choo Hyunseung (성균관대학교 정보통신공학부 통신망 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.11A, 2005 , pp. 979-986 More about this Journal
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.
Keywords
Routing and wavelength assignment ( RWA); Time disjoint paths (TDP); Scheduled Lightpath Demand (SID);
Citations & Related Records
연도 인용수 순위
  • Reference
1 Advanced Networking for Research and Education, Online, Available: http://abilene.intemet2.edu/
2 J. Clausen and M. Perregaard, 'On the Best Search Strategy in Parallel Branch-and-bound-Best-fiist-search vs. Lazy Depth-first-search,' Annals of Operations Research, no. 90, pp. 1-17, 1999
3 J. Clausen, 'Branch and Bound Algorithms-Principles and Examples,' Online, Available: http://www.imm.dtu.dk/~jha/
4 Architecture of Optical Transport Network, ITU-T Recommendation G. 872, Nov. 2001
5 J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, 'Routing Foreseeable Lightpath Demands Using a Tabu Search Meta-heu-ristic,' in Proc. GLOBECOM 2002, pp. 2803-2807, Nov. 2002
6 P. Manohar, D. Manjunath, and R. K. Shevgaonkar, 'Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms,' IEEE Communication Letters, vol. 5, pp. 211-213, May 2002
7 D. Kirovski and M. Potkonjak, 'Efficient Coloring of a Large Spectrum of Graphs,' in Proc. 35th Conf. Design Automation, pp. 427-432, June 1998
8 F. Glover and M. Laguna, Tabu Search, MA: Kluwer-Academic, 1997
9 R. Ramaswami and K. Sivarajan, 'Routing and Wavelength Assignment in All-Optical Network,' IEEE/ACM Trans. Networking, vol. 3, no. 5, pp. 489-500, 1995   DOI   ScienceOn
10 J.M. Kleinberg. 'Approximation Algorithms for Disjoint Paths Problems,' Ph. D. dissertation, MIT, May 1996
11 H. Zang, J. P. Jue, and B. Mukherjee, 'A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM networks,' SPIE/Baltzer Optical Networks Magazine, vol. 1, no. 1, pp. 47-60, Jan. 2000
12 J. Kuri, N. Puech, M. Gagnaire, E. Dotaro and R. Douville, 'Routing and Wavelength Assignment of Scheduled Lightpath Demands,' IEEE Journal on Selected Areas in Communications, vol. 21, no. 8, pp. 1231-1240, Oct. 2003   DOI   ScienceOn