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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
