Abstract
Among many solutions to Routing and Wavelength Assignment (RWA) problems based on Edge Disjoint Paths (EDP), the Path Conflict Graph (PCG) algorithm shows outstanding performance in terms of wavelength. In this paper, we improve the PCG algorithm by imposing limitations on the EDPs length based on the fact that the EDPs are longer than the average length for the rarely selected demands. We conclude that the running time of the PCG algorithm can be reduced by half even in the worst case scenario while expending fewer wavelengths than or equal to that of the BGAforEDP and MAX_EDP algorithms by using the proposed PCG approximation technique.
This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea. Dr. H. Choo 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.
Similar content being viewed by others
References
Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Communications Letters 5, 211–213 (2002)
Banerjee, D., Mukherjee, B.: Practical Approach for Routing and Wavelength Assignment in LargeWavelength-Routed Optical Networks. IEEE Journal on Selected Areas in Communications 14, 903–908 (1996)
Zhang, Y., Taira, K., Takagi, H., Das, S.K.: An Efficient Heuristic for Routing and Wavelength Assignment in Optical WDM Networks. In: Proc. of IEEE International Conference on Communications, vol. 5, pp. 2734–2739 (2002)
Swaminathan, M.D., Sivarajan, K.N.: Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with LimitedWavelength Conversion. In: Proc. of IEEE International Conference on Communications, vol. 5, pp. 2750–2755 (2002)
Alanyali, M., Ayanoglu, E.: Provisioning Algorithms for WDM Optical Networks. IEEE/ACM Trans. on Networking 7(5), 767–778 (1999)
Chlamtac, I., Farago, A., Zhang, T.: Lightpath (Wavelength) Routing in Large WDM Networks. IEEE Journal on Selected Areas in Communications 14, 909–913 (1996)
Kim, M.H., Choo, H.: A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. Journal of KISS, Information Networking 31(2), 123–130 (2004) (KOREAN)
Li, G., Simha, R.: The Partition Coloring Problem and its Application to Wavelength Routing and Assignment. In: Proc. of First Workshop on Optical Networks, Dallas, TX (2000)
Kim, D.H., Chung, M.Y., Lee, T.-J., Choo, H.: A Practical RWA Algorithm Based on Maximum EDPs and Path Conflict Graph. In: Proc. of TENCON 2004, November 2004, vol. C(097) (2004)
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
Olmes, Z., Choi, K.M., Chung, M.Y., Lee, TJ., Choo, H. (2005). RWA Based on Approximated Path Conflict Graphs in Optical Networks. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_47
Download citation
DOI: https://doi.org/10.1007/11424758_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25860-5
Online ISBN: 978-3-540-32043-2
eBook Packages: Computer ScienceComputer Science (R0)