Benjamin Reed
ABSTRACT
This is a short overview of a totally ordered broadcast protocol used by ZooKeeper, called Zab. It is conceptually easy to understand, is easy to implement, and gives high performance. In this paper we present the requirements ZooKeeper makes on Zab, we show how the protocol is used, and we give an overview of how the protocol works.
- K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. SIGOPS Oper. Syst. Rev., 21(5):123--138, 1987. Google Scholar
Digital Library
- K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(1):47--76, 1987. Google ScholarDigital Library
- X. Défago, A. Schiper, and P. Urbán. Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv., 36(4):372--421, 2004. Google ScholarDigital Library
- D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. R. Stonebraker, and D. Wood. Implementation techniques for main memory database systems. SIGMOD Rec., 14(2):1--8, 1984. Google ScholarDigital Library
- R. Friedman and R. van Renesse. Packing messages as a tool for boosting the performance of total ordering protocols. In HPDC, pages 233--242, 1997. Google ScholarDigital Library
- D. Gawlick and D. Kinkade. Varieties of concurrency control in ims/vs fast path. IEEE Database Eng. Bull., 8(2):3--10, 1985.Google Scholar
- J. Gray. Notes on data base operating systems. In Operating Systems, An Advanced Course, pages 393--481, London, UK, 1978. Springer-Verlag. Google ScholarDigital Library
- R. Guerraoui, R. R. Levy, B. Pochon, and V. Quema. High throughput total order broadcast for cluster environments. In DSN '06: Proceedings of the International Conference on Dependable Systems and Networks, pages 549--557, Washington, DC, USA, 2006. IEEE Computer Society. Google ScholarDigital Library
- http://hadoop.apache.org/zookeeper. Zookeeper project page, 2008.Google Scholar
- I. Keidar and D. Dolev. Totally ordered broadcast in the face of network partitions. In D. R. Avresky, editor, Dependable Network Computing, chapter 3, pages 51--75. Kluwer Academic, 2000.Google Scholar
- J. C. Knight and N. G. Leveson. An experimental evaluation of the assumption of independence in multiversion programming. IEEE Trans. Softw. Eng., 12(1):96--109, 1986. Google ScholarDigital Library
- L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133--169, 1998. Google ScholarDigital Library
- F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv., 22(4):299--319, 1990. Google ScholarDigital Library
- A simple totally ordered broadcast protocol
Recommendations
Adaptively secure broadcast
EUROCRYPT'10: Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic TechniquesA broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the sender is corrupted, and (ii) this is the sender’s message, if he is ...
An ordered and reliable broadcast protocol for distributed systems
The purpose of a reliable broadcast protocol is to allow groups of nodes on unreliable broadcast networks to reliably broadcast messages. A reliable broadcast protocol must guarantee two properties: (1) all of the receivers in a group receive the ...
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10: Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin AmericaBroadcast (BC) is considered as the most fundamental primitive for fault-tolerant distributed computing and cryptographic protocols. An important and practical variant of BC is Asynchronous BC (known as A-cast). An A-cast protocol enables a specific ...
Comments