Telecommunication Systems

, Volume 52, Issue 2, pp 947–958 | Cite as

Comparison of IP-based and explicit paths for one-to-one fast reroute in MPLS networks

  • David HockEmail author
  • Matthias Hartmann
  • Michael Menth
  • Michał Pióro
  • Artur Tomaszewski
  • Cezary Żukowski


Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a specific traffic matrix and for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths. Furthermore, we investigate if explicit path layouts cause an increased configuration effort compared to IP-based layouts and if yes, to what extend.


Routing Multiprotocol label switching MPLS fast reroute Optimization Linear programs Performance comparison 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Pióro, M., Tomaszewski, A., Żukowski, C., Hock, D., Hartmann, M., & Menth, M. (2010). Optimized IP-Based vs. Explicit Paths for One-to-One Backup in MPLS Fast Reroute. In 14th international telecommunications network strategy and planning symposium, Warsaw, Poland, Sep., 2010. Google Scholar
  2. 2.
    Farrel, A., Vasseur, J.-P., & Ash, J. (2006). RFC4655: A Path Computation Element (PCE)-Based Architecture, Aug., 2006. Google Scholar
  3. 3.
    Pióro, M., Szentesi, Á., Harmatos, J., Jüttner, A., Gajowniczek, P., & Kozdrowski, S. (2002). On open shortest path first related network optimisation problems. Performance Evaluation, 48, 201–223. CrossRefGoogle Scholar
  4. 4.
    Menth, M., Hartmann, M., & Martin, R. (2007). Robust IP link costs for multilayer resilience. In IFIP-TC6 networking conference (Networking), Atlanta, GA, USA, May, 2007. Google Scholar
  5. 5.
    Hock, D., Hartmann, M., Menth, M., & Schwartz, C. (2010). Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks. In IEEE network operations and management symposium (NOMS), Osaka, Japan, Apr., 2010. Google Scholar
  6. 6.
    Menth, M., Martin, R., Hartmann, M., & Spoerlein, U. (2010). Efficiency of routing and resilience mechanisms in packet-switched communication networks. European Transactions on Telecommunications (ETT), 21(2). doi: 10.1002/ett.1379.
  7. 7.
    Hartmann, M., Hock, D., Schwartz, C., & Menth, M. (2009). Objective functions for optimization for resilient and non-resilient IP routing. In 7th international workshop on design of reliable communication networks (DRCN), Washington, DC, USA, Oct., 2009. Google Scholar
  8. 8.
    Pióro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Francisco: Morgan Kaufman. Google Scholar
  9. 9.
    Orlowski, S., & Pióro, M. (2009). On the complexity of column generation in survivable network design with path-based survivability mechanisms. In International network optimization conference (INOC). Google Scholar
  10. 10.
    Batchelor, P., et al. (1999). Ultra high capacity optical transmission networks (Final Report of Action COST 239), Jan., 1999. Google Scholar
  11. 11.
    The GEANT website (2008).
  12. 12.
    Menth, M. (2004). Efficient admission control and routing in resilient communication networks. PhD thesis, University of Würzburg, Faculty of Computer Science, July, 2004. Google Scholar
  13. 13.
    Spring, N., Mahajan, R., & Wetherall, D. (2002). Measuring ISP topologies with Rocketfuel. In ACM SIGCOMM, Pittsburgh, PA, Aug., 2002. Google Scholar
  14. 14.
    Nucci, A., Sridharan, A., & Taft, N. (2005). The problem of synthetically generating IP traffic matrices: initial recommendations. Computer Communication Review, 35(3), 19–32. CrossRefGoogle Scholar
  15. 15.
    Roughan, M. (2005). Simplifying the synthesis of Internet traffic matrices. Computer Communication Review, 35(5), 93–96. CrossRefGoogle Scholar
  16. 16.
    Martin, R., & Menth, M. (2006). Backup capacity requirements for MPLS fast reroute. In 7th ITG workshop on photonic networks, Leipzig, Germany, Apr., 2006 (pp. 95–102). Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • David Hock
    • 1
    Email author
  • Matthias Hartmann
    • 1
  • Michael Menth
    • 2
  • Michał Pióro
    • 3
    • 4
  • Artur Tomaszewski
    • 3
  • Cezary Żukowski
    • 3
  1. 1.Institute of Computer ScienceUniversity of WürzburgWürzburgGermany
  2. 2.Wilhelm-Schickard-Institute of Computer ScienceUniversity of TübingenTübingenGermany
  3. 3.Institute of TelecommunicationsWarsaw University of TechnologyWarsawPoland
  4. 4.Department of Electrical and Information TechnologyLund UniversityLundSweden

Personalised recommendations