Comparative study of product networks

The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study between several networks including hyper-cubes, meshes, star graphs, deBruijn networks, product-shuffle networks, hyper-Petersen networks, mesh-connected-trees, hyper-deBruijn networks, dBCubes, star-cube networks, and hyperstar networks. The comparison is based on network scalability, broadcasting cost, embedding of other topologies, VLSI layout, cost/performance ratio, and other static parameters such as degree, diameter, and number of links.