Cube-Connected Circulants as Efficient Models for Interconnection Networks

Abstract

We introduce cube-connected circulants as efficient models for communication networks. We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant. We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph. Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants. We show cube-connected circulants outperform a few well-known network structures in several invariants.