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

Explore this paper's citation graph

Summary

This conjecture is proved in the asynchronous network model that it is impossible to achieve all three properties of a distributed web service: consistency, availability, and partition tolerance.

Type
article
Published
2002-06-01
Cited by
2,090
References
12

Keywords

Partition (number theory), Conjecture, Asynchronous communication, Computer science, Dilemma

References

Cited by

Related papers