SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
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
On improving the efficiency and manageability of NotVia
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Packet re-cycling: eliminating packet losses due to network failures
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Hi-index | 0.00 |
In this paper, we propose a routing technique to alleviate packet loss due to transient link failures, which are major causes of disruption in the Internet. The proposed technique based on Alternate Next Hop Counters (ANHC) allows routers to calculate backup paths and re-route packets accordingly, thereby bypassing transient failures. This technique guarantees full repair coverage for single link failures, without significantly changing the way traditional routing works and with minimal impact on the computation and memory requirements for routers. We evaluate the performance of our proposed ANHC approach through extensive simulations and show that the stretch of its pre-computed alternate paths, its failure-state link load increase, and its computational and memory overheads are minimal.