João Barreto
Paulo Ferreira
ABSTRACT
Epidemic quorum systems enable highly available agreement even when a quorum is not simultaneously connected, and are therefore very interesting for mobile networks. Although recent work has proposed epidemic quorum algorithms, their properties and trade-offs are not well studied. This paper sheds some light on less known aspects of epidemic quorum systems. With simple counter-examples and combinatorial exercises, we contradict common misbeliefs that are often associated with epidemic quorum systems. Our claims advocate the need for a deeper study of these promising systems.
- Y. Amir and A. Wool. Evaluating quorum systems over the internet. In Symposium on Fault-Tolerant Computing, pages 26--35, 1996. Google Scholar
Digital Library
- J. Barreto and P. Ferreira. The availability and performance of epidemic quorum algorithms. Technical Report 10/2007, INESC-ID, February 2007.Google Scholar
- I.-R. Chen and D.-C. Wang. Analyzing dynamic voting using petri nets. In SRDS '96: Proceedings of the 15th Symposium on Reliable Distributed Systems (SRDS '96), page 44, Washington, DC, USA, 1996. IEEE Computer Society. Google ScholarDigital Library
- D. K. Gifford. Weighted voting for replicated data. In Proceedings of the Seventh Symposium on Operating System Principles SOSP 7, pages 150--162, Asilomar Conference Grounds, Pacific Grove CA, 1979. Google ScholarDigital Library
- J. Holliday, R. Steinke, D. Agrawal, and A. E. Abbadi. Epidemic algorithms for replicated databases. IEEE Transactions on Knowledge and Data Engineering, 15(5):1218--1238, 2003. Google ScholarDigital Library
- K. Ingols and I. Keidar. Availability study of dynamic voting algorithms. In ICDCS '01: Proceedings of the The 21st International Conference on Distributed Computing Systems, page 247, Washington, DC, USA, 2001. IEEE Computer Society. Google ScholarDigital Library
- S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. Database Syst., 15(2):230--280, 1990. Google ScholarDigital Library
- F. P. Junqueira and K. Marzullo. Coterie availability in sites. In P. Fraigniaud, editor, 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 3--17. Springer, 2005. Google ScholarDigital Library
- P. Keleher. Decentralized replicated-object protocols. In Proc. of the 18th Annual ACM Symp. on Principles of Distributed Computing (PODC'99), 1999. Google ScholarDigital Library
- E. Levy and A. Silberschatz. Distributed file systems: Concepts and examples. ACM Computing Surveys, 22(4):321--374, Dec. 1990. Google ScholarDigital Library
- D. Peleg and A. Wool. The availability of quorum systems. Information and Computation, 123(2):210--223, 1995. Google ScholarDigital Library
Index Terms
- The obscure nature of epidemic quorum systems
Recommendations
Signed quorum systems
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingWith n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum systems. However, even this optimal construction requires (n+1)/2 functioning servers ...
Quorum-based synchronization protocols for multimedia replicas
Multiple replicas of multimedia objects are distributed to peers in overlay networks. In quorum-based (QB) protocols, every replica may not be up-to-date and the up-to-date replica can be found in the version counter. Multimedia objects are ...
Dual-Quorum: A Highly Available and Consistent Replication System for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet services via distributed edge servers that operate on a shared collection of ...
Comments