One-to-many node-disjoint paths of hyper-star networks

In practice, it is important to construct node-disjoint paths in networks, because they can be used to increase the transmission rate and enhance the transmission reliability. The hyper-star networks HS(2n,n) were introduced to be a competitive model for both the hypercubes and the star graphs. In this paper, one-to-many node-disjoint paths are constructed between a fixed node and n other nodes of HS(2n,n) such that each of these paths has length at most 4 more than the shortest path to that node. Moreover, their maximum length is not greater than the diameter+2.

[1]  Eunseuk Oh,et al.  Topological and Communication Aspects of Hyper-Star Graphs , 2003, ISCIS.

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

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

[4]  Eddie Cheng,et al.  Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars , 2012, Networks.

[5]  Dyi-Rong Duh,et al.  Constructing vertex-disjoint paths in (n, k)-star graphs , 2008, Inf. Sci..

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

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

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

[9]  Eddie Cheng,et al.  Embedding hypercubes, rings, and odd graphs into hyper-stars , 2009, Int. J. Comput. Math..

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

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

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

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

[14]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[15]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[16]  Eunseuk Oh,et al.  Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube , 2002, EurAsia-ICT.

[17]  Hussein T. Mouftah,et al.  Topological properties of WK-recursive networks , 1990, [1990] Proceedings. Second IEEE Workshop on Future Trends of Distributed Computing Systems.

[18]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[20]  Eddie Cheng,et al.  Structural Properties Of Hyper-Stars , 2006, Ars Comb..