Performance Evaluation of MPLS Path Restoration Schemes using OMNET++

  • Marcelino Minero-Muñoz
  • Vicente Alarcon-Aquino
  • Jose Galdino García-Fierro
  • Roberto Rosas-Romero
  • Jorge Rodriguez-Asomoza
  • Oleg Starostenko
Conference paper

Abstract

Multi-Protocol Label Switching (MPLS) is an alternative to integrate Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees traffic engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. Considering that MPLS is a label switching technology, it uses a method for label distribution based on signaling protocols like LDP (Label Distribution Protocol) among others. In this paper we present the simulation of some LDP messages and assess the performance of three path restoration schemes (Haskin, Makam, and Simple Dynamic) in an MPLS network using OMNET++. The simulation results show that the Simple Dynamic scheme presents a reduced arrival time when sending a message from the source to a destination, when compared to those times obtained to Haskin and Makam schemes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Marconi white paper, Building scalable Service Provider IP Networks, Connection-Oriented Networking Solutions, July 2000.Google Scholar
  2. [2]
    Uyless Black, MPLS and Label Switching Networks, Second Edition, New Jersey, Prentice Hall 2002.Google Scholar
  3. [3]
    Andersson L., Doolan P., Feldman N., Fredette A., Thomas B., LDP Specification, RFC3036, January 2001.Google Scholar
  4. [4]
    V. Alarcon-Aquino, J. C. Martínez Suárez, Introduction to MPLS Networks (in Spanish). El Cid Editor, 2006.Google Scholar
  5. [5]
    Johan Martin Olof Petersson, MPLS based recovery mechanisms, Master Thesis, University of Oslo, May 2005.Google Scholar
  6. [6]
    D. Haskin, R. Krishnan. A method for setting an alternative label switched path to handle fast reroute. Draft-haskin-mpls-fast-reroute-05.txt. November 2000.Google Scholar
  7. [7]
    S. Makam, V. Sharma, K. Owens, C. Huang. Protection / Restoration of MPLS Networks. Draft-makam-mpls-protection-00.txt. October 1999.Google Scholar
  8. [8]
    Ahn G, Chun W. “Simulator for MPLS Path Restoration and Performance Evaluation”, Joint 4 th IEEE International Conference on ATM (ICATM2001) and High Speed Intelligent Internet, April 2001, pp. 32–36.Google Scholar
  9. [9]
    Hundessa Gonfa, Lemma, Enhanced Fast Rerouting Mechanisms for Protected Traffic in MPLS Networks, Professional Thesis, Universidad Politécnica de Cataluña, 2003.Google Scholar
  10. [10]
    Varga, A., “OMNeT++, User Manual”, OMNeT ++ Discrete Event Simulation System. Available at: http://www.omnetpp.org/doc/manual/usman.html.
  11. [11]
    V. Alarcon-Aquino, J. C. Martinez, L. G. Guerrero-Ojeda, Y. Takahashi, MPLS/IP Analysis and Simulation for the Implementation of Path Restoration Schemes, WSEAS Transactions on Computers, Issue 6, Vol. 3, December 2004. p. 1911–1916.Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Marcelino Minero-Muñoz
    • 1
  • Vicente Alarcon-Aquino
    • 1
  • Jose Galdino García-Fierro
    • 1
  • Roberto Rosas-Romero
    • 1
  • Jorge Rodriguez-Asomoza
    • 1
  • Oleg Starostenko
    • 1
  1. 1.Department of Computing, Electronics, and MechatronicsCommunication and Signal Processing Research Group, Universidad de las Americas PueblaCholulaMexico

Personalised recommendations