Skip to main content
SpringerLink
Log in

A Routing and Wavelength Assignment Algorithms Based on the State Level of Links

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

  • 694 Accesses

Abstract

For the problem of routing and wavelength assignment in Wavelength Division Multiplexing(WDM)optical transport network, an algorithm based on the state of links is proposed, which is named Tradeoff_LSDRAW, and which can select a path with the higher state level between a pair of nodes in a network. Finally, by a example network, we show that the algorithm has the stronger capability of selecting a better path between a pair of nodes, and can achieve the load balancing and reduce the congestion probability in WDM optical transport networks.

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 149.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. EStern, T., Bala, K.: Multiwavelength optical networks: A layered approach (1998). Addison Wesley, Inc., Reading (1998/1999)

    Google Scholar 

  2. IChlamtacAFarago, TZhang: Lightpath (Wavelength) routing in large WDM networks. IEEE Journal of Selected Areas in Communications 14(5), 909–913 (1996)

    Article  Google Scholar 

  3. Li, D., et al.: Minimizing number of wavelength in multicasting routing trees in WDM networks. Networks 35(4), 260–265 (2000)

    Article  Google Scholar 

  4. Narula-Tam, A., Modiano, E.: Dynamic load balancing in WDM packet networks with and without wavelength constraints. IEEE Journal of Selected Areas in Communications 18(10), 1972–1979 (2000)

    Article  Google Scholar 

  5. Dijkstra, E.W.: A note on two problems in connection with graphs. NumerMath 1, 269–271 (1959)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics Science, Xidian University, Xi’an, 710071, P.R.China

    Xiaogang Qi, Sanyang Liu & Junfeng Qiao

Authors
  1. Xiaogang Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanyang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Junfeng Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Laboratory for Parallel and Distributed Processing, NUDT, 410073, Changsha, Hunan, China

    Xicheng Lu

  2. Department of Radiology, State University of New York at Stony Brook, L-4, 120 Health Sciences Center, 11793-8460, Stony Brook, New York,  

    Wei Zhao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qi, X., Liu, S., Qiao, J. (2005). A Routing and Wavelength Assignment Algorithms Based on the State Level of Links. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_20

Download citation

  • DOI: https://doi.org/10.1007/11534310_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation