Premium
On the scalability of many‐to‐many reliable multicast sessions
Author(s) -
Yoon W. Y.,
Lee D.,
Youn H. Y.
Publication year - 2004
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.759
Subject(s) - multicast , computer science , reliable multicast , protocol independent multicast , computer network , scalability , session (web analytics) , pragmatic general multicast , protocol (science) , ip multicast , distance vector multicast routing protocol , tree (set theory) , network packet , source specific multicast , distributed computing , throughput , xcast , wireless , medicine , world wide web , telecommunications , mathematical analysis , alternative medicine , mathematics , pathology , database
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.