Robust IP Link Costs for Multilayer Resilience

Menth, Michael; Hartmann, Matthias; Martin, R.

doi:10.1007/978-3-540-72606-7_64

Cited by 17 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [3], we proposed a heuristic link cost optimization and extended it to consider fast reroute in [5]. We used this threshold accepting heuristic to obtain routing configurations for each network with low maximal link utilizations.…”

Section: B Numerical Resultsmentioning

confidence: 99%

“…Then, we introduce an algorithm that finds an order-independent upper bound to this maximum link utilization. The upper bound is tight, can be computed quickly, and allows us to extend our heuristic routing optimization framework [3]- [5] to consider the OFIB process. To the best of our knowledge, we provide the first resilient IP routing optimization that considers not only the failure-free, fast reroute and failure case but also the loop-free convergence phase.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Loop-free convergence using ordered FIB updates: Analysis and routing optimization

Hock

Hartmann

Neubert

et al. 2011

2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN)

Self Cite

View full text Add to dashboard Cite

Intradomain IP routing protocols like OSPF or IS-IS are robust against failures. New fast reroute mechanisms can minimize packet loss directly after an outage by temporarily detouring packets around the failed network element. This buys time for a loop-free convergence, which brings the topology to a new stable path layout without causing temporary micro-loops.We analyze the link utilizations during this loop-free convergence phase using the ordered FIB updates (OFIB) mechanism. We show that depending on the router update order, OFIB can temporarily increase the utilization on certain links in the network. To minimize the temporary load increase, we present a heuristic link cost optimization that minimizes the link utilizations both during failure-free routing and all phases of a failure recovery process. As OFIB does not define a unique global update order but provides only local constraints, it is difficult to calculate the highest possible link utilizations. We introduce a tight upper bound to the maximum link utilization, independent of the actual update order. It can quickly be calculated and allows us to perform link cost optimization including the loopfree convergence phase. We show that this results in a routing configuration that avoids additional overload during the OFIB phase without impairing normal routing performance.

show abstract

Section: B Numerical Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Loop-free convergence using ordered FIB updates: Analysis and routing optimization

Hock

Hartmann

Neubert

et al. 2011

2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Heuristics and exact algorithms for this have been proposed in [7]- [9], [35]. An acceleration of the heuristics was suggested in [36], and a performance study regarding the optimization quality and speed has been presented in [37]. The analysis in [38] shows that ECMP routing has a larger optimization potential than SSP routing.…”

Section: ) Optimal Shared Protection: Murakami and Kimmentioning

confidence: 99%

Overview of resilience mechanisms based on multipath structures

Menth

Martin

Koster

et al. 2007

2007 6th International Workshop on Design and Reliable Communication Networks

Self Cite

View full text Add to dashboard Cite

Multipath structures are the base for many recently developed rerouting and protection switching mechanisms. All of these methods show a similar path layout, rely on traffic distribution, and promise resilience with only little backup capacity. Therefore, it is hard to recognize their commonalities and differences at first sight. This paper provides an overview of these related mechanisms and a comparative analysis regarding their applicability in optical and packet switched technologies, their path layout, their reaction time, their dynamic adaptability, and many other aspects.

show abstract

“…the cost for any link is set to 1. However, the link costs can be adjusted by heuristic algorithms in such a way that the maximum link utilisation ρ S of the network is minimised for all protected failure scenarios S. For the numerical results in Section 4 we use the method from Reference [21] for the optimisation of IP link costs both for SSP and ECMP routing. We refer to these options by optSSP and optECMP.…”

Section: Ip Routing and Reroutingmentioning

confidence: 99%

Efficiency of routing and resilience mechanisms in packet‐switched communication networks

Menth¹,

Martin²,

Hartmann³

et al. 2009

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

SUMMARYIn this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilisation of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilisation ρ S of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilisation ρ S . We consider standard and optimised versions of IP routing and rerouting, optimised routing using explicit paths and end-to-end protection switching, as well as standard and optimised versions of Multiprotocol label switching (MPLS) fast reroute. The results show that routing optimisation reduces the maximum link utilisation significantly both with and without failure protection. The optimisation potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.

show abstract

Robust IP Link Costs for Multilayer Resilience

Cited by 17 publications

References 12 publications

Loop-free convergence using ordered FIB updates: Analysis and routing optimization

Loop-free convergence using ordered FIB updates: Analysis and routing optimization

Overview of resilience mechanisms based on multipath structures

Efficiency of routing and resilience mechanisms in packet‐switched communication networks

Contact Info

Product

Resources

About