%0 Journal Article %1 GilbertLynch02sigact %A Gilbert, Seth %A Lynch, Nancy %D 2002 %J SIGACT News %K 01614 acm paper data processing network database application optimize theory software engineering %N 2 %P 51--59 %R 10.1145/564585.564601 %T Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-tolerant Web Services %V 33 %X 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.

@article{GilbertLynch02sigact, 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.}, added-at = {2014-12-27T23:03:27.000+0100}, author = {Gilbert, Seth and Lynch, Nancy}, biburl = {https://www.bibsonomy.org/bibtex/23344f078bdec0bbd6ef2e0f7d346db5b/flint63}, doi = {10.1145/564585.564601}, file = {ACM Digital Library:2000-04/GilbertLynch02sigact.pdf:PDF}, groups = {public}, interhash = {db3ba0435f92c8b28fdd740ec64cbb34}, intrahash = {3344f078bdec0bbd6ef2e0f7d346db5b}, issn = {0163-5700}, journal = {SIGACT News}, keywords = {01614 acm paper data processing network database application optimize theory software engineering}, month = {#jun#}, number = 2, pages = {51--59}, timestamp = {2018-04-16T12:15:07.000+0200}, title = {Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-tolerant Web Services}, username = {flint63}, volume = 33, year = 2002 }