Three disjoint path paradigms in star networks

Star networks have been recently proposed as an attractive choice for interconnection networks. They have sublogarithmic node degree and diameter and, like hypercubes, have a highly recursive structure. Several researchers have endeavored to prove that star networks are as versatile as hypercubes. The paper is an effort in the same direction. It presents optimal algorithms for computing disjoint paths in star graphs for two well known paradigms. It also studies the problem of disjoint connecting paths and presents an efficient algorithm for finding a limited number of such paths in the star network.<<ETX>>

[1]  Ivan Hal Sudborough,et al.  Deterministic Message Routing in Faulty Hypercubes , 1990, WG.

[2]  Mark E. Watkins.  On the existence of certain disjoint arcs in graphs , 1968 .

[3]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

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

[5]  Ivan Hal Sudborough,et al.  A topological property of hypercubes: node disjoint paths , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[6]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[7]  Bin Cong.  Optimum simulations among parallel computer networks , 1991 .

[8]  Frank Thomson Leighton,et al.  Fast computation using faulty hypercubes , 1989, STOC '89.

[9]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[10]  Sartaj Sahni,et al.  Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[11]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[12]  Y. Shiloach.  The two paths problem is polynomial , 1978 .

[13]  Fred S. Annexstein,et al.  A unified approach to off-line permutation routing on parallel networks , 1990, SPAA '90.

[14]  S. Lakshmivarahan,et al.  Embedding of cycles and Grids in Star Graphs , 1991, J. Circuits Syst. Comput..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .