Chasing the Weakest System Model for Implementing Ω and Consensus

  • Authors:
  • Martin Hutle;Dahlia Malkhi;Ulrich Schmid;Lidong Zhou

  • Affiliations:
  • EPFL Vienna University of Technology, Vienna;Microsoft Research;Vienna University of Technology, Vienna;Microsoft Research

  • Venue:
  • IEEE Transactions on Dependable and Secure Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Aguilera et al. and Malkhi et al. presented two system models, which are weaker than all previously proposed models where the eventual leader election oracle Ω can be implemented, and thus, consensus can also be solved. The former model assumes unicast steps and at least one correct process with f outgoing eventually timely links, whereas the latter assumes broadcast steps and at least one correct process with f bidirectional but moving eventually timely links. Consequently, those models are incomparable. In this paper, we show that Ω can also be implemented in a system with at least one process with f outgoing moving eventually timely links, assuming either unicast or broadcast steps. It seems to be the weakest system model that allows to solve consensus via Ω-based algorithms known so far. We also provide matching lower bounds for the communication complexity of Ω in this model, which are based on an interesting “stabilization property” of infinite runs. Those results reveal a fairly high price to be paid for this further relaxation of synchrony properties.