Node-to-Set Disjoint Paths Routing in Dual-Cube

In this paper, we propose an efficient algorithm that finds disjoint paths for node-to-set routing in dual-cube. Dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dn with n links per node, the algorithm finds n disjoint paths, s rarr ti, 1 les i les n, in 0(n2 log n) time and the maximum length of the paths is bounded by 3n + 3.

[1]  Keiichi Kaneko,et al.  An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs , 2007, IEICE Trans. Inf. Syst..

[2]  Shietung Peng,et al.  Set-To-Set Fault Tolerant Routing in Star Graphs , 1996 .

[3]  Yasuto Suzuki,et al.  An Algorithm for Node-Disjoint Paths in Pancake Graphs , 2003 .

[4]  P. F. Corbett,et al.  Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[5]  Shietung Peng,et al.  Node-To-Set Disjoint Paths Problem in Star Graphs , 1997, Inf. Process. Lett..

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

[7]  Keiichi Kaneko.  Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs , 2003, SNPD.

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

[9]  Shietung Peng,et al.  Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes , 1996, Comput. J..

[10]  Yasuto Suzuki,et al.  Node-to-node internally disjoint paths problem in bubble-sort graphs , 2004, 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings..

[11]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[12]  Shietung Peng,et al.  DUAL-CUBES: A NEW INTERCONNECTION NETWORK FOR HIGH-PERFORMANCE COMPUTER CLUSTERS , 2000 .

[13]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[14]  Yasuto Suzuki,et al.  Node-to-set disjoint paths problem in pancake graphs , 2003 .

[15]  Jelena V. Misic,et al.  Fault Tolerance of the Star Graph Interconnection Network , 1994, Inf. Process. Lett..

[16]  Shietung Peng,et al.  Efficient Collective Communications in Dual-Cube , 2004, The Journal of Supercomputing.

[17]  Keiichi Kaneko.  An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs , 2006, IEICE Trans. Inf. Syst..

[18]  Shahram Latifi.  On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..

[19]  Yoshihide Igarashi,et al.  Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs , 1996 .