A new family of Cayley graph interconnection networks based on wreath product and its topological properties

Abstract

This paper introduces a new type of Cayley graphs for building large-scale interconnection networks, namely WG 2m n , whose vertex degree is m + 3 when n ≥ 3 and is m + 2 when n = 2. A routing algorithm for the proposed graph is also presented, and the upper bound of the diameter is deduced as 5n/2 . Moreover, the embedding properties and maximal fault tolerance are also analyzed. Finally, we compare the proposed networks with some other similar network topologies. It is found that WG 2m n is superior to other interconnection networks because it helps to construct large-scale networks with lower cost.