Skip to main content
SpringerLink
Log in

Least Interference Optimization Based Dynamic Multi-path Routing Algorithm in ASON

  • Conference paper
Challenges for Next Generation Network Operations and Service Management (APNOMS 2008)

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

Included in the following conference series:

  • 1096 Accesses

Abstract

Based on current load balance and minimum interference routing technology, a least interference optimization based dynamic multi-path routing algorithm (LI-DMA) in automatically switched optical network (ASON) is proposed. LI-DMA employs least interference technology and takes future demands into consideration while calculating routing paths. In LI-DMA, the link cost is dynamically adjusted according to its residual capacity and criticality, and the traffic is distributed to several disjoint paths equally while loading the connections. Simulation results show that, compared with conventional routing algorithms, LI-DMA can efficiently decrease the blocking probability of network and achieve better performance of load balance.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Hui, L., Yueming, L., Yuefeng, J.: Dynamic Traffic Sharing Algorithms for Balanced Optical Internet. In: Proceeding of SPIE APOC 2005, p. 60221S (2005)

    Google Scholar 

  2. Bagula, B., Botha, M., Krzesinski, E.: Online Traffic Engineering: the Least Interference Optimization Algorithm. In: Proceeding of IEEE ICC 2004, pp. 123–1236 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Optical Communication and Lightwave Technologies Ministry of Education, Beijing University of Posts and Telecommunications, 100876, Beijing, China

    Tong Zhao, Yueming Lu & Yuefeng Ji

Authors
  1. Tong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yueming Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuefeng Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Network Information Center, Beijing University of Posts and Telecommunications, 100876, Beijing, China

    Yan Ma

  2. School of Electronic & Computer Engineering, Chonnam National University, 500-757, Gwangju, Republic of Korea

    Deokjai Choi

  3. Graduate School of Engineering Osaka City University, 3–3–138 Sugimoto, Sumiyoshi-ku, 558–8585, Osaka, Japan

    Shingo Ata

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, T., Lu, Y., Ji, Y. (2008). Least Interference Optimization Based Dynamic Multi-path Routing Algorithm in ASON. In: Ma, Y., Choi, D., Ata, S. (eds) Challenges for Next Generation Network Operations and Service Management. APNOMS 2008. Lecture Notes in Computer Science, vol 5297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88623-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88623-5_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88622-8

  • Online ISBN: 978-3-540-88623-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation