The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Bimodal multicast
Open accessAbstract
There are many methods for making a multicast protocol “reliable.” At one end of the spectrum, a reliable multicast protocol might offer tomicity guarantees, such as all-or-nothing delivery, delivery ordering, and perhaps additional properties such as virtually synchronous addressing. At the other are protocols that use local repair to overcome transient packet loss in the network, offering “best effort” reliability. Yet none of this prior work has treated stability of multicast delivery as a basic reliability property, such as might be needed in an internet radio, television, or conferencing application. This article looks at reliability with a new goal: development of a multicast protocol which is reliable in a sense that can be rigorously quantified and includes throughput stability guarantees. We characterize this new protocol as a “bimodal multicast” in reference to its reliability model, which corresponds to a family of bimodal probability distributions. Here, we introduce the protocol, provide a theoretical analysis of its behavior, review experimental results, and discuss some candidate applications. These confirm that bimodal multicast is reliable, scalable, and that the protocol provides remarkably stable delivery throughput.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
The Mathematical Theory of Infectious Diseases
Kingman, J. F. C., & Bailey, N. T. J. (1977) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403009 · Cited by 864
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., McCanne, S., Liu, C.-G., & Zhang, L. (1995) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/217382.217470 · Cited by 705
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
A Gossip-Style Failure Detection Service
van Renesse, R., Minsky, Y., & Hayden, M. (1998) · Middleware’98 · doi:10.1007/978-1-4471-1283-9_4 · Cited by 496
Self-citationProviding high availability using lazy replication
Ladin, R., Liskov, B. H., Shrira, L., & Ghemawat, S. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138877 · Cited by 383
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
Cristian, F., Aghili, H., Strong, R., & Volev, D. (2005) · Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. · doi:10.1109/ftcsh.1995.532668 · Cited by 353
Building secure and reliable network applications
Birman, K. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63343-x_35 · Cited by 332
Self-citationRandomized broadcast in networks
Feige, U., Peleg, D., Raghavan, P., & Upfal, E. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010406 · Cited by 239
Understanding the limitations of causally and totally ordered communication
Cheriton, D. R., & Skeen, D. (1993) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/168619.168623 · Cited by 204
A review of experiences with reliable multicast
Birman, K. (1999) · Software Practice and Experience · Cited by 72
Self-citation
Cited by
The many faces of publish/subscribe
Eugster, P. T., Felber, P. A., Guerraoui, R., & Kermarrec, A.-M. (2003) · ACM Computing Surveys · doi:10.1145/857076.857078 · Cited by 3,145
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461
Haas, Z. J., Halpern, J. Y., & Li, L. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019424 · Cited by 748
Metadata
- Authors
- Birman, K. P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., & Minsky, Y.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1999-05
- Volume
- 17
- Issue
- 2
- Pages
- 41-88
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2296427920
- Cited by
- 654
- References
- 12
- FWCI
- 40.48
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.