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
Fast local rerouting for handling transient 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
Optimizing post-failure network performance for IP Fast ReRoute using tunnels
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Multiple routing configurations for fast IP network recovery
IEEE/ACM Transactions on Networking (TON)
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
On the feasibility and efficacy of protection routing in IP networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fast recovery from dual-link or single-node failures in IP networks using tunneling
IEEE/ACM Transactions on Networking (TON)
IP resilience within an autonomous system: current approaches, challenges, and future directions
IEEE Communications Magazine
| Hi-index | 0.00 |
IP Fast ReRoute (IPFRR) has received increasing attention as a means to effectively shorten traffic disruption under failures. A major approach to implementing IPFRR is to pre-calculate backup paths for nodes and links. However, it may not be easy to deploy such an approach in practice due to the tremendous computational overhead. Thus, a light-weight IPFRR scheme is desired to effectively provide cost-efficient routing protection. In this paper, we propose a Fast Tunnel Selection (FTS) approach to achieve tunnel-based IPFRR. FTS approach can find an effective tunnel endpoint before complete computation of entire SPT and thus effectively reduce computation overhead. Specially, we propose two FTS algorithms to provide protection for networks with symmetric and asymmetric link weights. We simulate FTS with topologies of different sizes. The results show that FTS approach reduces more than 89% computation overhead compared to the existing approaches, and achieves more than 99% average link protection rate and more than 90% average node protection rate. Moreover, FTS approach achieves less than 15% path stretch, which is better than the existing approaches.