Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net

Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A {\bm{${k}$}}-level dual-construction for {\bm{${k>0}$}} creates a network containing {\bm{${(2n_0)^{2^k}/2}$}} nodes with node-degree {\bm{${d_0+k}$}}, where {\bm{${n_0}$}} and {\bm{${d_0}$}} are the number of nodes and the node-degree of the base network, respectively. The RDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Node-to-set disjoint-paths routing is fundamental and has many applications for fault-tolerant and secure communication in a network. In this paper, we propose an efficient algorithm for node-to-set disjoint-paths routing on RDN.

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

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

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

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

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

[6]  Kyung-Yong Chwa,et al.  Recursive circulants and their embeddings among hypercubes , 2000, Theor. Comput. Sci..

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

[8]  Shietung Peng,et al.  Metacube: a new interconnection network for large scale parallel systems , 2002 .

[9]  Shietung Peng,et al.  Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[10]  Keiichi Kaneko,et al.  Node-to-Set Disjoint Paths Routing in Metacube , 2010 .

[11]  Shietung Peng,et al.  Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net , 2009, PDCAT.

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

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

[14]  Peter H. Beckman.  Looking toward Exascale Computing , 2008, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[15]  Keiichi Kaneko,et al.  Node-to-Set Disjoint-path Routing in Metacube , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

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

[17]  Shietung Peng,et al.  Recursive dual‐net: A new versatile network for supercomputers of the next generation , 2009 .

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

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

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

[21]  Philip Heidelberger,et al.  Blue Gene/L torus interconnection network , 2005, IBM J. Res. Dev..