Performance analysis for overlay multicast on tree and M-D mesh topologies (II)

Abstract

In our previous work, we have analyzed the worst performance for tree-based and mesh-based multicast along the link stress, the number of overlay hops, and the number of shortest paths. In this paper, we extend our research through studying the average performance and the difference between the worst and the average performance for these metrics. We present a set of theoretical results that evaluate the average performance and the performance difference for tree-based multicast and mesh-based multicast in quantity. And also, we program NICE tree and CAN-based multicast in NS2 to evaluate our theoretical prediction and compare tree-based and mesh-based multicast. Simulation results prove our theoretical analysis. We find that tree-based multicast suits to not only real-time but also interactive streaming media applications, and mesh-based multicast holds the promise for the bottleneck-avoidance and reliable transmission in multi-source non-real-time applications.