Brief announcement: Gracefully degrading consensus and k-set agreement under dynamic link failures

Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We present a k-set agreement algorithm for synchronous dynamic distributed systems with unidirectional links controlled by an omniscient adversary. Our algorithm automatically adapts to the actual network properties: If the network is sufficiently well-connected, it solves consensus, while degrading gracefully to general k-set agreement in less well-behaved runs. The algorithm is oblivious to the maximum number of system-wide decision values k, which is bounded by the number of certain strongly connected components occurring in the dynamically changing network in a run. Related impossibility results reveal that this bound is close to the solvability border for k-set agreement. To the best of our knowledge, this is the first consensus algorithm that degrades in a graceful way in a dynamic network.

Original languageEnglish (US)
Title of host publicationPODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages341-343
Number of pages3
ISBN (Print)9781450329446
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 - Paris, France
Duration: Jul 15 2014Jul 18 2014

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2014 ACM Symposium on Principles of Distributed Computing, PODC 2014
Country/TerritoryFrance
CityParis
Period7/15/147/18/14

Keywords

  • Distributed algorithms
  • Dynamic networks
  • Gracefully degrading consensus
  • K-set agreement

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Brief announcement: Gracefully degrading consensus and k-set agreement under dynamic link failures'. Together they form a unique fingerprint.

Cite this