Some Heuristics and Experiments for Building a Multicasting Tree in a High-Speed Network

Authors:
Yu-Chee Tseng;Tong-Ying Juang;Ming-Chih Du
Affiliations:
-;-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 9
Cited 0

Multicast tree construction in bus-based networks

Communications of the ACM
Multicast in hypercube multiprocessors

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Unicast-Based Multicast Communication in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Adaptive fault-tolerant multicast in hypercube multicomputers

Journal of Parallel and Distributed Computing
Fault-tolerant multicasting on hypercubes

Journal of Parallel and Distributed Computing
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Multicast Communication in Wormhole-Routed Torus Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The first one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the effectiveness of these strategies, we show how to apply them to hypercubes and star graphs. Experimental results are reported to evaluate the performance of these solutions.