Skip to main content

A Simple and Efficient RWA Algorithm Based on Priority of Edge Disjoint Paths

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3981))

Included in the following conference series:

  • 618 Accesses

Abstract

Routing and wavelength assignment (RWA) is an important issue in WDM optical transport networks. The objective is to find lightpaths for given demands with minimal use of wavelengths. It is typically solved using combination of linear programming and graph coloring, or heuristic path selection algorithms. Such methods are complex or yield sub-optimal paths. In this paper, we propose an efficient algorithm, RWA based on Priorities of Shortest Path (RPSP). The proposed algorithm utilizes the lengths of the shortest paths for the source-destination demand pairs and assigns disjoint lightpaths to the ordered demands. The computer simulation shows that our proposed algorithm indeed requires up to 34% fewer wavelengths with almost identical running time than the previously proposed effective BGAforEDP algorithm.

This work was supported by University Fundamental Research Program funded by Ministry of Information and Communication in Republic of Korea.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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(1), 47–60 (2000)

    Google Scholar 

  2. Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE Journal on Selected Areas in Communications 14, 903–908 (1996)

    Article  Google Scholar 

  3. Ohta, S., Greca, A.: Comparison of Routing and Wavelength Assignment for Optical Networks. In: Proc. of IEEE Workshop on High Performance Switching and Routing, pp. 146–149 (2001)

    Google Scholar 

  4. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Communication Letters 5, 211–213 (2002)

    Article  Google Scholar 

  5. 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 ICC, vol. 5, pp. 2734–2739 (2002)

    Google Scholar 

  6. Swaminathan, M.D., Sivarajan, K.N.: Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion. In: Proc. of IEEE ICC, vol. 5, pp. 2750–2755 (2002)

    Google Scholar 

  7. Alanyali, M., Ayanoglu, E.: Provisioning Algorithms for WDM Optical Networks. IEEE/ACM Trans. on Networking 7(5), 767–778 (1999)

    Article  Google Scholar 

  8. Chlamtac, I., Farago, A., Zhang, T.: Lightpath (Wavelength) Routing in Large WDM Networks. IEEE Journal on Selected Areas in Communications 14(5), 909–913 (1996)

    Article  Google Scholar 

  9. Ramamurthy, S., Mukherjee, B.: Fixed-Alternate Routing and Wavelength Conversion in Wavelength-Routed Optical Networks. In: Proc. of IEEE Globecom, pp. 2734–2739 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yim, SB., Chung, M.Y., Choo, H., Lee, TJ. (2006). A Simple and Efficient RWA Algorithm Based on Priority of Edge Disjoint Paths. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_119

Download citation

  • DOI: https://doi.org/10.1007/11751588_119

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34072-0

  • Online ISBN: 978-3-540-34074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics