A New Precomputation Scheme for MPLS Traffic Engineering Routing | SpringerLink
Skip to main content
Springer Nature Link
Log in

A New Precomputation Scheme for MPLS Traffic Engineering Routing

  • Conference paper
Distributed Computing and Networking (ICDCN 2006)

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

Included in the following conference series:

  • 557 Accesses

Abstract

This paper presents a new precomputation algorithm for Multi Protocol Label Switching (MPLS) traffic engineering routing. The prior MPLS routing algorithms try to minimize the interference between different source-destination pairs by circumventing the critical links. But the process of identifying critical links is very computationally expensive. The main contribution of this paper is a new precomputation approach of route selection considering the interference. The proposed algorithm reduces online computing complexity through efficient precomputation. From the simulation results, the proposed algorithm outperforms prior algorithms in terms of efficiency and complexity.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Kodialam, M.S., Lakshman, T.V.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: INFOCOM 2000, Tel Aviv, Israel, pp. 884–893 (2000)

    Google Scholar 

  2. Suri, S., Waldvogel, M., Warkhede, P.R.: Profile based Routing: A new Framework for MPLS Traffic Engineering. In: Smirnov, M., Crowcroft, J., Roberts, J., Boavida, F. (eds.) QofIS 2001. LNCS, vol. 2156, pp. 138–157. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Wang, B., Su, X., Chen, C.L.P.: A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering. In: IEEE International Conference on Communications 2002 (ICC 2002), New York, USA, pp. 1001–1005 (2002)

    Google Scholar 

  4. Tapolcai, J., Fodor, P., Rétvári, G., et al.: Class-based minimum interference routing for traffic engineering in optical networks. In: 1st EuroNGI Conference on Next Generation Internet Networks Traffic Engineering, Rome, Italy, pp. 31–38 (2005)

    Google Scholar 

  5. Sa-Ngiamsak, W., Varakulsiripunth, R.: A Bandwidth-Based Constraint Routing Algorithm for Multi-Protocol LabelSwitching Networks. In: IEEE ICACT 2004, Phoenix Park, Korea, pp. 933–937 (2004)

    Google Scholar 

  6. Rétvári, G., Bíró, J.J., Cinkler, T., et al.: A precomputation scheme for minimum interference routing: the Least-Critical-Path-First algorithm. In: INFOCOM 2005, Miami, Florida, USA, pp. 260–268 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer, National University of Defense Technology, Changsha, 410073, P.R. China

    Zhaowei Meng & Jinshu Su

  2. COMICS Lab, Dipartimento di Informatica e Sistemistica, Universit‘a di Napoli Federico II, Via Claudio 21, 80125, Napoli, Italy

    Vittorio Manetti

Authors
  1. Zhaowei Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinshu Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vittorio Manetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 230 Atanasoff Hall, 50011, Ames, IA, USA

    Soma Chaudhuri

  2. Computer Science Department SUNY at Stony Brook Stony Brook, 11794-4400, NY, USA

    Samir R. Das

  3. Department of Computer Science & Engineering, Indian Institute of Technology, 781039, Guwahati, India

    Himadri S. Paul

  4. Dept. of Electrical and Computer Engineering, Iowa State University, 50010, Ames, IA, USA

    Srikanta Tirthapura

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, Z., Su, J., Manetti, V. (2006). A New Precomputation Scheme for MPLS Traffic Engineering Routing. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_44

Download citation

  • DOI: https://doi.org/10.1007/11947950_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68139-7

  • Online ISBN: 978-3-540-68140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation