Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Concurrency and Comp...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Concurrency and Computation Practice and Experience
Article . 2004 . Peer-reviewed
License: Wiley Online Library User Agreement
Data sources: Crossref
https://doi.org/10.1109/ipdps....
Article . 2002 . Peer-reviewed
Data sources: Crossref
DBLP
Conference object
Data sources: DBLP
DBLP
Article . 2004
Data sources: DBLP
versions View all 5 versions
addClaim

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

Authors: Wonyong Yoon; Dongman Lee; Hee Yong Youn;

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

Abstract

AbstractEven 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.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!