Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

  • Authors:
  • Seth Gilbert;Nancy Lynch

  • Affiliations:
  • Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • ACM SIGACT News
  • Year:
  • 2002

Quantified Score

Hi-index 0.05

Visualization

Abstract

When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.