A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Detection and analysis of routing loops in packet traces
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Fast local rerouting for handling transient link failures
IEEE/ACM Transactions on Networking (TON)
Avoiding transient loops through interface-specific forwarding
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Graceful network state migrations
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Under link-state routing protocols such as OSPF and IS-IS, when there is a change in the topology, propagation of link-state advertisements, path recomputation, and updating of forwarding tables (FIBs) will all incur some delay before traffic forwarding can resume on alternate paths. During this convergence period, routers may have inconsistent views of the network, resulting in transient forwarding loops. Previous remedies proposed to address this issue enforce a certain order among the nodes in which they update their FIBs. While such approaches succeed in avoiding transient loops, they incur additional message overhead and/or increased convergence delay. We explore an alternative approach, loopless interface-specific forwarding (LISF), that mitigates transient loops by forwarding a packet based on both its incoming interface and destination address. LISF needs to compute and update interface-specific instead of interface-independent forwarding tables. But it requires neither the synchronization of FIB updates at different nodes nor the modification of the existing link-state routing mechanisms. LISF is easily deployable with current routers if they already maintain a FIB at each interface for lookup efficiency. This paper presents the LISF approach, illustrates its strengths and limitations, discusses four alternative implementations of it and evaluates their performance.