Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m@?n. For general case, their maximal length is not greater than the minimum of n+1 and the maximal distance (between the source node and destination nodes) plus two. In this paper, we show that their maximal length can be further reduced by at least 1 if one of the two conditions holds. Besides, their total length remains minimum, and each path remains either shortest or second shortest. In the situation that all of the source node and destination nodes are mutually distinct, computer simulation results show that by excluding two trivial worst cases in which the maximal length of (previously) constructed node-disjoint paths (from the source node to the destination nodes) is not only greater than the maximal distance but also impossible to be further reduced, the probability that one of the two conditions holds is greater than 71%, 73%, 79%, and 85% for m=n=4,5,6, and 7, respectively.

[1]  Gen-Huey Chen,et al.  Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs , 1999, IEEE Trans. Parallel Distributed Syst..

[2]  Sun-Yuan Hsieh,et al.  Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes , 2009, IEEE Transactions on Reliability.

[3]  Chun-Hua Chen,et al.  Pancyclicity on Möbius cubes with maximal edge faults , 2004, Parallel Comput..

[4]  Dyi-Rong Duh,et al.  On the Rabin number problem , 1997 .

[5]  Sun-Yuan Hsieh,et al.  Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges , 2006, IEEE Transactions on Computers.

[6]  Shietung Peng,et al.  An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes , 2000, J. Parallel Distributed Comput..

[7]  Gen-Huey Chen,et al.  Strong Rabin numbers of folded hypercubes , 2005, Theor. Comput. Sci..

[8]  Yu-Liang Kuo,et al.  Node-disjoint paths in hierarchical hypercube networks , 2007, Inf. Sci..

[9]  Sun-Yuan Hsieh,et al.  Conditional Edge-Fault Hamiltonicity of Matching Composition Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[10]  Sun-Yuan Hsieh,et al.  Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model , 2010, SIAM J. Discret. Math..

[11]  Ke Qiu,et al.  From Hall's Matching Theorem to Optimal Routing on Hypercubes , 1998, J. Comb. Theory, Ser. B.

[12]  D. Frank Hsu,et al.  Combinatorial Properties of Generalized Hypercube Graphs , 1996, Inf. Process. Lett..

[13]  Shietung Peng,et al.  Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes , 1998, Parallel Comput..

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[15]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[16]  Chi-Chang Chen,et al.  Nearly optimal one-to-many parallel routing in star networks , 1997, Proceedings 11th International Parallel Processing Symposium.

[17]  Teofilo F. Gonzalez,et al.  n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices , 2004, Parallel Comput..

[18]  Ke Qiu,et al.  An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[19]  Cheng-Nan Lai,et al.  Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications , 2012, IEEE Transactions on Parallel and Distributed Systems.

[20]  Gerard J. Chang,et al.  Generalized Diameters and Rabin Numbers of Networks , 1998, J. Comb. Optim..

[21]  Jung-Sheng Fu.  Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..

[22]  Xie-Bin Chen,et al.  Many-to-many disjoint paths in faulty hypercubes , 2009, Inf. Sci..

[23]  Gen-Huey Chen,et al.  w‐Rabin numbers and strong w‐Rabin numbers of folded hypercubes , 2008, Networks.

[24]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[25]  Eddie Cheng,et al.  On Disjoint Shortest Paths Routing on the Hypercube , 2009, COCOA.

[26]  Abdel Elah Al-Ayyoub,et al.  Fault Diameter of k-ary n-cube Networks , 1997, IEEE Trans. Parallel Distributed Syst..

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

[28]  D.Frank Hsu,et al.  On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

[29]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[30]  Shietung Peng,et al.  k-Pairwise Cluster Fault Tolerant Routing in Hypercubes , 1994, IEEE Trans. Computers.

[31]  Sun-Yuan Hsieh,et al.  Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults , 2008, Theory of Computing Systems.

[32]  Shahram Latifi,et al.  Node-to-Set Vertex Disjoint Paths in Hypercube Networks , 1998 .

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

[34]  Ivan Hal Sudborough,et al.  Three disjoint path paradigms in star networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.