Abstract
Routing and wavelength assignment (RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing (WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the proposed algorithm uses similar or fewer number of wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP [2] which is currently known to be effective in practice.
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
H. Zang, J. P. Jue, and B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Optical Networks Magazine, vol.1, 1, pp.47–60, Jan. 2000.
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.
D. Banerjee and B. Mukherjee, “A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 5, pp. 903–908, June 1996.
Y. Zhang, K. Taira, H. Takagi, and S. K. Das, “An Efficient Heuristic for Routing and Wavelength Assignment in Optical WDM Networks,” IEEE International Conference on Communications, vol. 5, pp. 2734–2739, 2002.
M.D. Swaminathan and K.N. Sivarajan, “Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion,” IEEE International Conference on Communications, vol. 5, pp. 2750–2755, 2002.
M. Alanyali and E. Ayanoglu, “Rrovisioning algorithms for WDM optical networks,” IEEE/ACM Trans. On Networking, vol. 7, no. 5, pp. 767–778, Oct. 1999.
I. Chlamtac, A. Farago, and T. Zhang, “Lightpath (wavelength) routing in large WDM networks,” IEEE J. Sel. Areas in Communs. vol. 14, no. 5, pp. 909–913, June 1996.
J.M. Kleinberg. “Approximation algorithms for disjoint paths problems.” Ph.D. dissertation, MIT, Cambridge, May 1996.
P. Papadimitratos, Z. J. Haas, and E. G. Sirer, “Path Set Selection in Mobile Ad Hoc Networks,” MobiHoc 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, M.H., Choo, H., Yae, B.H., Lee, J. (2003). A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive