Average distance and routing algorithms in the star-connected cycles interconnection network

The star-connected cycles (SCC) graph was recently proposed as an attractive interconnection network for parallel processing, using a star graph to connect cycles of nodes. The paper presents an analytical solution for the problem of the average distance of the SCC graph. They divide the cost of a route in the SCC graph into three components, and show that one of such components is affected by the routing algorithm being used. Three routing algorithms for the SCC graph are presented, which respectively employ random, greedy and minimal routing rules. The computational complexities of the algorithms, and the average costs of the paths they produce, are compared. Finally, they discuss how the algorithms presented in the paper can be used in association with wormhole routing.