Independent Spanning Trees on Multidimensional Torus Networks

Two spanning trees rooted at vertex r in a graph G are called independent spanning trees (ISTs) if for each vertex v in G, vner, the paths from vertex v to vertex r in these two trees are internally distinct. If the connectivity of G is k, the IST problem is to construct k ISTs rooted at each vertex. The IST problem has found applications in fault-tolerant broadcasting, but it is still open for general graphs with connectivity greater than four. In this paper, we shall propose a very simple algorithm for solving the IST problem on multidimensional torus networks. In our algorithm, every vertex can determine its parent for a specific independent spanning tree only depending on its own label. Thus, our algorithm can also be implemented in parallel systems or distributed systems very easily.

[1]  Obokata Koji,et al.  Independent Spanning Trees of Product Graphs and Their Construction , 1996 .

[2]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[3]  Bella Bose,et al.  Fault-Tolerant Communication Algorithms in Toroidal Networks , 1999, IEEE Trans. Parallel Distributed Syst..

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

[5]  Selim G. Akl,et al.  Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance , 1996, IEEE Trans. Computers.

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

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

[8]  Sayaka Nagai,et al.  A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs , 2000, WG.

[9]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

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

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

[12]  Pierre Fraigniaud,et al.  Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks , 1991, ICPP.

[13]  Sun-Yuan Hsieh,et al.  Constructing edge-disjoint spanning trees in locally twisted cubes , 2009, Theor. Comput. Sci..

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

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

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

[17]  Luis Gravano,et al.  Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks , 1994, IEEE Trans. Computers.

[18]  Yuh-Shyan Chen,et al.  Congestion-free embedding of 2(n-k) spanning trees in an arrangement graph , 2001, J. Syst. Archit..

[19]  Myung M. Bae,et al.  Resource Placement in Torus-Based Networks , 1997, IEEE Trans. Computers.

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

[21]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

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

[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]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

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

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

[27]  Chin-Tsai Lin.  Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs , 2003, J. Parallel Distributed Comput..

[28]  Andreas Huck.  Independent Trees in Planar Graphs Independent trees , 1999, Graphs Comb..

[29]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

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