Failure Insensitive Routing for Ensuring Service Availability

Nelakuditi, Srihari; Lee, Sanghwan; Yu, Yang; Zhang, Zhili

doi:10.1007/3-540-44884-5_16

Cited by 39 publications

(37 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since a forwarding loop is possible during the network transient period, we consider all the network transient periods as unavailable time for both OSPF and FIR. 8 Besides, under OSPF, when a router suppresses a failed link, forwarding between some source-destination pairs could be disrupted. We, therefore, count suppression periods too as unavailable time under OSPF.…”

Section: B Network Availabilitymentioning

confidence: 99%

“…Therefore, the lower bound can be represented in the following formula, which we will refer to as "FIR-1:" Next, we consider two simultaneously suppressed link failures also as network available time under FIR. We need to add the following periods in a cycle to the available portion: periods when exactly two links in the network are being suppressed, 8 Even during the transient period, forwarding between all node pairs may be possible depending on the failed link and the network topology. However, for ease of modeling, we assume any transient period as unavailable time.…”

Section: ) Availability Under Firmentioning

confidence: 99%

“…We propose [8], [9] a novel failure insensitive routing (FIR) approach for ensuring high service availability and reliability without changing the conventional destination-based forwarding paradigm. The proposed approach provides failure resiliency by exploiting the existence of a forwarding table per linecard of each interface for lookup efficiency in current routers.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast Local Rerouting for Handling Transient Link Failures

Nelakuditi

Lee

et al. 2007

IEEE/ACM Trans. Networking

Self Cite

149

101

View full text Add to dashboard Cite

Abstract-Link failures are part of the day-to-day operation of a network due to many causes such as maintenance, faulty interfaces, and accidental fiber cuts. Commonly deployed link state routing protocols such as OSPF react to link failures through global link state advertisements and routing table recomputations causing significant forwarding discontinuity after a failure. Careful tuning of various parameters to accelerate routing convergence may cause instability when the majority of failures are transient. To enhance failure resiliency without jeopardizing routing stability, we propose a local rerouting based approach called failure insensitive routing. The proposed approach prepares for failures using interface-specific forwarding, and upon a failure, suppresses the link state advertisement and instead triggers local rerouting using a backwarding table. With this approach, when no more than one link failure notification is suppressed, a packet is guaranteed to be forwarded along a loop-free path to its destination if such a path exists. This paper demonstrates the feasibility, reliability, and stability of our approach.

show abstract

Section: B Network Availabilitymentioning

confidence: 99%

Section: ) Availability Under Firmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast Local Rerouting for Handling Transient Link Failures

Nelakuditi

Lee

et al. 2007

IEEE/ACM Trans. Networking

Self Cite

149

101

View full text Add to dashboard Cite

show abstract

“…IP Fast Reroute keeps additional routing information in the routers, thus allowing packet forwarding to continue on alternative lin ks immediately after the detection of a failure [1][2][3][4][5], [10][11], [14][15][16][17][18][19][20][21]. IP Fast Reroute routers therefore have mult iple forwarding information bases (FIBs) based on the original topology and backup topologies.…”

Section: Overview Of Fast Reroute Using Backup Topolog Ymentioning

confidence: 99%

“…IP Fast Reroute techniques have been studied for fast failure recovery achieving traffic in just a few milliseconds [1][2][3][4][5], [10][11], [14][15][16][17][18][19][20][21]. For scalability, a backup topology design method for reducing the number of backup topologies is necessary for reducing the router memo ry load [3][4].…”

Section: Related Workmentioning

confidence: 99%

A New Backup Topology Design Method for Congestion Avoidance in IP Fast Reroute

Tembo

Yukimatsu²,

Takahashi³

et al. 2012

IJNC

View full text Add to dashboard Cite

We present a backup topology design method to avoid congestion in IP Fast Reroute. IP Fast Reroute techniques prepare backup topologies used to determine backup routes after a network failure. However, using more backup topologies consumes a lot of network resources. Reducing the nu mber o f backup topologies is a problem, as some lin ks becomes overloaded. In this paper, we present a backup topology design method that splits the traffic on high load links to other links by considering network conditions, such as the traffic matrix or topology. The main idea of our method is the introduction of a concept called a Special Node, which is a node with a h igher node degree, in the backup topology. We quantitatively illustrate the effectiveness of our method in terms of maximu m lin k load reduction. The results show that, with the same nu mber of backup topologies as the conventional method, our method can reduce congestion by 75%. It is effective for various topology models and not dependent to the network size. In this paper, we demonstrate that by selecting about 20% of the nodes as Special Nodes is very effect ive, part icularly in large networks selecting Special Nodes whilst considering node position gives maximu m effect. In this paper, we present that using our approach of selecting Special Nodes in the backup topology and then maximize the number of available links to the Special Nodes we can avoid congestion in IP Fast Reroute.

show abstract