Compact Node-Link Formulations for the Optimal Single-Path MPLS Fact Reroute Layout
Författare
Summary, in English
This paper discusses compact node-link formulations
for MPLS fast reroute optimal single path layout. We
propose mathematical formulations for MPLS fast reroute local
protection mechanisms. In fact, we compare one-to-one (also
called detour) local protection and many-to-one (also called
facility backup) local protection mechanisms with respect to minimized
maximum link utilization. The optimal results provided by
the node-links are compared with the suboptimal results provided
by algorithms based on non-compact linear programming (path
generation) approach and IP-based approach.
for MPLS fast reroute optimal single path layout. We
propose mathematical formulations for MPLS fast reroute local
protection mechanisms. In fact, we compare one-to-one (also
called detour) local protection and many-to-one (also called
facility backup) local protection mechanisms with respect to minimized
maximum link utilization. The optimal results provided by
the node-links are compared with the suboptimal results provided
by algorithms based on non-compact linear programming (path
generation) approach and IP-based approach.
Avdelning/ar
Publiceringsår
2011
Språk
Engelska
Sidor
55-60
Publikation/Tidskrift/Serie
Advances in Electronics and Telecommunications
Volym
2
Issue
3
Länkar
Dokumenttyp
Artikel i tidskrift
Förlag
Poznań University of Technology
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 2081-8580