Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

  • Won Jin Yoon
  • Duk Hun Kim
  • Min Young Chung
  • Tae-Jin Lee
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3981)


The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach for EDP (BGAforEDP). The proposed algorithm outperforms by approximately 20% under the traditional fixed topology (NSFNET) and approximately 32% under random topologies, using the BGAforEDP algorithm.


Optical Network Wavelength Division Multiplex Connection Request Wavelength Assignment Wavelength Converter 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM Networks. Optical Network Magazine 1, 47–60 (2000)Google Scholar
  2. 2.
    Murthy, C.S.R.: WDM optical networks: Concepts, design, and algorithm. Prentice Hall PTR, Englewood Cliffs (2002)Google Scholar
  3. 3.
    Ramaswami, K., Sivarajan, K.: Routing and Wavelength Assignment in All-Optical Networks. IEEE/ACM Trans. on Net. 3, 489–500 (1995)CrossRefGoogle Scholar
  4. 4.
    Kolliopoulos, S., Stein, C.: Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 153–168. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Commu. Lett. 5, 211–213 (2002)CrossRefGoogle Scholar
  6. 6.
    Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE JSAC 14, 903–908 (1996)Google Scholar
  7. 7.
    Zhang, Y., Taira, K., Takagi, H., Das, S.K.: An Efficient Heuristic for Routin and Wavelength Assignment in Optical WDM Networks. IEEE ICC 5, 2734–2739 (2002)Google Scholar
  8. 8.
    Swaminathan, M.D., Sivarajan, K.N.: Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion. IEEE ICC 5, 2750–2755 (2002)Google Scholar
  9. 9.
    Alanyali, M., Ayanoglu, E.: Provisioning algorithms for WDM optical networks. IEEE/ACM Trans. on Net. 7, 767–778 (1999)CrossRefGoogle Scholar
  10. 10.
    Chlamtac, I., Farago, A., Zhang, T.: Lightpath (wavelength) routing in large WDM networks. IEEE JSAC 14, 909–913 (1996)Google Scholar
  11. 11.
    Kim, M.H., Choo, H.: A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. LNCS, vol. 2713, pp. 138–147. Springer, Heidelberg (2003)Google Scholar
  12. 12.
    Papadimitratos, P., Haas, Z.J., Sirer, E.G.: Path Set Selection in Mobile Ad Hoc Networks. MobiHoc (2002)Google Scholar
  13. 13.
    Li, G., Simha, R.: The Partition Coloring Problem and its Application to Wavelength Routing and Assignment. In: Proc. of the First Workshop on Optical Networks (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Won Jin Yoon
    • 1
  • Duk Hun Kim
    • 1
  • Min Young Chung
    • 1
  • Tae-Jin Lee
    • 1
  • Hyunseung Choo
    • 1
  1. 1.Lambda Networking Center, School of Information and Communication EngineeringSungkyunkwan UniversitySuwon, Kyunggi-doKorea

Personalised recommendations