Cliff-Edge Consensus: Agreeing on the Precipice

  • François Taïani
  • Barry Porter
  • Geoff Coulson
  • Michel Raynal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7979)

Abstract

This paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness.

Keywords

distributed computing fault-tolerance failure detection consensus scalability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Babaoglu, O., Davoli, R., Montresor, A.: Group communication in partitionable systems: Specification and algorithms. Tech. Rep. UBLCS-98-01, University of Bologna (1998)Google Scholar
  2. 2.
    Baldoni, R., Bertier, M., Raynal, M., Tucci-Piergiovanni, S.: Looking for a definition of dynamic distributed systems. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 1–14. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Bar-Joseph, Z., Keidar, I., Lynch, N.: Early-delivery dynamic atomic broadcast. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 1–16. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Bonnet, F., Raynal, M.: The price of anonymity: Optimal consensus despite asynchrony, crash, and anonymity. ACM Trans. Auton. Adapt. Syst. 6(4), 23:1–23:28 (2011)Google Scholar
  5. 5.
    Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824–840 (1985)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in distributed hash tables. In: International Workshop on Future Directions in Distributed Computing (FuDiCo), pp. 52–55 (June 2002)Google Scholar
  7. 7.
    Cavin, D., Sasson, Y., Schiper, A.: Reaching agreement with unknown participants in mobile self-organized networks in spite of process crashes. Research Report IC/2005/026, EPFL (2005)Google Scholar
  8. 8.
    Cavin, D., Sasson, Y., Schiper, A.: Consensus with unknown participants or fundamental self-organization. In: Nikolaidis, I., Barbeau, M., An, H.-C. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 135–148. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. of the ACM 43(2), 225–267 (1996)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Chockler, G., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Comp. Surveys 33(4), 427–469 (2001)CrossRefGoogle Scholar
  11. 11.
    Fekete, A., Lynch, N., Shvartsman, A.: Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19(2), 171–216 (2001)CrossRefGoogle Scholar
  12. 12.
    Friedman, R., Raynal, M., Travers, C.: Two abstractions for implementing atomic objects in dynamic systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 73–87. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Greve, F., Tixeuil, S.: Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. In: Proc. of the 37th IEEE/IFIP Int. Conf. on Dependable Sys. and Networks, DSN 2007, pp. 82–91 (2007)Google Scholar
  14. 14.
    Guerraoui, R., Rodrigues, L.: Introduction to Reliable Distributed Programming, 300 p. Springer (2006) ISBN 978-3540288459Google Scholar
  15. 15.
    Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. and Comp. 88(1), 60–87 (1990)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Keidar, I., Sussman, J., Marzullo, K., Dolev, D.: Moshe: A group membership service for WANs. ACM Trans. Comput. Syst. 20(3), 191–238 (2002)CrossRefGoogle Scholar
  17. 17.
    Porter, B., Taïani, F., Coulson, G.: Generalised repair for overlay networks. In: 25th Proc. of the IEEE Symp. on Reliable Dist. Syst., SRDS 2006, pp. 132–142 (2006)Google Scholar
  18. 18.
    Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems. Synthesis Lectures on Distributed Computing, 273 p. Morgan & Claypool (2010) ISBN 978-1-60845-293-4Google Scholar
  19. 19.
    Singh, S., Kurose, J.F.: Electing “good” leaders. J. of Parallel and Distributed Comp. 21, 184–201 (1994)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • François Taïani
    • 1
  • Barry Porter
    • 3
  • Geoff Coulson
    • 4
  • Michel Raynal
    • 1
    • 2
  1. 1.IRISAUniversité de Rennes 1France
  2. 2.Institut universitaire de FranceFrance
  3. 3.School of Computer ScienceUniversity of St AndrewsUK
  4. 4.School of Computing and CommunicationsLancaster UniversityUK

Personalised recommendations