Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

  • David Hock
  • Matthias Hartmann
  • Michael Menth
  • Michal Pioro
  • Artur Tomaszewski
  • Cezary Żukowski
Publiceringsår: 2013
Språk: Engelska
Sidor: 947-958
Publikation/Tidskrift/Serie: Telecommunications Systems
Volym: 52
Nummer: 2
Dokumenttyp: Artikel i tidskrift
Förlag: Springer


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering


  • ISSN: 1018-4864

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen