So What?
[Doar and Leslie] Dynamic multicasting algorithms. Efficiency reduced when used random graphs versus hierarchical graphs.
[Wei and Estrin] Traffic concentration in Core-Based multicast trees. Differences found when average node degree was 3.0 versus average node degree was 8.
[Mitzel and Shenker] Multicast Resource Reservation. Compared quite differently for linear, tree and star topologies.
Topology generation does matter.