Abstract
This paper explores in detail design aspects of Cube-Connected Cubes (CCC). A CCC is hypercube with each node represented as a cube. We consider four CCC network structures using different criteria for global connections. A comparison is made of their network connectivity and average node distance. We also propose a generalized routing algorithm and a generalized broadcasting algorithm that can be applied to different CCC structures. The results of the network topology study show the CCC still keeps desirable hypercube properties such as the existence of parallel node-disjoint paths. Moreover, the CCC has a lower node degree than the hypercube.
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.
