Fault tolerance for hypercube networks via independent spanning trees

Independent spanning trees (ISTs) may be used for message broadcasting in any interconnection networks, which provides preferential performances. It can be used to enhance the fault tolerance, bandwidth, and security. In this way, the designs of ISTs for various types of topologies have been widely analysed. There is a hypothesis on ISTs: any n-connected network has n ISTs rooted at any node. In this paper, we first analysed the algorithm then parallel construct the ISTs in hypercubes. We give an algorithm for ISTs which can be applied to solve any node broadcast problem for hypercubes. Then, simulation results showed that fault tolerance is effective in reliable broadcasting and concedes 11%-23% fault tolerance for successful broadcasting.

[1]  S. N. Maheshwari,et al.  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.

[2]  Yuh-Shyan Chen,et al.  Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy , 2004, J. Syst. Archit..

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

[4]  Yoshihide Igarashi,et al.  Reliable broadcasting and secure distributing in channel networks , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[5]  Yoshihide Igarashi,et al.  Independent Spanning Trees of Chordal Rings , 1999, Inf. Process. Lett..

[6]  S. Louis Hakimi,et al.  Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs , 1997, SIAM J. Comput..

[7]  Cheng-Kuan Lin,et al.  Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order , 2011, 2011 14th IEEE International Conference on Computational Science and Engineering.

[8]  Andreas Huck.  Independent Trees and Branchings in Planar Multigraphs , 1999, Graphs Comb..

[9]  Sung-Won Kim,et al.  Comments on "A Class of Fault-Tolerant Multiprocessor Networks" , 2009, IEEE Trans. Reliab..

[10]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[11]  Jun-Ming Xu,et al.  Fault-tolerant analysis of a class of networks , 2007, Inf. Process. Lett..

[12]  Jou-Ming Chang,et al.  Independent Spanning Trees on Multidimensional Torus Networks , 2010, IEEE Transactions on Computers.

[13]  Jou-Ming Chang,et al.  Parallel construction of optimal independent spanning trees on hypercubes , 2007, Parallel Comput..

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

[15]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[16]  Yoshihide Igarashi,et al.  Reliable broadcasting in product networks , 1998, Discret. Appl. Math..

[17]  Jou-Ming Chang,et al.  On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2 , 2009, Theor. Comput. Sci..

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

[19]  Yu-Chee Tseng,et al.  Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach , 1999, IEEE Trans. Parallel Distributed Syst..

[20]  A. Ghafoor.  A class of fault-tolerant multiprocessor networks , 1989 .

[21]  Jou-Ming Chang,et al.  Broadcasting secure messages via optimal independent spanning trees in folded hypercubes , 2011, Discret. Appl. Math..

[22]  Adele A. Rescigno,et al.  Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security , 2001, Inf. Sci..

[23]  Jou-Ming Chang,et al.  Reducing the Height of Independent Spanning Trees in Chordal Rings , 2007, IEEE Transactions on Parallel and Distributed Systems.

[24]  Yue-Li Wang,et al.  Optimal Independent Spanning Trees on Hypercubes , 2004, J. Inf. Sci. Eng..

[25]  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..

[26]  Hiroshi Nagamochi,et al.  Independent spanning trees with small depths in iterated line digraphs , 2001, Discret. Appl. Math..

[27]  Jou-Ming Chang,et al.  Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2) , 2010, Int. J. Found. Comput. Sci..

[28]  Chang-Hsiung Tsai.  Fault-free cycles passing through prescribed paths in hypercubes with faulty edges , 2009, Appl. Math. Lett..

[29]  Veera Boonjing,et al.  An efficient parallel construction of optimal independent spanning trees on hypercubes , 2012, J. Parallel Distributed Comput..