{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T12:23:43Z","timestamp":1769084623933,"version":"3.49.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Syst."],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>\n            As raw system performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A key approach to improving availability involves replicating the service across multiple, wide-area sites. However, replication introduces well-known trade-offs between service consistency and availability. Thus, this article explores the benefits of dynamically trading consistency for availability using a\n            <jats:italic>continuous consistency model<\/jats:italic>\n            . In this model, applications specify a maximum deviation from strong consistency on a per-replica basis. In this article, we: i) evaluate the availability of a prototype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii) demonstrate that simple optimizations to existing consistency protocols result in significant availability improvements (more than an order of magnitude in some scenarios), iii) use our experience with these optimizations to prove tight upper bound on the availability of services, and iv) show that maximizing availability typically entails remaining as close to strong consistency as possible during times of good connectivity, resulting in a communication versus availability trade-off.\n          <\/jats:p>","DOI":"10.1145\/1124153.1124156","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T16:09:20Z","timestamp":1147104560000},"page":"70-113","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["The costs and limits of availability for replicated services"],"prefix":"10.1145","volume":"24","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[{"name":"Intel Research Pittsburgh and Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"University of California, San Diego, La Jolla, CA"}]}],"member":"320","published-online":{"date-parts":[[2006,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering.]]","author":"Adya A.","year":"2000","unstructured":"Adya , A. , Liskov , B. , and O'Neil , P. 2000 . Generalized isolation level definitions . In Proceedings of the IEEE International Conference on Data Engineering.]] Adya, A., Liskov, B., and O'Neil, P. 2000. Generalized isolation level definitions. In Proceedings of the IEEE International Conference on Data Engineering.]]"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Annual International Symposium on Fault-Tolerant Computing.]]","author":"Amir Y.","unstructured":"Amir , Y. and Wool , A . 1996. Evaluating quorum systems over the Internet . In Proceedings of the Annual International Symposium on Fault-Tolerant Computing.]] Amir, Y. and Wool, A. 1996. Evaluating quorum systems over the Internet. In Proceedings of the Annual International Symposium on Fault-Tolerant Computing.]]"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Amir Y. and Wool A. 1998. Optimal availability quorum systems: Theory and practice. Inform. Proces. Letters 223--228.]] 10.1016\/S0020-0190(98)00017-9   Amir Y. and Wool A. 1998. Optimal availability quorum systems: Theory and practice. Inform. Proces. Letters 223--228.]] 10.1016\/S0020-0190(98)00017-9","DOI":"10.1016\/S0020-0190(98)00017-9"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 18th Symposium on Operating Systems Principles.]] 10","author":"Andersen D.","year":"2034","unstructured":"Andersen , D. , Balakrishnan , H. , Kaashoek , F. , and Morris , R . 2001. Resilient overlay networks . In Proceedings of the 18th Symposium on Operating Systems Principles.]] 10 .1145\/50 2034 .502048 Andersen, D., Balakrishnan, H., Kaashoek, F., and Morris, R. 2001. Resilient overlay networks. In Proceedings of the 18th Symposium on Operating Systems Principles.]] 10.1145\/502034.502048"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the Symposium on Networked Systems Design and Implementation.]]","author":"Andersen D. G.","unstructured":"Andersen , D. G. , Balakrishnan , H. , Kaashoek , M. F. , and Rao , R . 2005. Improving Web availability for clients with MONET . In Proceedings of the Symposium on Networked Systems Design and Implementation.]] Andersen, D. G., Balakrishnan, H., Kaashoek, M. F., and Rao, R. 2005. Improving Web availability for clients with MONET. In Proceedings of the Symposium on Networked Systems Design and Implementation.]]"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 13th ACM Symposium on Operating Systems Principles. 198--212","author":"Baker M.","unstructured":"Baker , M. , Hartman , J. , Kupfer , M. , Shirriff , K. , and Ousterhout , J . 1991. Measurements of a distributed file system . In Proceedings of the 13th ACM Symposium on Operating Systems Principles. 198--212 .]] 10.1145\/121132.121164 Baker, M., Hartman, J., Kupfer, M., Shirriff, K., and Ousterhout, J. 1991. Measurements of a distributed file system. In Proceedings of the 13th ACM Symposium on Operating Systems Principles. 198--212.]] 10.1145\/121132.121164"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/6420.6421"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676860"},{"key":"e_1_2_1_9_1","unstructured":"Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley.]]   Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley.]]"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 2000 USENIX Annual Technical Conference.]]","author":"Brown A.","unstructured":"Brown , A. and Patterson , D . 2000. Towards maintainability, availability, and growth benchmarks: A case study of software RAID systems . In Proceedings of the 2000 USENIX Annual Technical Conference.]] Brown, A. and Patterson, D. 2000. Towards maintainability, availability, and growth benchmarks: A case study of software RAID systems. In Proceedings of the 2000 USENIX Annual Technical Conference.]]"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]","author":"Candea G.","unstructured":"Candea , G. , Kawamoto , S. , Fujiki , Y. , Friedman , G. , and Fox , A . 2004. Microreboot---A technique for cheap recovery . In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]] Candea, G., Kawamoto, S., Fujiki, Y., Friedman, G., and Fox, A. 2004. Microreboot---A technique for cheap recovery. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 21st IEEE International Conference on Distributed Computing Systems.]]","author":"Cetintemel U.","unstructured":"Cetintemel , U. , Keleher , P. , and Franklin , M . 2001. Support for speculative update propagation and mobility in Deno . In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems.]] Cetintemel, U., Keleher, P., and Franklin, M. 2001. Support for speculative update propagation and mobility in Deno. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems.]]"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 5th ACM Symposium on Principle of Distributed Computing. 187--194","author":"Coan B.","unstructured":"Coan , B. , Oki , B. , and Kolodner , E . 1986. Limitations on database availability when networks partition . In Proceedings of the 5th ACM Symposium on Principle of Distributed Computing. 187--194 .]] 10.1145\/10590.10606 Coan, B., Oki, B., and Kolodner, E. 1986. Limitations on database availability when networks partition. In Proceedings of the 5th ACM Symposium on Principle of Distributed Computing. 187--194.]] 10.1145\/10590.10606"},{"key":"e_1_2_1_14_1","unstructured":"Cormen T. Leiserson C. and Rivest R. 1990. Introduction to Algorithms. The MIT Press.]]   Cormen T. Leiserson C. and Rivest R. 1990. Introduction to Algorithms. The MIT Press.]]"},{"key":"e_1_2_1_15_1","unstructured":"Czyzyk J. Mehrotra S. Wagner M. and Wright S. PCx: Software for linear programming. Available at: http:\/\/www-fp.mcs.anl.gov\/otc\/Tools\/PCx\/.]]  Czyzyk J. Mehrotra S. Wagner M. and Wright S. PCx: Software for linear programming. Available at: http:\/\/www-fp.mcs.anl.gov\/otc\/Tools\/PCx\/.]]"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810312"},{"key":"e_1_2_1_17_1","first-page":"00064","volume-title":"Inform. Proc. Letters, 1--6.]] 10","author":"Diks K.","unstructured":"Diks , K. , Kranakis , E. , Krizanc , D. , Mans , B. , and Pelc , A . 1994. Optimal coteries and voting schemes . Inform. Proc. Letters, 1--6.]] 10 .1016\/0020-0190(94) 00064 - 00066 Diks, K., Kranakis, E., Krizanc, D., Mans, B., and Pelc, A. 1994. Optimal coteries and voting schemes. Inform. Proc. Letters, 1--6.]] 10.1016\/0020-0190(94)00064-6"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 15th International Symposium on Distributed Computing (DISC). 48--62","author":"Douceur J. R.","unstructured":"Douceur , J. R. and Wattenhofer , R. P . 2001. Competitive hill-climbing strategies for replica placement in a distributed file system . In Proceedings of the 15th International Symposium on Distributed Computing (DISC). 48--62 .]] Douceur, J. R. and Wattenhofer, R. P. 2001. Competitive hill-climbing strategies for replica placement in a distributed file system. In Proceedings of the 15th International Symposium on Distributed Computing (DISC). 48--62.]]"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Faloutsos M. Faloutsos P. and Faloutsos C. 1999. On power-law relationships of the Internet topology. In SIGCOMM.]] 10.1145\/316188.316229   Faloutsos M. Faloutsos P. and Faloutsos C. 1999. On power-law relationships of the Internet topology. In SIGCOMM.]] 10.1145\/316188.316229","DOI":"10.1145\/316188.316229"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of HotOS-VII.]]","author":"Fox A.","unstructured":"Fox , A. and Brewer , E . 1999. Harvest, yield, and scalable tolerant systems . In Proceedings of HotOS-VII.]] Fox, A. and Brewer, E. 1999. Harvest, yield, and scalable tolerant systems. In Proceedings of HotOS-VII.]]"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 16th ACM Symposium on Operating Systems Principles. Saint-Malo, France.]] 10","author":"Fox A.","unstructured":"Fox , A. , Gribble , S. , Chawathe , Y. , and Brewer , E . 1997. Cluster-based scalable network services . In Proceedings of the 16th ACM Symposium on Operating Systems Principles. Saint-Malo, France.]] 10 .1145\/268998.266662 Fox, A., Gribble, S., Chawathe, Y., and Brewer, E. 1997. Cluster-based scalable network services. In Proceedings of the 16th ACM Symposium on Operating Systems Principles. Saint-Malo, France.]] 10.1145\/268998.266662"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 4th International Conference on Distributed Computing Systems.]]","author":"Garcia-Molina H.","unstructured":"Garcia-Molina , H. and Barbara , D . 1984. Optimizing the reliability provided by voting mechanisms . In Proceedings of the 4th International Conference on Distributed Computing Systems.]] Garcia-Molina, H. and Barbara, D. 1984. Optimizing the reliability provided by voting mechanisms. In Proceedings of the 4th International Conference on Distributed Computing Systems.]]"},{"key":"e_1_2_1_23_1","first-page":"4","article-title":"A weak-consistency architecture for distributed information services","volume":"5","author":"Golding R.","year":"1992","unstructured":"Golding , R. 1992 . A weak-consistency architecture for distributed information services . Comput. Syst. 5 , 4 (Fall), 379--405.]] Golding, R. 1992. A weak-consistency architecture for distributed information services. Comput. Syst. 5, 4 (Fall), 379--405.]]","journal-title":"Comput. Syst."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data.]] 10","author":"Gray J.","unstructured":"Gray , J. , Helland , P. , O'Neil , P. , and Shasha , D . 1996. The dangers of replication and a solution . In Proceedings of the ACM SIGMOD International Conference on Management of Data.]] 10 .1145\/233269.233330 Gray, J., Helland, P., O'Neil, P., and Shasha, D. 1996. The dangers of replication and a solution. In Proceedings of the ACM SIGMOD International Conference on Management of Data.]] 10.1145\/233269.233330"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]","author":"Gummadi K. P.","unstructured":"Gummadi , K. P. , Madhyastha , H. V. , Gribble , S. D. , Levy , H. M. , and Wetherall , D . 2004. Improving the reliability of Internet paths with one-hop source routing . In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]] Gummadi, K. P., Madhyastha, H. V., Gribble, S. D., Levy, H. M., and Wetherall, D. 2004. Improving the reliability of Internet paths with one-hop source routing. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781631"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 10th ACM Symposium on Principles of Database Systems.]] 10","author":"Johnson D. B.","unstructured":"Johnson , D. B. and Raab , L . 1991a. A tight upper bound on the benefits of replication and consistency control protocols . In Proceedings of the 10th ACM Symposium on Principles of Database Systems.]] 10 .1145\/113413.113420 Johnson, D. B. and Raab, L. 1991a. A tight upper bound on the benefits of replication and consistency control protocols. In Proceedings of the 10th ACM Symposium on Principles of Database Systems.]] 10.1145\/113413.113420"},{"key":"e_1_2_1_28_1","first-page":"4","article-title":"Effects of replication on data availability","volume":"1","author":"Johnson D. B.","year":"1991","unstructured":"Johnson , D. B. and Raab , L. 1991 b. Effects of replication on data availability . Int. J. Comput. Simul. 1 , 4 .]] Johnson, D. B. and Raab, L. 1991b. Effects of replication on data availability. Int. J. Comput. Simul. 1, 4.]]","journal-title":"Int. J. Comput. Simul."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing.]] 10","author":"Keleher P.","year":"1999","unstructured":"Keleher , P. 1999 . Decentralized replicated-object protocols . In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing.]] 10 .1145\/301308.301345 Keleher, P. 1999. Decentralized replicated-object protocols. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing.]] 10.1145\/301308.301345"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/146941.146942"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/195664.195670"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/151284.151287"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/138873.138877"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_35_1","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Algorithms","author":"Lampson B.","unstructured":"Lampson , B. 1996. How to build a highly available system using consensus . In Distributed Algorithms , Lecture Notes in Computer Science Vol. 1151 . Springer .]] Lampson, B. 1996. How to build a highly available system using consensus. In Distributed Algorithms, Lecture Notes in Computer Science Vol. 1151. Springer.]]"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 1999 Network Storage Symposium (Netstore).]]","author":"Noble B.","unstructured":"Noble , B. , Fleis , B. , and Kim , M . 1999. A Case for Fluid Replication . In Proceedings of the 1999 Network Storage Symposium (Netstore).]] Noble, B., Fleis, B., and Kim, M. 1999. A Case for Fluid Replication. In Proceedings of the 1999 Network Storage Symposium (Netstore).]]"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of SIGCOMM.]] 10","author":"Noble B.","unstructured":"Noble , B. , Satyananarayanan , M. , Nguyen , G. , and Katz , R . 1997. Trace-based mobile network emulation . In Proceedings of SIGCOMM.]] 10 .1145\/263105.263140 Noble, B., Satyananarayanan, M., Nguyen, G., and Katz, R. 1997. Trace-based mobile network emulation. In Proceedings of SIGCOMM.]] 10.1145\/263105.263140"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199802)28:2%3C155::AID-SPE155%3E3.0.CO;2-5"},{"key":"e_1_2_1_40_1","volume-title":"8th International Conference on Architectural Support for Programming Languages and Operating Systems.]] 10","author":"Pai V. S.","unstructured":"Pai , V. S. , Aron , M. , Banga , G. , Svendsen , M. , Druschel , P. , Zwaenepoel , W. , and Nahum , E . 1998. Locality-aware request distribution in cluster-based network servers . In 8th International Conference on Architectural Support for Programming Languages and Operating Systems.]] 10 .1145\/291069.291048 Pai, V. S., Aron, M., Banga, G., Svendsen, M., Druschel, P., Zwaenepoel, W., and Nahum, E. 1998. Locality-aware request distribution in cluster-based network servers. In 8th International Conference on Architectural Support for Programming Languages and Operating Systems.]] 10.1145\/291069.291048"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the ACM SIGCOMM'96 Conference on Communications Architectures and Protocols.]] 10","author":"Paxson V.","year":"1996","unstructured":"Paxson , V. 1996 . end-to-end routing behavior in the Internet . In Proceedings of the ACM SIGCOMM'96 Conference on Communications Architectures and Protocols.]] 10 .1145\/248156.248160 Paxson, V. 1996. end-to-end routing behavior in the Internet. In Proceedings of the ACM SIGCOMM'96 Conference on Communications Architectures and Protocols.]] 10.1145\/248156.248160"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1169"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP-16)","author":"Petersen K.","unstructured":"Petersen , K. , Spreitzer , M. , Terry , D. , Theimer , M. , and Demers , A . 1997. Flexible update propagation for weakly consistent replication . In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP-16) .]] 10.1145\/268998.266711 Petersen, K., Spreitzer, M., Terry, D., Theimer, M., and Demers, A. 1997. Flexible update propagation for weakly consistent replication. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP-16).]] 10.1145\/268998.266711"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the ACM SIGMOD Conference on Management of Data.]] 10","author":"Pu C.","unstructured":"Pu , C. and Leff , A . 1991. Replication control in distributed system: An asynchronous approach . In Proceedings of the ACM SIGMOD Conference on Management of Data.]] 10 .1145\/115790.115856 Pu, C. and Leff, A. 1991. Replication control in distributed system: An asynchronous approach. In Proceedings of the ACM SIGMOD Conference on Management of Data.]] 10.1145\/115790.115856"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0132031","article-title":"Computing the reliability of a complex network","volume":"32","author":"Rosenthal A.","year":"1977","unstructured":"Rosenthal , A. 1977 . Computing the reliability of a complex network . SIAM J. App. Math. 32 , 384 -- 393 .]] Rosenthal, A. 1977. Computing the reliability of a complex network. SIAM J. App. Math. 32, 384--393.]]","journal-title":"SIAM J. App. Math."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 17th ACM Symposium on Operating Systems Principles.]] 10","author":"Saito Y.","year":"1915","unstructured":"Saito , Y. , Bershad , B. , and Levy , H . 1999. Manageability, availability and performance in porcupine: A highly scalable Internet mail service . In Proceedings of the 17th ACM Symposium on Operating Systems Principles.]] 10 .1145\/3 1915 1.319152 Saito, Y., Bershad, B., and Levy, H. 1999. Manageability, availability and performance in porcupine: A highly scalable Internet mail service. In Proceedings of the 17th ACM Symposium on Operating Systems Principles.]] 10.1145\/319151.319152"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Savage S. Collins A. Hoffman E. Snell J. and Anderson T. 1999. The end-to-end effects of Internet path selection. In SIGCOMM.]] 10.1145\/316188.316233   Savage S. Collins A. Hoffman E. Snell J. and Anderson T. 1999. The end-to-end effects of Internet path selection. In SIGCOMM.]] 10.1145\/316188.316233","DOI":"10.1145\/316188.316233"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures.]] 10","author":"Singla A.","unstructured":"Singla , A. , Ramachandran , U. , and Hodgins , J . 1997. Temporal notions of synchronization and consistency in Beehive . In Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures.]] 10 .1145\/258492.258513 Singla, A., Ramachandran, U., and Hodgins, J. 1997. Temporal notions of synchronization and consistency in Beehive. In Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures.]] 10.1145\/258492.258513"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.262589"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]","author":"Swift M. M.","unstructured":"Swift , M. M. , Annamalai , M. , Bershad , B. N. , and Levy , H. M . 2004a. Recovering device drivers . In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]] Swift, M. M., Annamalai, M., Bershad, B. N., and Levy, H. M. 2004a. Recovering device drivers. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation.]]"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047915.1047919"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 15th ACM Symposium on Operating Systems Principles.]] 10","author":"Terry D. B.","unstructured":"Terry , D. B. , Theimer , M. M. , Petersen , K. , Demers , A. J. , Spreitzer , M. J. , and Hauser , C. H . 1995. Managing update conflicts in Bayou, a weakly connected replicated storage system . In Proceedings of the 15th ACM Symposium on Operating Systems Principles.]] 10 .1145\/224056.224070 Terry, D. B., Theimer, M. M., Petersen, K., Demers, A. J., Spreitzer, M. J., and Hauser, C. H. 1995. Managing update conflicts in Bayou, a weakly connected replicated storage system. In Proceedings of the 15th ACM Symposium on Operating Systems Principles.]] 10.1145\/224056.224070"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/320071.320076"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the 7th IEEE Symposium on Reliable Distributed Systems. 138--143","author":"Tong Z.","unstructured":"Tong , Z. and Kain , R. Y . 1988. Vote assignments in weighted voting mechanisms . In Proceedings of the 7th IEEE Symposium on Reliable Distributed Systems. 138--143 .]] Tong, Z. and Kain, R. Y. 1988. Vote assignments in weighted voting mechanisms. In Proceedings of the 7th IEEE Symposium on Reliable Distributed Systems. 138--143.]]"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the 18th ACM Symposium on Principle of Distributed Computing.]] 10","author":"Torres-Rojas F.","unstructured":"Torres-Rojas , F. , Ahamad , M. , and Raynal , M . 1999. Timed consistency for shared distributed objects . In Proceedings of the 18th ACM Symposium on Principle of Distributed Computing.]] 10 .1145\/301308.301350 Torres-Rojas, F., Ahamad, M., and Raynal, M. 1999. Timed consistency for shared distributed objects. In Proceedings of the 18th ACM Symposium on Principle of Distributed Computing.]] 10.1145\/301308.301350"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 26th International Conference on Very Large Databases (VLDB).]]","author":"Yu H.","unstructured":"Yu , H. and Vahdat , A . 2000. Efficient numerical error bounding for replicated network services . In Proceedings of the 26th International Conference on Very Large Databases (VLDB).]] Yu, H. and Vahdat, A. 2000. Efficient numerical error bounding for replicated network services. In Proceedings of the 26th International Conference on Very Large Databases (VLDB).]]"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS).]]","author":"Yu H.","unstructured":"Yu , H. and Vahdat , A . 2001. Combining generality and practicality in a conit-based continuous consistency model for wide-area replication . In Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS).]] Yu, H. and Vahdat, A. 2001. Combining generality and practicality in a conit-based continuous consistency model for wide-area replication. In Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS).]]"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/566340.566342"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.650138"}],"container-title":["ACM Transactions on Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1124153.1124156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1124153.1124156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:10Z","timestamp":1750259170000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1124153.1124156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1145\/1124153.1124156"],"URL":"https:\/\/doi.org\/10.1145\/1124153.1124156","relation":{},"ISSN":["0734-2071","1557-7333"],"issn-type":[{"value":"0734-2071","type":"print"},{"value":"1557-7333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]},"assertion":[{"value":"2006-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}