Skip to main content
SpringerLink
Log in

Practically Self-stabilizing Paxos Replicated State-Machine

  • Conference paper
  • First Online:
Networked Systems (NETYS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8593))

Included in the following conference series:

Abstract

We present the first (practically) self-stabilizing replicated state machine for asynchronous message passing systems. The scheme is based on a variant of the Paxos algorithm and ensures that starting from an arbitrary configuration, the replicated state-machine eventually exhibits the desired behaviour for a long enough execution regarding all practical considerations.

Partially supported by Deutsche Telekom, Rita Altura Trust Chair in Computer Sciences, Israeli Internet Association, Israeli Ministry of Science, Lynne and William Frankel Center for Computer Sciences, and Israel Science Foundation (grant number 428/11).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In their paper, “practical” is not related to our notion of practical self-stabilization.

  2. 2.

    These ballot numbers are not used to indexed the requests like the step numbers above.

  3. 3.

    For a formal definition, refer to, e.g., [7, 19].

  4. 4.

    For sake of simplicity, the events and the transitions are omitted.

  5. 5.

    This would create Byzantine processes, and is outside of our scope.

  6. 6.

    Note that the sentences “\(f\) happens after \(e\)” and “\(e\) does not happen before \(f\)” are not equivalent.

  7. 7.

    How a proposer becomes active can be modeled by a the output of a failure detector.

  8. 8.

    They come from the original formulation of Paxos.

  9. 9.

    i.e., the field \(v'[\mu ].cl\) is set to \(v_{\alpha }[\mu ].(l~or~cl)\). In case, there is a canceling label and the overflow symbol, the canceling label is preferred.

  10. 10.

    Precisely, it has invoked the label increment function to update the entry \(\mu \) of its tag \(v_{\mu }\).

  11. 11.

    Recall that this means the acceptor, say \(\alpha \), copies the entry \(v[\chi (v)]\) in the entry \(v_{\alpha }[\chi (v)]\).

References

  1. Abraham, U.: Self-stabilizing timestamps. Theor. Comput. Sci. 308(1–3), 449–515 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Pragmatic self-stabilization of atomic memory in message-passing systems. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 19–31. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Blanchard, P., Dolev, S., Beauquier, J., Delaët, S.: Self-stabilizing Paxos. CoRR, abs/1305.4263 (2013)

    Google Scholar 

  4. Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI’99, Berkeley, CA, USA, pp. 173–186. USENIX Association (1999)

    Google Scholar 

  5. Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live: an engineering perspective. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC’07, New York, USA, pp. 398–407. ACM (2007)

    Google Scholar 

  6. Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM J. Comput. 26(2), 418–455 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  8. Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 133–147. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Dolev, S., Kat, R.I., Schiller, E.M.: When consensus meets self-stabilization. J. Comput. Syst. Sci. 76, 884–900 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32, 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463–492 (1990)

    Article  Google Scholar 

  12. Israeli, A., Li, M.: Bounded time-stamps. Distrib. Comput. 6(4), 205–209 (1993)

    Article  MATH  Google Scholar 

  13. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  14. Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998)

    Article  Google Scholar 

  15. Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)

    Google Scholar 

  16. Lamport, L.: Generalized consensus and Paxos. Technical report MSR-TR-2005-33, Microsoft Research (2005)

    Google Scholar 

  17. Lamport, L.: Fast Paxos. Distrib. Comput. 19(2), 79–103 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lamport, L.: Byzantizing Paxos by refinement. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 211–224. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI, Paris-Sud XI University, Orsay, France

    Peva Blanchard, Joffroy Beauquier & Sylvie Delaët

  2. Department of Computer Science, Ben-Gurion University of the Negev, 84105, Beer-Sheva, Israel

    Shlomi Dolev

Authors
  1. Peva Blanchard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joffroy Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sylvie Delaët
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peva Blanchard .

Editor information

Editors and Affiliations

  1. Northeastern University, Boston, Massachusetts, USA

    Guevara Noubir

  2. Université de Rennes 1, Rennes Cedex, France

    Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Blanchard, P., Dolev, S., Beauquier, J., Delaët, S. (2014). Practically Self-stabilizing Paxos Replicated State-Machine. In: Noubir, G., Raynal, M. (eds) Networked Systems. NETYS 2014. Lecture Notes in Computer Science(), vol 8593. Springer, Cham. https://doi.org/10.1007/978-3-319-09581-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09581-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09580-6

  • Online ISBN: 978-3-319-09581-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation