A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Detection and analysis of routing loops in packet traces
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Optical Network Control: Architecture, Protocols, and Standards
Optical Network Control: Architecture, Protocols, and Standards
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Avoiding transient loops through interface-specific forwarding
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Managing routing disruptions in Internet service provider networks
IEEE Communications Magazine
NetScope: traffic engineering for IP networks
IEEE Network: The Magazine of Global Internetworking
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
Positioning of the RPR standard in contemporary operator environments
IEEE Network: The Magazine of Global Internetworking
Message-efficient dissemination for loop-free centralized routing
ACM SIGCOMM Computer Communication Review
SafeGuard: safe forwarding during route changes
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Loop-free link stability metrics for proactive routing in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Loop-free forwarding table updates with minimal link overflow
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Seamless network-wide IGP migrations
Proceedings of the ACM SIGCOMM 2011 conference
Abstractions for network update
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Abstractions for network update
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Lossless migrations of link-state IGPs
IEEE/ACM Transactions on Networking (TON)
Time-based updates in software defined networks
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when the routers adapt their forwarding tables as a response to a topological change. In this paper, we present a mechanism that lets the network converge to its optimal forwarding state without risking any transient loops and the related packet loss. The mechanism is based on an ordering of the updates of the forwarding tables of the routers. Our solution can be used in the case of a planned change in the state of a set of links and in the case of unpredictable changes when combined with a local protection scheme. The supported topology changes are link transitions from up to down, down to up, and updates of link metrics. Finally, we show by simulations that sub-second loop-free convergence is possible on a large Tier-1 ISP network.