Skip Navigation

The Computer Journal 2001 44(5):354-367; doi:10.1093/comjnl/44.5.354
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wang, S.-Y.
Right arrow Articles by Sheu, J.-P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2-D Torus/Mesh

San-Yuan Wang1, Yu-Chee Tseng2, Ching-Sung Shiu3 and Jang-Ping Sheu3

1 Department of Information Engineering, I-Shou University, Kaohsiung, 840, Taiwan Email: sywang@isu.edu.tw 2 Department of Computer Science and Information Engineering, National Chiao-Tung University, Hsin-Chu, 300, Taiwan 3 Department of Computer Science and Information Engineering, National Central University, Chung-Li, 320, Taiwan

This paper considers the multi-node multicast problem in a wormhole-routed 2-D torus/mesh, where an arbitrary number of source nodes each intends to multicast a message to an arbitrary set of destinations. To resolve the contention and the congestion problems, we propose to partition the network into subnetworks to distribute, and thus balance, the traffic load among all network links. Several ways to partition the network are explored. The network-partitioning idea was used in earlier works for single-node broadcast and single-node multicast. This paper contributes in extending its applicability to multi-node multicast and demonstrating its capability to balance load on torus/mesh. Simulation results show significant improvement over existing results for torus and mesh networks.

Received 10 January, 2000. Revised 8 March, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.