Skip to main content
SpringerLink
Log in

Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths

  • Conference paper
Genetic and Evolutionary Computing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 238))

Abstract

The routing and wavelength assignment (RWA) problem is NP-hard and also an important issue in wavelength-division multiplexing (WDM) optical networks. We propose an algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem. The performance of the proposed method has been verified by experiments on several realistic network topologies.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Martins, A.X., Duhamel, C., Mahey, P., Saldanha, R.R., de Souza, M.C.: Variable neighborhood descent with iterated local search for routing and wavelength assignment. Computers and Operations Research 39(9), 2133–2141 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hsu, C.-C., Cho, H.-J.: A Genetic Algorithm for the Maximum Edge-disjoint Paths Problem. Accepted by Neurocomputing

    Google Scholar 

  3. Li, G., Shmha, R.: The partition coloring problem and its application to wavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks (2000)

    Google Scholar 

  4. 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 

  5. Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: an approach to high bandwidth optical WAN’s. IEEE Transactions on Communications 40(7), 1171–1182 (1992)

    Article  Google Scholar 

  6. Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A functional classification of routing and wavelength assignment schemes in DWDM networks: Static Case. In: Proceedings of the 7th International Conference on Optical Communications and Networks, pp. 1109–1115 (2000)

    Google Scholar 

  7. Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. European Journal of Operational Research 177, 1167–1179 (2007)

    Article  MATH  Google Scholar 

  8. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communications Letters 6(5), 211–213 (2002)

    Article  Google Scholar 

  9. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. Journal of Global Optimization 50(3), 503–518 (2011)

    Article  Google Scholar 

  10. Noraha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition colouring. European Journal of Operational Research 171(3), 797–810 (2006)

    Article  Google Scholar 

  11. Fischer, T., Bauer, K., Merz, P., Bauer, K.: Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm. Memetic Computing 1(2), 101–123 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Transportation Technology and Management, National Chiao Tung University, Hsinchu, 300, Taiwan, ROC

    Chia-Chun Hsu & Hsun-Jung Cho

  2. Department of Industril and Systems Engineering, North Carolina State University, Raleigh, NC, USA

    Chia-Chun Hsu & Shu-Cherng Fang

Authors
  1. Chia-Chun Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hsun-Jung Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shu-Cherng Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chia-Chun Hsu .

Editor information

Editors and Affiliations

  1. Department of Electronic Engineering, National Kaohiung University of Applied Sciences, Kaohsiung, Taiwan

    Jeng-Shyang Pan

  2. Department of Computer Science Faculty of Ele. Eng. & Computer Science, VÅ B-TUO, Ostrava-Poruba, Czech Republic

    Pavel Krömer

  3. Department of Computer Science Faculty of Ele. Eng. & Computer Science, VÅ B-TUO, Ostrava-Poruba, Czech Republic

    Václav Snášel

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hsu, CC., Cho, HJ., Fang, SC. (2014). Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths. In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01796-9_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01795-2

  • Online ISBN: 978-3-319-01796-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation