On the scalability of many-to-many reliable multicast sessions

Even though tree‐based reliable multicast protocols are known to be most scalable for one‐to‐many sessions, there is still an open question as to whether these protocols are also scalable for many‐to‐many sessions. In this paper, we analyze and compare two promising multicast protocols—the receiver‐...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Concurrency and computation 2004-11, Vol.16 (13), p.1353-1363
Hauptverfasser: Yoon, W. Y., Lee, D., Youn, H. Y.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Even though tree‐based reliable multicast protocols are known to be most scalable for one‐to‐many sessions, there is still an open question as to whether these protocols are also scalable for many‐to‐many sessions. In this paper, we analyze and compare two promising multicast protocols—the receiver‐initiated protocol with NACK suppression and the tree‐based protocol—using a new spatial loss model. The proposed model considers the correlation of packet loss events for more realistic analysis unlike the previous work. The analysis results show that the tree‐based protocol achieves much higher throughput than the receiver‐initiated protocol for a many‐to‐many session as the number of participants in the session becomes larger. Copyright © 2004 John Wiley & Sons, Ltd.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.759