Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

We present a new algorithm which creates redundant trees on arbitrary node-redundant or link-redundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned recovery of communications with great flexibility in the topology design. Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network. In the case of failure of a communications link, our algorithm provides a superset of the previously known trees.

[1]  Bo-Chao Cheng,et al.  A restoration methodology based on pre-planned source routing in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[2]  R.S.K. Chng,et al.  A multi-layer restoration strategy for reconfigurable networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[3]  A. Bellary,et al.  Intelligent transport network survivability: study of distributed and centralized control techniques using DCS and ADMs , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[4]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[5]  R. Doverspike.  A multi-layered model for survivability in intra-LATA transport networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[6]  C. E. Chow,et al.  Performance analysis of fast distributed network restoration algorithms , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[7]  Cauligi S. Raghavendra,et al.  Hierarchical multicast routing in ATM networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[8]  M. M. Slominski,et al.  Guided restoration of ATM cross-connect networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[9]  J. Veerasamy,et al.  Effect of traffic splitting on link and path restoration planning , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[10]  Graham Knight,et al.  Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks , 1995, Proceedings of INFOCOM'95.

[11]  H. Towster,et al.  Self-healing ring networks: gateway to public information networking , 1990, IEEE Communications Magazine.

[12]  M. Gerla,et al.  Protection planning in transmission networks , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[13]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Tsong-Ho Wu.  A passive protected self-healing mesh network architecture and applications , 1994, TNET.

[15]  M. Medard,et al.  Automatic protection switching for multicasting in optical mesh networks , 1997, Proceedings of Optical Fiber Communication Conference (.

[16]  Jo-Mei Chang,et al.  Reliable broadcast protocols , 1984, TOCS.

[17]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[18]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[19]  Anujan Varma,et al.  ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm , 1997, IEEE J. Sel. Areas Commun..

[20]  Piet Demeester,et al.  Spare capacity assignment for different restoration strategies in mesh survivable networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[21]  Joseph Sosnosky,et al.  Service applications for SONET DCS distributed restoration , 1994, IEEE J. Sel. Areas Commun..

[22]  Anindo Banerjea,et al.  Recovering guaranteed performance service connections from single and multiple faults , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[23]  Mostafa H. Ammar,et al.  Routing multipoint connections using virtual paths in an ATM network , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[24]  Alexander Gersht,et al.  Dynamic bandwidth-allocation and path-restoration in SONET self-healing networks , 1996, IEEE Trans. Reliab..

[25]  Salman Z. Shaikh.  Span-disjoint paths for physical diversity in networks , 1995, Proceedings IEEE Symposium on Computers and Communications.

[26]  Y. Yamabayashi,et al.  Self-healing algorithm for logical mesh connection on ring networks , 1994 .

[27]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[28]  R. H. Cardwell,et al.  A multi-period design model for survivable network architecture selection for SONET interoffice networks , 1991 .

[29]  J. S. Whalen,et al.  Finding maximal link disjoint paths in a multigraph , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[30]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[31]  S. Ramanathan,et al.  Multicast tree generation in networks with asymmetric links , 1996, TNET.

[32]  Myung J. Lee,et al.  Multicasting over ATM using connection server , 1997, Proceedings of ICC'97 - International Conference on Communications.

[33]  Koso Murakami,et al.  Network Restoration Algorithm for Multimedia Communication Services and Its Performance Characteristics , 1995 .

[34]  Sang-Baeg Kim.  An optimal VP-based multicast routing in ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[35]  Stefan Voß,et al.  Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..

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

[37]  Thomas Frisanco,et al.  Optimal spare capacity design for various protection switching methods in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[38]  Muriel Médard,et al.  A novel approach to automatic protection switching using trees , 1997, Proceedings of ICC'97 - International Conference on Communications.

[39]  N. Tokura,et al.  ATM self-healing ring , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[40]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[41]  Robert E. Tarjan,et al.  A Good Algorithm for Edge-Disjoint Branching , 1974, Inf. Process. Lett..

[42]  Narsingh Deo,et al.  On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..

[43]  Ian M. Leslie,et al.  How Bad is Na'ive Multicast Routing? , 1993 .

[44]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[45]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[46]  Ning David Lin,et al.  ATM virtual path self-healing based an a new path restoration protocol , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[47]  Henry L. Owen,et al.  An algorithm for bandwidth management with survivability constraints in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[48]  Alfred C. Weaver,et al.  MESH: distributed error recovery for multimedia streams in wide-area multicast networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[49]  H. Kobrinski,et al.  Distributed control algorithms for dynamic restoration in DCS mesh networks: performance evaluation , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[50]  Kazutaka Murakami,et al.  Virtual path routing for survivable ATM networks , 1996, TNET.

[51]  O. J. Wasem.  Optimal topologies for survivable fiber optic networks using SONET self-healing rings , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[52]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[53]  Cheng-Shong Wu,et al.  Backup VP preplanning strategies for survivable multicast ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[54]  W. Way,et al.  A novel passive protected SONET bidirectional self-healing ring architecture , 1992 .

[55]  Muriel Médard,et al.  WDM loop-back recovery in mesh networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[56]  Y. Ofek,et al.  Design and performance of convergence routing on multiple spanning trees , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[57]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[58]  C. J. Green.  Protocols for a self-healing network , 1995, Proceedings of MILCOM '95.

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

[60]  J. J. Shi,et al.  Interconnection of self-healing rings , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[61]  Michael S. Borella,et al.  Multicast routing algorithms for the WDM Shufflenet local optical network , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[63]  W. D. Grover,et al.  The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .

[64]  Wayne D. Grover,et al.  An algorithm for survivable network design employing multiple self-healing rings , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[65]  R. H. Cardwell,et al.  High-speed self-healing ring architectures for future interoffice networks , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[66]  W.D. Grover,et al.  Performance studies of a selfhealing network protocol in Telecom Canada long haul networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[67]  Noriaki Yoshikai,et al.  Double search self-healing algorithm and its characteristics , 1994 .

[68]  Biswanath Mukherjee,et al.  The advantages of partitioning multicast transmissions in a single-hop optical WDM network , 1997, Proceedings of ICC'97 - International Conference on Communications.

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

[70]  M.J. O'Mahony,et al.  Distributed restoration strategies in telecommunications networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[71]  M. Stoer.  Design of Survivable Networks , 1993 .

[72]  J. Bicknell,et al.  A fast distributed network restoration algorithm , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[73]  R. Nakamura,et al.  Reliable switching system recovery , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[74]  Ching-Chir Shyur,et al.  Survivable network planning methods and tools in Taiwan , 1995 .

[75]  Yossi Shiloach,et al.  Edge-Disjoint Branching in Directed Multigraphs , 1979, Inf. Process. Lett..