Some heuristics and experiments for building a multicasting tree in a high-speed network

Proposes 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.