Photonic Network Communications

, Volume 12, Issue 2, pp 145–152 | Cite as

Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths

  • Hyunseung ChooEmail author
  • Vladimir V. Shakhov
  • Biswanath Mukherjee


In the present paper, routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques based on the combination of integer linear programming based lpsolver and graph coloring are complex and require extensive use of heuristics such as rounding heuristic which makes them slow and sometimes practically not reasonable. Another method employs the greedy approach in graph theory 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. Here, we compare the offered method with previous edge disjoint paths algorithms applied to the RWA. Comprehensive computer simulation shows that the proposed method outperforms previous ones significantly in terms of running time. Furthermore, the new method shows compatible or better performance comparing to others in number of wavelengths used.


Routing Wavelength assignment Edge disjoint paths Maximum flow Lightpath 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zang H., Jue J.P., Mukherjee B. (2000) A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt. Networks Mag. 1, 47–60Google Scholar
  2. 2.
    Ramaswami R., Sivarajan K. (1995) Routing and wavelength assignment in all-optical network. IEEE/ACM Trans. Network. 3, 489–500CrossRefGoogle Scholar
  3. 3.
    Banerjee D., Mukherjee B. (1996) Practical approach for routing and wavelength assignment in large wavelength routed optical. IEEE J. Select. Areas Commun. 14, 903–908CrossRefGoogle Scholar
  4. 4.
    Manohar P., Manjunath D., Shevgaonkar R.K. (2002) Routing and assignment in optical network from edge disjoint path algorithms. IEEE Commun. Lett. 6, 211–213CrossRefGoogle Scholar
  5. 5.
    Kim M.H., Choo H., Yae B.H., Lee J.H. (2003) A practical RWA based on lookup table for edge disjoint paths. Lect. Notes Comput. Sci. 2713, 138–147zbMATHCrossRefGoogle Scholar
  6. 6.
    Zhang Y., Taira K., Takagi H., Das S.K. (2002) An efficient heuristic for routing and wavelength assignment in optical WDM networks. IEEE Int. Confer. Commun. 5, 2734–2739Google Scholar
  7. 7.
    Swaminathan M.D., Sivarajan K.N. (2002) Practical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion. IEEE Int. Confer. Commun. 5, 2750–2755Google Scholar
  8. 8.
    Alanyali M., Ayanoglu E. (1999). Provisioning algorithms for WDM networks. IEEE/ACM Trans. Network. 7, 767–778CrossRefGoogle Scholar
  9. 9.
    Chlamtac I., Farago A., Zhang T. (1996) Lightpath (wavelength) in large WDM networks. IEEE J. Select. Areas Commun. 14, 909–913CrossRefGoogle Scholar
  10. 10. Scholar
  11. 11.
    Kleinberg J.M.: Approximation algorithms for disjoint paths Ph.D. dissertation, MIT, Cambridge (1996)Google Scholar
  12. 12.
    Ford L.R., Fulkerson D.R. (1962) Flows in Network. Princeton Press, PrincetonGoogle Scholar
  13. 13.
    Papadimitratos P., Haas Z.J., Sirer E.G.: Path Set Selection in Mobile Ad Hoc Networks. MobiHoc (2002)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Hyunseung Choo
    • 1
    Email author
  • Vladimir V. Shakhov
    • 2
  • Biswanath Mukherjee
    • 3
  1. 1.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea
  2. 2.Institute of Computational Mathematics and MathematicalGeophysics, Russian Academy of Sciences (Siberian Branch)NovosibirskRussia
  3. 3.Department of Computer ScienceUniversity of CaliforniaDavisUSA

Personalised recommendations