Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Iannaccone, G., Chuah, C.N., Mortier, R., Bhattacharyya, S., Diot, C.: Analysis of link failures in an IP backbone. In: 2nd ACM SIGCOMM Workshop on Internet Measurement, pp. 237–242 (2002)
Labovitz, C., Ahuja, A., Bose, A., Jahanian, F.: Delayed Internet routing convergence. IEEE/ACM Transactions on Networking 9, 293–306 (2001)
Medard, M., Finn, S.G., Barry, R.A.: Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking 7, 641–652 (1999)
Grover, W.D., Stamatelakis, D.: Self-organizing closed path configuration of restoration capacity in broadband mesh transport networks. In: Proc. CCBR 1998 (1998)
Armitage, G.L.: Revisiting IP QoS: Why do we care, what have we learned?, ACM SIGCOMM 2003 RIPQOS Workshop Report. In: ACM/SIGCOMM Computer Communications Review, vol. 33, pp. 81–88 (2003)
Hansen, A.F., Cicic, T., Gjessing, S., Lysne, O.: Resilient routing layers: A simple and flexible approach for resilience in packet networks. Technical Report 13, Simula Research Laboratory (2004)
Menger, K.: Zur allgemeinen kurventheorie. Fund. Math. 10, 95–115 (1927)
Bremler-Barr, A., Afek, Y., Kaplan, H., Cohen, E., Merritt, M.: Restoration by path concatenation: Fast recovery of MPLS paths. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 43–52 (2001)
Lau, W., Jha, S.: Failure-oriented path restoration algorithm for survivable networks. eTransactions on Network and Systems Management 1 (2004)
Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)
Torrieri, D.: Algorithms for finding an optimal set of short disjoint paths in a communication network. IEEE Transactions on Communications 40, 1698–1702 (1992)
Grover, W., Doucette, J., Clouqueur, M., Leung, D., Stamatelakis, D.: New options and insights for survivable transport networks. IEEE Communications Magazine 40, 34–41 (2002)
Sack, A., Grover, W.D.: Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks. IEEE Networks 18, 49–56 (2004)
Schupke, D.A., Grover, W., Clouqueur, M.: Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks. In: Proc. ICC., vol. 3, pp. 1628–1633 (2004)
Schupke, D.A.: Multiple failure survivability in WDM networks with p-cycles. In: IEEE ISCAS, vol. 3, pp. 866–869 (2003)
Stamatelakis, D., Grover, W.D.: IP layer restoration and network planning based on virtual protection cycles. IEEE Journal on selected areas in communications 18 (2000)
Shah-Heydari, S., Yang, O.: Hierarchical protection tree scheme for failure recovery in mesh networks. Photonic Network Communications (Kluwer) 7, 145–159 (2004)
Finn, S.G., Medard, M., Barry, R.A.: A novel approach to automatic protection switching using trees. In: Proc. ICC, vol. 1, pp. 272–276 (1997)
Bartos, R., Raman, M.: A heuristic approach to service restoration in MPLS networks. In: Proc. ICC, pp. 117–121 (2001)
Xue, G., Chen, L., Thulasiraman, K.: QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs. In: Proc. ICC, vol. 5, pp. 2766–2770 (2002)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An approach to universal topology generation. IEEE MASCOTS, 346–353 (2001)
Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6, 1617–1622 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Čičić, T., Hansen, A.F., Gjessing, S., Lysne, O. (2005). Applicability of Resilient Routing Layers for k-Fault Network Recovery. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)