Multicasting on Wormhole-Routed Symmetric Networks with Hamiltonian Cycle Model

Abstract

In this paper, we first introduce a new hamiltonian cycle model for exploiting the features of symmetric networks. Based on this model, we propose two efficient multicast routing algorithms, uniform multicast routing algorithm and fixed multicast routing algorithm, in symmetric networks with wormhole routing. The proposed multicast routing algorithms utilizes channels uniformly to reduce the path length of message worms, making the multicasting more efficient in symmetric networks. We present two symmetric networks, the torus and star graph, to illustrate the superiority of the proposed schemes. Simulations are conducted to show that the proposed routing schemes outperform the previous scheme.