Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model

  • Authors:
  • Nen-Chung Wang;Cheng-Pang Yen;Chih-Ping Chu

  • Affiliations:
  • Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.