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
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
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
Achieving sub-50 milliseconds recovery upon BGP peering link failures
IEEE/ACM Transactions on Networking (TON)
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
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
| Hi-index | 0.00 |
IP fast reroute is a mechanism that is used to reroute packets around a failed link as soon as the link fails. Most of the IP fast reroute mechanisms, that have been proposed so far, focus on single or dual link failures but can not handle Shared Risk Link Group (SRLG) failures when several links fail at the same time because of some common underlying component failure. Furthermore, most of current work is based on the assumption that each node in the network has access to some global topology information of the network. In this paper, we present the first IP fast reroute mechanism for SRLG failures that is not based on the assumption that the nodes in the network have global topology information of the network. In our mechanism, nodes in the network use “relay bits” to identify themselves as “relay nodes” for a reroute link in a fully distributed mannner. Through simulation, we show that our mechanism succeeds in rerouting around SRLG failures alomst 100% of the time, with average length of a reroute path about 1.5 times the re-converged shortest path.