Performance evaluation of Multiple Routing Configurations

Cevher, Selcuk; Ulutaş, Mustafa; Hökelek, İbrahim

doi:10.1109/siu.2013.6531353

Cited by 6 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RLFA router may be several hops away from the source router S. The RLFA mechanism can provide a higher repair coverage than the basic LFA, but at the cost of higher computational complexity . Another existing, though less common IPFRR mechanisms are Equal‐cost multi‐path (ECMP), Multiple Routing Configurations (MRC), Not‐Via Addresses, tunnel based approaches, Maximally Redundant Trees (MRT) and other spanning tree based IPFRR approaches; we will not discuss these in detail. Some of existing IPFRR mechanisms can provide a high level of repair coverage reaching almost 100% (Not‐Via Addresses, MRC, MRT) .…”

Section: Related Workmentioning

confidence: 99%

“…This makes the IPFRR mechanisms dependent on the presence of link‐state routing protocols. This fact limits the usability of RLFA, MRC, MRT, or Not Via Addresses . The rest of listed IPFRR mechanisms (LFA, ECMP) also works with distance‐vector routing protocols.…”

Section: Related Workmentioning

confidence: 99%

“…An important part of IPFRR is the fault detection and a method informing other routers about the occurrence of a specific failure. Some of IPFRR mechanisms (MRT, MRC) disseminate the information about a failure by modifying specific bits of the IP packet header (Table ). Other encapsulate an original packet within another one with a new IP header.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Papán

Segeč

Palúch

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary The network convergence time may take hundreds of milliseconds or more. Since this repair performance may be unsatisfactory, IP fast reroute (IPFRR) approaches have been developed to decrease the network convergence time and minimize traffic loss. These IPFRR mechanisms are usually based on the proactive precomputation of a backup path before a failure occurs. Once a failure is detected, the router running IPFRR will immediately use this backup path in response to the failure, rather than computing a replacement path only after a failure has occurred. The computation of an alternative path in many IPFRR mechanisms requires that the computing node (router) knows the exact network topology. In this paper, we present a new IPFRR mechanism called the multicast repair (M‐REP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers‘ (ISP‘s) core networks. The M‐REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast – Dense Mode (PIM‐DM) with the modification of an internal reverse path forwarding (RPF) check. The M‐REP IPFRR mechanism does not depend on any particular routing protocol type (distance‐vector or link‐state) and requires less system resources because of its precomputation‐less character but still provides immediate reaction to failure.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The new Multicast Repair (M‐REP) IP fast reroute mechanism

Papán

Segeč

Palúch

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Our previous work shows that the number of VTs that should be constructed by MRC highly depends on the structure of network topologies. This implies that the performance of MRC may differ even for topologies with the same number of nodes and densities.…”

Section: Introductionmentioning

confidence: 99%

“…However, the number of VTs required by MRC to successfully isolate each node in one of the VTs should be kept as small as possible because higher number of VTs consume more network resources as MTR-based IPFRR requires the computation of an SPF tree and the maintenance of forwarding states in routers for each VT [7,8]. Using realistic ISP topologies, we evaluated the number of VTs needed by MRC for a successful termination in [9] where the results showed that the structural properties of network topologies that affect the performance of MRC cannot be characterized solely by the network size and density. Therefore, we investigated the other structural metrics of network topologies that possibly affect the number of VTs in [10] using our automation tool, whose experimental results showed that there is a correlation between the performance of MRC and the number of hub nodes in a topology that have a much higher degree compared with the other nodes.The VT construction algorithm presented in [7] to reduce the number of VTs in MRC increases the complexity of the forwarding process in routers.…”

mentioning

confidence: 99%

Enhancing Multiple Routing Configurations through systematic analysis of topological characteristics

2016

Self Cite

View full text Add to dashboard Cite

Summary Previous studies show that topological characteristics in IP networks significantly influence the performance of networking algorithms, which therefore should be systematically analyzed using diverse topologies prior to their deployments. In this paper, we present an elaborate topological dependency analysis of a multi‐topology routing‐based IP fast re‐route technology, namely, Multiple Routing Configurations (MRC), using a large topology pool with diverse properties. Through an extensive analysis using our automated topological analysis tool, we discover a significant correlation between the performance of MRC and topological characteristics. MRC needs to construct a higher number of virtual topologies to provide full alternate path coverage if a network topology tends to have more hub nodes, whose degree is much higher than the rest of the network. Inspired by our topological analysis results, we propose a new heuristic algorithm enhancing MRC. Numerical experiments demonstrate that our heuristic significantly improves the performance of MRC confirming the effectiveness of the systematic analysis of topological characteristics. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract