RVCCC: A new variational network of cube-connected cycles and its topological properties

Abstract The CCC( r , n ) network is an extension of the hypercube which replaces each vertex with a cycle of length n, providing that the hypercube is r-dimensional. When n > r , the CCC( r , n ) network contains more vertices than that of CCC( r , r ), which makes it more useful in the construction of a large-scale interconnection network. However, the CCC( r , n ) is irregular when n > r , which makes their properties difficult to be analyzed. In this paper, we propose a new variational network of the cube-connected cycles (RVCCC). The RVCCC networks have the properties of regularity, vertex-symmetry, and low diameter. Compared with the general CCC networks, the RVCCC networks are more suitable for constructing a large-scale interconnection network. After the shortest internode distance between any two vertices in the RVCCC was determined, the exact diameter of this network was calculated and the communication algorithms, including the routing algorithm and the broadcasting algorithm, were also developed.

[1]  Pinaki Mazumder.  Evaluation of On-Chip Static Interconnection Networks , 1987, IEEE Transactions on Computers.

[2]  Zhen Zhang,et al.  A new family of Cayley graph interconnection networks based on wreath product and its topological properties , 2011, Cluster Computing.

[3]  Iain A. Stewart.  Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori , 2014, IEEE Transactions on Computers.

[4]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[5]  Yan-Quan Feng,et al.  Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model , 2016, Inf. Sci..

[6]  Yuanyuan Yang,et al.  GBC3: A Versatile Cube-Based Server-Centric Network for Data Centers , 2016, IEEE Transactions on Parallel and Distributed Systems.

[7]  Shuqiang Huang,et al.  ExCCC-DCN: A Highly Scalable, Cost-Effective and Energy-Efficient Data Center Structure , 2017, IEEE Transactions on Parallel and Distributed Systems.

[8]  Keqin Li.  Performance evaluation of probabilistic tree embedding in cube-connected cycles , 1998, SAC '98.

[9]  Gene Eu Jan,et al.  A Fault-Tolerant Optimal Message Routing Methodology for Cube-Connected-Cycles Parallel Computers , 2013 .

[10]  Abdullah Al-Dhelaan,et al.  Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes , 2014, IEEE Transactions on Computers.

[11]  Shahram Latifi,et al.  Sep: A Fixed Degree Regular Network for Massively Parallel Systems , 2004, The Journal of Supercomputing.

[12]  Jianping Song,et al.  An optimal multicast algorithm for cube-connected cycles , 2008, Journal of Computer Science and Technology.

[13]  S. Lennart Johnsson,et al.  The Communication Efficiency fo Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integraton , 1987, ICPP.

[14]  Nian-Feng Tzeng.  A Cube-Connected Cycles Architecture with High Reliability and Improved Performance , 1993, IEEE Trans. Computers.

[15]  Lih-Hsing Hsu,et al.  Cycles in cube-connected cycles graphs , 2014, Discret. Appl. Math..

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

[17]  P. S. Nagendra Rao,et al.  Properties and performance of folded cube-connected cycles , 1998, J. Syst. Archit..

[18]  C. Y. Roger Chen,et al.  Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles , 1993, IEEE Trans. Parallel Distributed Syst..

[19]  Yuanyuan Yang,et al.  ABCCC: An Advanced Cube Based Network for Data Centers , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[20]  Sun-Yuan Hsieh,et al.  The k-degree Cayley graph and its topological properties , 2006 .

[21]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[22]  Magdy A. Bayoumi,et al.  The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[23]  Lih-Hsing Hsu,et al.  Topological Properties of Twisted Cube , 1999, Inf. Sci..

[24]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[25]  Ada Wai-Chee Fu,et al.  Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees , 1998, IEEE Trans. Parallel Distributed Syst..

[26]  Pinaki Mazumder.  Evaluation of Three Interconnection Networks for CMOS VLSI Implementation , 1986, ICPP.

[27]  Jehoshua Bruck,et al.  On the Construction of Fault-Tolerant Cube-Connected Cycles Networks , 1991, J. Parallel Distributed Comput..

[28]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[29]  Jimmy J. M. Tan,et al.  Fault-Tolerant Hamiltonicity of Twisted Cubes , 2002, J. Parallel Distributed Comput..

[30]  Gene Eu Jan,et al.  Concentration, load balancing, partial permutation routing, and superconcentration on cube-connected cycles parallel computers , 2005, J. Parallel Distributed Comput..

[31]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[33]  Pradip K. Srimani,et al.  A New Family of Cayley Graph Interconnection Networks of Constant Degree Four , 1996, IEEE Trans. Parallel Distributed Syst..

[34]  Heping Zhang,et al.  Matchings extend to Hamiltonian cycles in k-ary n-cubes , 2015, Inf. Sci..

[35]  Ivan Fris,et al.  The Diameter of the Cube-Connected Cycles , 1997, Inf. Process. Lett..

[36]  Jywe-Fei Fang,et al.  Novel broadcasting schemes on cube-connected cycles , 2005, PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005..

[37]  Andrzej Szepietowski,et al.  Hamiltonian paths in hypercubes with local traps , 2017, Inf. Sci..

[38]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[39]  Shuming Zhou,et al.  A new family of interconnection networks of odd fixed degrees , 2006, J. Parallel Distributed Comput..

[40]  Shuming Zhou,et al.  Trustworthiness-hypercube-based reliable communication in mobile social networks , 2016, Inf. Sci..

[41]  Jehoshua Bruck,et al.  Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes , 1994, IEEE Trans. Computers.