Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Compact Node-Link Formulations for the Optimal Single-Path MPLS Fact Reroute Layout

Żukowski, C. ; Tomaszewski, A. ; Pioro, Michal LU ; Hock, D. ; Hartmann, M. and Menth, M. (2011) In Advances in Electronics and Telecommunications 2(3). p.55-60
Abstract
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.
Please use this url to cite or link to this publication:
author
; ; ; ; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Advances in Electronics and Telecommunications
volume
2
issue
3
pages
55 - 60
publisher
Poznań University of Technology
ISSN
2081-8580
language
English
LU publication?
yes
id
51836996-c5a4-4ce8-b2a6-0a9577f6979d (old id 5276396)
alternative location
http://advances.et.put.poznan.pl/issues/3/ATE_issue3_p0080.pdf
date added to LUP
2016-04-01 13:47:52
date last changed
2025-04-04 14:22:16
@article{51836996-c5a4-4ce8-b2a6-0a9577f6979d,
  abstract     = {{This paper discusses compact node-link formulations<br/><br>
for MPLS fast reroute optimal single path layout. We<br/><br>
propose mathematical formulations for MPLS fast reroute local<br/><br>
protection mechanisms. In fact, we compare one-to-one (also<br/><br>
called detour) local protection and many-to-one (also called<br/><br>
facility backup) local protection mechanisms with respect to minimized<br/><br>
maximum link utilization. The optimal results provided by<br/><br>
the node-links are compared with the suboptimal results provided<br/><br>
by algorithms based on non-compact linear programming (path<br/><br>
generation) approach and IP-based approach.}},
  author       = {{Żukowski, C. and Tomaszewski, A. and Pioro, Michal and Hock, D. and Hartmann, M. and Menth, M.}},
  issn         = {{2081-8580}},
  language     = {{eng}},
  number       = {{3}},
  pages        = {{55--60}},
  publisher    = {{Poznań University of Technology}},
  series       = {{Advances in Electronics and Telecommunications}},
  title        = {{Compact Node-Link Formulations for the Optimal Single-Path MPLS Fact Reroute Layout}},
  url          = {{http://advances.et.put.poznan.pl/issues/3/ATE_issue3_p0080.pdf}},
  volume       = {{2}},
  year         = {{2011}},
}