Probabilistic Multicast: Generalizing the Multicast Paradigm to Improve Scalability
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 0_92-0_99
- https://doi.org/10.1109/cmpcmm.1993.659081
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Probabilistic Multicast: Generalizing the Multicast Paradigm to Improve ScalabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Dynamic voting algorithms for maintaining the consistency of a replicated databaseACM Transactions on Database Systems, 1990
- Finite buffers for fast multicastACM SIGMETRICS Performance Evaluation Review, 1989
- Performance characterization of quorum-consensus algorithms for replicated dataIEEE Transactions on Software Engineering, 1989
- Optimizing vote and quorum assignments for reading and writing replicated dataIEEE Transactions on Knowledge and Data Engineering, 1989
- Distributed match-makingAlgorithmica, 1988
- Mutual exclusion in partitioned distributed systemsDistributed Computing, 1986
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- The implementation of reliable distributed multiprocess systemsComputer Networks (1976), 1978