Cayley graph connected cycles: A new class of fixed-degree interconnection networks

Abstract

We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles, which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertex-symmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in general, and improve them for special types of Cayley graph connected cycles having abelian generator-sets. Furthermore, the average distance in these networks is analyzed.<>