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.
This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication, Korea. Dr. Lee is the corresponding author.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Architecture of Optical Transport Network, ITU-T Recommendation, G. 872 (2001)
Advanced Networking for Research and Education, Online, Available: http://abilene.internet2.edu/
Ramaswami, A., Sivarajan, K.: Routing and Wavelength Assignment in All-Optical Network. IEEE/ACM Transactions on Networking 3(5), 489–500 (1995)
Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM Networks. Optical Networks Magazine 1(1), 47–60 (2000)
Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Communications Letter 5, 211–213 (2002)
Kirovski, D., Potkonjak, M.: Efficient Coloring of a Large Spectrum of Graphs. In: Proc. 35th Conf. Design Automation, pp. 427–432 (1998)
Kuri, J., Puech, N., Gagnaire, M., Dotaro, E., Douville, R.: Routing and Wavelength Assignment of Scheduled Lightpath Demands. IEEE Journal on Selected Areas in Communications 21(8), 1231–1240 (2003)
Kuri, J., Puech, N., Gagnaire, M., Dotaro, E.: Routing Foreseeable Lightpath Demands Using a Tabu Search Meta-heuristic. In: Proc. GLOBECOM 2002, Taipei, Taiwan, pp. 2803–2807 (2002)
Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems, Ph. D. dissertation. MIT, Cambridge (1996)
Clausen, J.: Branch and Bound Algorithm-Principles and Examples, Online, Available: http://www.imm.dtu.dk/jha/
Clausen, J., Perregaard, M.: On the Best Search Strategy in Parallel Branch-and- Bound-Best-First-Search vs. Lazy Depth-First-Search. Annals of Operations Research (90), 1–17 (1999)
Glover, F., Laguna, M.: Tabu Search. Kluwer-Academic, MA (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, H.G., Lee, TJ., Chung, M.Y., Choo, H. (2005). RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30582-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24467-7
Online ISBN: 978-3-540-30582-8
eBook Packages: Computer ScienceComputer Science (R0)