Finding multiple maximally redundant trees in linear time

Redundant trees are directed spanning trees, which provide disjoint paths towards their roots. Therefore, this concept is widely applied in the literature both for providing protection and load sharing. The fastest algorithm can find multiple redundant trees, a pair of them rooted at each vertex, in linear time. Unfortunately, edge- or vertex-redundant trees can only be found in 2-edge- or 2-vertex-connected graphs respectively. Therefore, the concept of maximally redundant trees was introduced, which can overcome this problem, and provides maximally disjoint paths towards the common root. In this paper, we propose the first linear time algorithm, which can compute a pair of maximally redundant trees rooted at not only one, but at each vertex.

[1]  Muriel Médard,et al.  Generalized loop-back recovery in optical mesh networks , 2002, TNET.

[2]  Li Chen,et al.  Cost minimization in redundant trees for protection in vertex-redundant or edge-redundant graphs , 2002, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326).

[3]  Marwan Krunz,et al.  Linear time distributed construction of colored trees for disjoint multipath routing , 2007, Comput. Networks.

[4]  Srinivasan Ramasubramanian,et al.  Supporting Multiple Protection Strategies in Optical Networks , 2008, IEEE/ACM Transactions on Networking.

[5]  Ibrahim Matta,et al.  BRITE: Boston University Representative Internet Topology gEnerator: A Flexible Generator of Internet Topologies , 2000 .

[6]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[7]  Andreas Huck.  Independent trees in graphs , 1994, Graphs Comb..

[8]  Jian Tang,et al.  Faster Algorithms for Construction of Recovery Trees Enhancing QoP and QoS , 2008, IEEE/ACM Transactions on Networking.

[9]  Marwan Krunz,et al.  Disjoint multipath routing using colored trees , 2007, Comput. Networks.

[10]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[11]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1984, Inf. Comput..

[12]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[13]  Li Chen,et al.  QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[14]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[15]  Li Chen,et al.  Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[16]  Ronitt Rubinfeld,et al.  Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..

[17]  D. Handke.  Independent Tree Spanners , 1998, WG.

[18]  Xingxing Yu,et al.  Finding Four Independent Trees , 2006, SIAM J. Comput..

[19]  Juraj Hromkovic,et al.  Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science , 1998 .

[20]  Piotr Cholda,et al.  Network Recovery, Protection and Restoration of Optical, SONET-SDH, IP, and MPLS [Book Review] , 2005, IEEE Communications Magazine.

[21]  Fred S. Annexstein,et al.  Independent Spanning Trees with Small Stretch Factors , 1996 .

[22]  Stewart Bryant,et al.  IP Fast Reroute Using Not-via Addresses , 2006 .

[23]  Jian Tang,et al.  Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[24]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[25]  Gábor Rétvári,et al.  IP Fast ReRoute: Lightweight Not-Via , 2009, Networking.

[26]  G. Jayavelu,et al.  Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures , 2009, IEEE/ACM Transactions on Networking.

[27]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..

[28]  Stewart Bryant,et al.  IP Fast Reroute Framework , 2010, RFC.

[29]  Xingxing Yu,et al.  Chain decompositions and independent trees in 4-connected graphs , 2003, SODA '03.

[30]  Gábor Rétvári,et al.  On Finding maximally redundant trees in strictly linear time , 2009, 2009 IEEE Symposium on Computers and Communications.

[31]  Ravi Balasubramanian,et al.  Minimizing Average Path Cost in Colored Trees for Disjoint Multipath Routing , 2006, Proceedings of 15th International Conference on Computer Communications and Networks.

[32]  Preetha Thulasiraman,et al.  WSN18-3: Disjoint Multipath Routing in Dual Homing Networks using Colored Trees , 2006, IEEE Globecom 2006.

[33]  Dieter Kratsch,et al.  Graph-Theoretic Concepts in Computer Science , 1987, Lecture Notes in Computer Science.

[34]  Shin-Ichi Nakano,et al.  A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs , 1999, Int. J. Found. Comput. Sci..

[35]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[36]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.

[37]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[38]  Robert D. Doverspike,et al.  IGP Weight Setting in Multimedia IP Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.