Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
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.