Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Impact of link failures on VoIP performance
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Source selectable path diversity via routing deflections
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Fast local rerouting for handling transient link failures
IEEE/ACM Transactions on Networking (TON)
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Avoiding transient loops during the convergence of link-state routing protocols
IEEE/ACM Transactions on Networking (TON)
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
NetComplex: a complexity metric for networked system designs
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Avoiding transient loops through interface-specific forwarding
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
NetFPGA—An Open Platform for Teaching How to Build Gigabit-Rate Network Switches and Routers
IEEE Transactions on Education
Packet re-cycling: eliminating packet losses due to network failures
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates
Computer Communications
Improving availability in distributed systems with failure informers
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Hi-index | 0.00 |
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. SafeGuard is based on the simple idea that packets carry a destination address plus a local estimate of the remaining path cost. We show that this simple design enables routers to detect path inconsistencies during route changes and resolve on a working path for anticipated failure and restoration scenarios. This in turn means that route changes do not disrupt connectivity although routing tables are inconsistent over the network. We evaluate the router performance of SafeGuard using a prototype based on NetFPGA and Quagga. We show that SafeGuard is amenable to high-speed hardware implementation with low overhead. We evaluate the network performance of SafeGuard via simulation. The results show that SafeGuard converges faster than a state-of-the-art IP fast restoration mechanism and reduces periods of disruption to a minimal duration, i.e., the failure detection time.