This paper compares the efficiency of different routing and
resilience mechanisms to avoid congestion in a network for a set of
protected failures. A routing mechanism is more efficient than another
one if it achieves a lower maximum link utilization in the same
networking scenario. With resilience requirements, the maximum link
utilization over the set of protected failure scenarios becomes the
critical value. We consider standard and optimized configurations of
single shortest path (SSP) and equal-cost multipath (ECMP) routing as
well as several types of end-to-end (e2e) path protection and MPLS fast
reroute (FRR). We investigate how well these resilience mechanisms can
cope with different network structures and with different sets of
protected failures. The results show that routing optimization reduces
the maximum link utilization significantly both with and without
protection of failures. The optimization potential for resilient
routing is limited by the applied mechanism and heavily depends on the
network structure and the set of protected failure scenarios.
%0 Report
%1 TR425
%A Menth, Michael
%A Martin, Rüdiger
%A Hartmann, Matthias
%A Spoerlein, Ulrich
%C Department of Computer Science
%D 2007
%K myown
%N 425
%T Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks.
%U http://www3.informatik.uni-wuerzburg.de/TR/tr425.pdf
%X This paper compares the efficiency of different routing and
resilience mechanisms to avoid congestion in a network for a set of
protected failures. A routing mechanism is more efficient than another
one if it achieves a lower maximum link utilization in the same
networking scenario. With resilience requirements, the maximum link
utilization over the set of protected failure scenarios becomes the
critical value. We consider standard and optimized configurations of
single shortest path (SSP) and equal-cost multipath (ECMP) routing as
well as several types of end-to-end (e2e) path protection and MPLS fast
reroute (FRR). We investigate how well these resilience mechanisms can
cope with different network structures and with different sets of
protected failures. The results show that routing optimization reduces
the maximum link utilization significantly both with and without
protection of failures. The optimization potential for resilient
routing is limited by the applied mechanism and heavily depends on the
network structure and the set of protected failure scenarios.
@techreport{TR425,
abstract = {
This paper compares the efficiency of different routing and
resilience mechanisms to avoid congestion in a network for a set of
protected failures. A routing mechanism is more efficient than another
one if it achieves a lower maximum link utilization in the same
networking scenario. With resilience requirements, the maximum link
utilization over the set of protected failure scenarios becomes the
critical value. We consider standard and optimized configurations of
single shortest path (SSP) and equal-cost multipath (ECMP) routing as
well as several types of end-to-end (e2e) path protection and MPLS fast
reroute (FRR). We investigate how well these resilience mechanisms can
cope with different network structures and with different sets of
protected failures. The results show that routing optimization reduces
the maximum link utilization significantly both with and without
protection of failures. The optimization potential for resilient
routing is limited by the applied mechanism and heavily depends on the
network structure and the set of protected failure scenarios.
},
added-at = {2015-06-18T10:00:28.000+0200},
address = {Department of Computer Science},
author = {Menth, Michael and Martin, Rüdiger and Hartmann, Matthias and Spoerlein, Ulrich},
biburl = {https://www.bibsonomy.org/bibtex/20b22d3403dff682608a1dedd26d490a2/trcsuniwue},
interhash = {af202fe56e3abbadf3054deeeb312188},
intrahash = {0b22d3403dff682608a1dedd26d490a2},
keywords = {myown},
month = may,
number = 425,
timestamp = {2015-06-18T10:00:28.000+0200},
title = {Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks.},
type = {Technical Report},
url = {http://www3.informatik.uni-wuerzburg.de/TR/tr425.pdf},
year = 2007
}