Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Disjoint multipath routing using colored trees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving service differentiation in IP networks through dual topology routing
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Maintaining colored trees for disjoint multipath routing under node failures
IEEE/ACM Transactions on Networking (TON)
New solutions for disjoint paths in P systems
Natural Computing: an international journal
Hi-index | 0.00 |
Applications such as Voice over IP and video streaming require continuous network service, requiring fast failure recovery mechanisms. Proactive failure recovery schemes have been recently proposed to improve network performance during the failure transients. These proactive failure recovery schemes need extra infrastructural support in the form of routing table entries, extra addresses etc. In this paper, we study if the extra infrastructure support can be exploited to build disjoint paths in those frameworks, while keeping the lengths of the recovery paths close to those of the primary paths. Our evaluations show that it is possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which can be employed in multipath routing for load balancing and QoS.