Skip to main content
SpringerLink
Log in

A Characterization of Dynamic Networks Where Consensus Is Solvable

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8179))

Abstract

We consider the Consensus problem in arbitrary dynamic networks. A dynamic network is a communication network whose topology evolves from round to round. We make no assumptions on the possible topologies. We give the first complete necessary and sufficient condition for dynamic networks where it is possible to solve Consensus.

We show that we can complement the necessary condition for solvability of Consensus given, in the context of omission faults, in [GP11] in the context of dynamic networks. We prove that this condition is actually sufficient by presenting a new Consensus algorithm. This algorithm is based upon reconstructing a partial, but significant, view of the actual communications that occurred during the execution.

The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biely, M., Robinson, P., Schmid, U.: Agreement in directed dynamic networks. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 73–84. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distributed Computing 22(1), 49–71 (2009)

    Google Scholar 

  3. Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems 27(5), 387–408 (2012)

    Article  Google Scholar 

  4. Fevat, T., Godard, E.: About minimal obstructions for the coordinated attack problem. In: Proc. of 25th IEEE International Parallel & Distributed Processing Symposium, IPDPS 2011 (2011)

    Google Scholar 

  5. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press (1995)

    Google Scholar 

  6. Godard, E., Peters, J.: Consensus vs. Broadcast in communication networks with arbitrary mobile omission faults. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 29–41. Springer, Heidelberg (2011), Updated version on http://arxiv.org/abs/1106.3579

  7. Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513–522 (2010)

    Google Scholar 

  8. Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: PODC 2011, pp. 1–10. ACM (2011)

    Google Scholar 

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

    MATH  Google Scholar 

  10. Moses, Y., Rajsbaum, S.: A layered analysis of consensus. SIAM Journal on Computing 31(4), 989–1021 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Pease, L., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  12. Raynal, M.: Consensus in synchronous systems: A concise guided tour. In: Pacific Rim Intern. Symp. on Dependable Computing, p. 221. IEEE (2002)

    Google Scholar 

  13. Santoro, N., Widmayer, P.: Time is not a healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 304–313. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  14. Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2-3), 232–249 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM J. on Computing 38(5), 1912–1951 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIF, Université Aix-Marseille and CNRS, France

    Étienne Coulouma & Emmanuel Godard

Authors
  1. Étienne Coulouma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel Godard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. System Algorithms Research Group, Microsoft Research Asia, No. 5, Dan Ling Street, 100080, Beijing, China

    Thomas Moscibroda

  2. Dipartimento di Informatica, Università di Salerno, Via Ponte don Melillo, 84084, Fisciano, SA, Italy

    Adele A. Rescigno

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coulouma, É., Godard, E. (2013). A Characterization of Dynamic Networks Where Consensus Is Solvable. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03578-9_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03577-2

  • Online ISBN: 978-3-319-03578-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation