Gracefully degrading consensus and k-set agreement in directed dynamic networks

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

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

10 Scopus citations


We present (This work has been supported the Austrian Science Fund (FWF) project P26436 (SIC) and S11405 (RiSE).) the first consensus/k-set agreement algorithm for synchronous dynamic networks with unidirectional links, controlled by an omniscient message adversary, which automatically adapts to the actual network properties in a run: If the network is sufficiently well-connected, it solves consensus, while it degrades gracefully to general k-set agreement in less well-connected communication graphs. The actual number k of system-wide decision values is determined by the number of certain vertex-stable root components occurring in a run, which are strongly connected components without incoming links from outside. Related impossibility results reveal that our condition is reasonably close to the solvability border for k-set agreement.

Original languageEnglish (US)
Title of host publicationNetworked Systems - 3rd International Conference, NETYS 2015, Revised Selected Papers
EditorsAhmed Bouajjani, Hugues Fauconnier
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783319268491
StatePublished - 2015
Externally publishedYes
Event3rd International Conference on Networked Systems, NETYS 2015 - Agadir, Morocco
Duration: May 13 2015May 15 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Conference on Networked Systems, NETYS 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Gracefully degrading consensus and k-set agreement in directed dynamic networks'. Together they form a unique fingerprint.

Cite this