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

摘要

Proposes three strategies for building a multicasting tree in ahigh-speed network. These strategies can be used in any networktopology. The first one is based on voting, the second based onconstructing a minimum spanning tree, and the third based on repeatedlyconstructing multiple minimum spanning trees. To demonstrate theeffectiveness of these strategies, we show how to apply them tohypercubes and star graphs. Experimental results are reported toevaluate the performance of these solutions