Skip to main content

Performance Evaluation of Shortest Path Computation for IP and MPLS Multi-service Networks over Open Source Implementation

  • Conference paper
Service Assurance with Partial and Intermittent Resources (SAPIR 2004)

Abstract

In this work is shown a performance evaluation of two open source platforms in the case of a link failure event, both of them based on the Shortest Path Computation routing paradigm. We present the results of measures using five different traffic flows in a multi-service network. The measures consider recovery time, latency and packet losses. We also illustrate the development of a simple routine for the establishment of new LSP (Label Switched Path) based in one of the open source platforms. Considering the results of our evaluation, some ideas and work in the area that may improve the results are suggested.

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 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. Bonnet, G., Shen, Y.: Next Generation Telecommunication Services Based on SIP. Alcatel Telecommunications Review (2nd Quarter 2002)

    Google Scholar 

  2. Iovanna, P., Sabella, R., Settembre, M.: A Traffic Engineering System for Multilayer Networks based on the GMPLS Paradigm. IEEE Network, pp. 28–37 (March/April 2003)

    Google Scholar 

  3. Banerjee, G., Sidhu, D.: Comparative Analysis of Path Computation Techniques for MPLS Traffic Engineering. The International Journal of Computer and Telecommunications Networking 40(1), 149–165 (September 2002)

    Google Scholar 

  4. Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS Adaptive Traffic Engineering. IEEE INFOCOM (2001)

    Google Scholar 

  5. Dinan, E., Awduche, D., Jabbari, B.: Optimal Traffic Partitioning in MPLS Networks. In: NETWORKING 2001, Proceedings. LNCS, pp. 144–155. Springer-Verlag, Heidelberg (2000)

    Google Scholar 

  6. Gao, D., Shu, Y., Liu, S.: Delay Based Adaptive Load Balancing in MPLS Networks. ICC2002

    Google Scholar 

  7. RSVP-TE daemon for DiffServ over MPLS, http://dsmpls.atlantis.ugent.be/

  8. Avallone, S., Esposito, M., Pescapè, A., Romano, S.P., Ventre, G.: An Experimental Analysis of Diffserv-MPLS Interoperability. In: Proceedings of the 10th International Conference on Telecommunications (ICT 2003), Papeete (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdalla, H. et al. (2004). Performance Evaluation of Shortest Path Computation for IP and MPLS Multi-service Networks over Open Source Implementation. In: Dini, P., Lorenz, P., de Souza, J.N. (eds) Service Assurance with Partial and Intermittent Resources. SAPIR 2004. Lecture Notes in Computer Science, vol 3126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27767-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27767-5_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22567-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics