Tutorial Summary: Paxos Explained from Scratch

  • Hein Meling
  • Leander Jehl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)


Paxos is a flexible and fault tolerant protocol for solving the consensus problem, where participants in a distributed system need to agree on a common value. However, Paxos is reputed for being difficult to understand. This tutorial aims to address this difficulty by visualizing Paxos in a completely new way. Starting from a naive solution and strong assumptions, Paxos is derived in a step-wise fashion. In each step, minimal changes are made to the solution and assumptions, aimed at understanding why the solution fails. In this manner, a correct solution that corresponds to Paxos is eventually reached.


Fault Tolerance Failure Detection Client Request Round Number Network Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lamport, L.: The part-time parliment. ACM Trans. on Comp. Syst. 16(2), 133–169 (1998)CrossRefGoogle Scholar
  2. 2.
    Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)Google Scholar
  3. 3.
    Burrows, M.: The chubby lock service for loosely-coupled distributed systems. In: Proc. OSDI, pp. 335–350 (2006)Google Scholar
  4. 4.
    Hunt, P., Konar, M., Junqueira, F.P., Reed, B.: Zookeeper: wait-free coordination for internet-scale systems. In: Proc. USENIX ATC (2010)Google Scholar
  5. 5.
    Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Trans. Dependable Secur. Comput. 3(3), 202–215 (2006)CrossRefGoogle Scholar
  7. 7.
    Mao, Y., Junqueira, F.P., Marzullo, K.: Mencius: building efficient replicated state machines for wans. In: Proc. OSDI, pp. 369–384 (2008)Google Scholar
  8. 8.
    Meling, H., Marzullo, K., Mei, A.: When you don’t trust clients: Byzantine proposer fast paxos. In: Proc. ICDCS, pp. 193–202 (2012)Google Scholar
  9. 9.
    Lamport, L.: Fast paxos. Distributed Computing 19(2), 79–103 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. Technical report, Stanford University (2013)Google Scholar
  11. 11.
    Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live: an engineering perspective. In: Proc. PODC, pp. 398–407 (2007)Google Scholar
  12. 12.
    De Prisco, R., Lampson, B., Lynch, N.: Revisiting the paxos algorithm. Theor. Comput. Sci. 243(1-2), 35–91 (2000)CrossRefzbMATHGoogle Scholar
  13. 13.
    van Renesse, R.: Paxos made moderately complex. Technical report, Cornell University (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Hein Meling
    • 1
  • Leander Jehl
    • 1
  1. 1.University of StavangerNorway

Personalised recommendations