Comparison of tree-based reliable multicast protocols for many-to-many sessions

Abstract

Tree-based reliable multicast protocols are well-known for being scalable for one-to-many sessions, but their behaviour in terms of throughput and bandwidth requirements has not been identified for many-to-many sessions. In the paper, existing tree-based reliable multicast protocols are categorised into four classes according to their feed back/retransmission mechanisms. Analysing and comparing them using a new spatial multicast loss model that considers the correlation of packet loss events can yield realistic analysis results. The analysis reveals that for many-to-many sessions, tree-based protocols with unicast NACK, unicast retransmission, and periodic polling are most scalable with respect to throughput and network bandwidth for practical session sizes. The result is contrary to the one-to-many case and it is shown that the reason is that reducing the sender's processing time is a key factor for scaling one-to-many reliable multicast, whereas reducing the receiver's processing time is far more important factor for scalability of many-to-many reliable multicasts.