Advertisement

Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths

  • Hyunseung Choo
  • Vladimir V. Shakhov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)

Abstract

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring are complex and require extensive use of heuristics which makes them slow and sometimes practically not reasonable. Another approach employs the greedy algorithm for obtaining available edge disjoint paths. Even though it is fast, it produces a solution for any connection request which is far from the optimal utilization of wavelengths. We propose a novel algorithm which is based on the maximum flow to have the maximum quantity of edge disjoint paths. Comprehensive computer simulation shows that the proposed method outperforms previous ones significantly in terms of running time. Furthermore, it shows compatible or better performance comparing to others in number of wavelengths used.

Keywords

Optical Network Connection Request Wavelength Assignment Wavelength Converter Edge Disjoint Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    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, 47–60 (2000)Google Scholar
  2. 2.
    Banerjee, D., Mukherjee, B.: Practiacal Approach for Routing and Wavelength Assignment in Large Wavelength Routed Optical Networks. IEEE Jounal of Selection Areas Communication 14, 903–908 (1996)CrossRefGoogle Scholar
  3. 3.
    Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Network From Edge Disjoint Path Algorithms. IEEE Communications Letters 6, 211–213 (2002)CrossRefGoogle Scholar
  4. 4.
    Kim, M.H., Choo, H., Yae, B.H., Lee, J.H.: A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. In: Chung, C.-W., Kim, C.-k., Kim, W., Ling, T.-W., Song, K.-H. (eds.) HSI 2003. LNCS, vol. 2713, pp. 138–147. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Swaminathan, M.D., Sivarajan, K.N.: Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion. IEEE International Conference on Communications 5, 2750–2755 (2002)Google Scholar
  6. 6.
    Chlamtac, I., Farago, A., Zhang, T.: Lightpath (wavelength) routing in large WDM networks. IEEE IEEE Jounal of Selection Areas Communication 14, 909–913 (1996)CrossRefGoogle Scholar
  7. 7.
  8. 8.
    Papadimitratos, P., Haas, Z.J., Sirer, E.G.: Path Set Selection in Mobile Ad Hoc Networks. In: MobiHoc (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hyunseung Choo
    • 1
  • Vladimir V. Shakhov
    • 2
  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversityKOREA
  2. 2.Institute of Computational Mathematics and Mathematical GeophysicsRussian Academy of Sciences (Siberian Branch) 

Personalised recommendations