Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
Restoration by path concatenation: fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
Revisiting IP QoS: why do we care, what have we learned? ACM SIGCOMM 2003 RIPQOS workshop report
ACM SIGCOMM Computer Communication Review
Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
Failure-Oriented Path Restoration Algorithm for Survivable Networks
IEEE Transactions on Network and Service Management
New options and insights for survivable transport networks
IEEE Communications Magazine
IP layer restoration and network planning based on virtual protection cycles
IEEE Journal on Selected Areas in Communications
Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks
IEEE Network: The Magazine of Global Internetworking
Resilient routing layers for network disaster planning
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
A protocol for fast recovery on mesh networks using a multi-topology approach
Proceedings of the 6th Euro American Conference on Telematics and Information Systems
| Hi-index | 0.00 |
Most networks experience several failures every day, and often multiple failures occur simultaneously. Still, most recovery mechanisms are not designed to handle multiple failures. We recently proposed a versatile recovery method called Resilient Routing Layers, and in this paper we analyze its suitability for handling multiple failures of network components. We propose a simple probabilistic algorithm for RRL layer creation, and evaluate its performance by comparing it with the Redundant Trees recovery mechanism. We show that not only does RRL provide better fault tolerance, but it also has qualitative advantages that make it very interesting in network systems design.