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

被引:3
|
作者
Zhang, Zhen [1 ,2 ]
Huang, Shu-qiang [3 ]
Guo, Dong [2 ]
Li, Yong-Hui [4 ]
机构
[1] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China
[2] Jilin Univ, Minist Educ, Lab Symbol Computat & Knowledge Engn, Changchun 130012, Jilin, Peoples R China
[3] Jinan Univ, Dept Optoelect Engn, Guangzhou 510632, Guangdong, Peoples R China
[4] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 00026A, Australia
基金
中国国家自然科学基金;
关键词
Cube-connected cycles; Shortest internode distance; Diameter; Routing algorithm; Broadcasting algorithm; INTERCONNECTION NETWORKS; N-CUBE; CAYLEY GRAPH; PERFORMANCE; HYPERCUBE; FAMILY; ALGORITHM; DIAMETER;
D O I
10.1016/j.tcs.2018.09.028
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:34 / 50
页数:17
相关论文
共 35 条