Novel broadcasting schemes on cube-connected cycles

Abstract

Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. This problem appears in applications such as matrix operations, database operation and transitive closure algorithms. The topology considered in this paper is the cube-connected cycle that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient computation. In this paper, we present a novel distributed broadcasting scheme for the cube-connected cycles, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message. Moreover, the time steps (i.e., the height of the broadcasting tree) taken by this algorithm is under diameter, which is optimal.