The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

Author

  • David Hock
  • Matthias Hartmann
  • Michael Menth
  • Michal Pioro
  • Artur Tomaszewski
  • Cezary Żukowski

Summary, in English

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.

Publishing year

2013

Language

English

Pages

947-958

Publication/Series

Telecommunication Systems

Volume

52

Issue

2

Document type

Journal article

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

ISBN/ISSN/Other

  • ISSN: 1018-4864