{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:02:52Z","timestamp":1759960972464,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"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. Storage"],"published-print":{"date-parts":[[2005,2]]},"abstract":"<jats:p>\n            Reducing management costs and improving the availability of large-scale distributed systems require automatic replica\n            <jats:italic>regeneration<\/jats:italic>\n            , that is, creating new replicas in response to replica failures. A major challenge to regeneration is maintaining consistency when the replica group changes. Doing so is particularly difficult across the wide area where failure detection is complicated by network congestion and node overload.In this context, this article presents Om, the first read\/write peer-to-peer, wide-area storage system that achieves high availability and manageability through online automatic regeneration while still preserving consistency guarantees. We achieve these properties through the following techniques. First, by utilizing the\n            <jats:italic>limited view divergence<\/jats:italic>\n            property in today's Internet and by adopting the\n            <jats:italic>witness model<\/jats:italic>\n            , Om is able to regenerate from any single replica, rather than requiring a majority quorum, at the cost of a small (10\n            <jats:sup>\u22126<\/jats:sup>\n            in our experiments) probability of violating consistency during each regeneration. As a result, Om can deliver high availability with a small number of replicas, while traditional designs would significantly increase the number of replicas. Next, we distinguish\n            <jats:italic>failure-free<\/jats:italic>\n            reconfigurations from\n            <jats:italic>failure-induced<\/jats:italic>\n            ones, enabling common reconfigurations to proceed with a single round of communication. Finally, we use a\n            <jats:italic>lease graph<\/jats:italic>\n            among the replicas and a two-phase write protocol to optimize for reads, so that reads in Om can be processed by any single replica. Experiments on PlanetLab show that consistent regeneration in Om completes in approximately 20 seconds.\n          <\/jats:p>","DOI":"10.1145\/1044956.1044958","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T15:52:42Z","timestamp":1122911562000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Consistent and automatic replica regeneration"],"prefix":"10.1145","volume":"1","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[{"name":"Intel Research Pittsburgh\/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":[[2005,2]]},"reference":[{"volume-title":"Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]","author":"Adya A.","key":"e_1_2_1_1_1","unstructured":"Adya , A. , Bolosky , W. J. , Castro , M. , Cermak , G. , Chaiken , R. , Douceur , J. R. , Howell , J. , Lorch , J. R. , Theimer , M. , and Wattenhofer , R. P . 2002. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment . In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]] Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., and Wattenhofer, R. P. 2002. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]"},{"key":"e_1_2_1_2_1","unstructured":"Akamai Corporation. 1999. http:\/\/www.akamai.com.]]  Akamai Corporation. 1999. http:\/\/www.akamai.com.]]"},{"volume-title":"Proceedings of the 22nd International Symposium on Fault Tolerant Computing. 76--84","author":"Amir Y.","key":"e_1_2_1_3_1","unstructured":"Amir , Y. , Dolev , D. , Kramer , S. , and Malki , D . 1992. Transis: A communication subsystem for high availability . In Proceedings of the 22nd International Symposium on Fault Tolerant Computing. 76--84 .]] Amir, Y., Dolev, D., Kramer, S., and Malki, D. 1992. Transis: A communication subsystem for high availability. In Proceedings of the 22nd International Symposium on Fault Tolerant Computing. 76--84.]]"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 18th Symposium on Operating Systems Principles (SOSP).]] 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 (SOSP).]] 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 (SOSP).]] 10.1145\/502034.502048"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240881"},{"volume-title":"Workshop on Distributed Algorithms. 1--16","author":"Babaoglu O.","key":"e_1_2_1_6_1","unstructured":"Babaoglu , O. , Bartoli , A. , and Dini , G . 1994. Replicated file management in large-scale distributed systems . In Workshop on Distributed Algorithms. 1--16 .]] Babaoglu, O., Bartoli, A., and Dini, G. 1994. Replicated file management in large-scale distributed systems. In Workshop on Distributed Algorithms. 1--16.]]"},{"volume-title":"Symposium on Reliable Distributed Systems. 138--145","author":"Bartoli A.","key":"e_1_2_1_7_1","unstructured":"Bartoli , A. and Babaoglu , O . 1997. Selecting a \"primary partition\" in partitionable asynchronous distributed systems . In Symposium on Reliable Distributed Systems. 138--145 .]] Bartoli, A. and Babaoglu, O. 1997. Selecting a \"primary partition\" in partitionable asynchronous distributed systems. In Symposium on Reliable Distributed Systems. 138--145.]]"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7478"},{"volume-title":"Proceedings of the 5th International Workshop on Distributed Algorithms.]]","author":"Bracha G.","key":"e_1_2_1_9_1","unstructured":"Bracha , G. and Rachman , O . 1991. Randomized consensus in expected O(n2 logn) operations . In Proceedings of the 5th International Workshop on Distributed Algorithms.]] Bracha, G. and Rachman, O. 1991. Randomized consensus in expected O(n2 logn) operations. In Proceedings of the 5th International Workshop on Distributed Algorithms.]]"},{"volume-title":"DSN Workshop on Dependability Benchmarking.]]","author":"Brown A.","key":"e_1_2_1_10_1","unstructured":"Brown , A. , Chung , L. , and Patterson , D . 2002. Including the human factor in dependability benchmarks . In DSN Workshop on Dependability Benchmarking.]] Brown, A., Chung, L., and Patterson, D. 2002. Including the human factor in dependability benchmarks. In DSN Workshop on Dependability Benchmarking.]]"},{"volume-title":"Proceedings of the 4th Symposium on Operating Systems Design and Implementation (OSDI).]]","author":"Castro M.","key":"e_1_2_1_11_1","unstructured":"Castro , M. and Liskov , B . 2000. Proactive recovery in a Byzantine-fault-tolerant system . In Proceedings of the 4th Symposium on Operating Systems Design and Implementation (OSDI).]] Castro, M. and Liskov, B. 2000. Proactive recovery in a Byzantine-fault-tolerant system. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation (OSDI).]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/503112.503113"},{"key":"e_1_2_1_13_1","unstructured":"Chow R. and Johnson T. 1998. Distributed Operating Systems & Algorithms. Addison Wesley Longman Inc.]]   Chow R. and Johnson T. 1998. Distributed Operating Systems & Algorithms. Addison Wesley Longman Inc.]]"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.4626"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 18th ACM Symposium on Operating Systems Principles.]] 10","author":"Dabek F.","year":"2034","unstructured":"Dabek , F. , Kaashoek , M. F. , Karger , D. , Morris , R. , and Stoica , I . 2001. Wide-area cooperative storage with CFS . In Proceedings of the 18th ACM Symposium on Operating Systems Principles.]] 10 .1145\/50 2034 .502054 Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles.]] 10.1145\/502034.502054"},{"volume-title":"Proceedings of the 2nd International Workshop on Peer-to-Peer Systems.]]","author":"Dabek F.","key":"e_1_2_1_16_1","unstructured":"Dabek , F. , Zhao , B. , Druschel , P. , Kubiatowicz , J. , and Stoica , I . 2003. Towards a common API for structured peer-to-peer overlays . In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems.]] Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., and Stoica, I. 2003. Towards a common API for structured peer-to-peer overlays. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems.]]"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810312"},{"volume-title":"Proceedings of the 16th ACM Symposium on Operating Systems Principles. Saint-Malo, France.]] 10","author":"Fox A.","key":"e_1_2_1_18_1","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_19_1","unstructured":"FreePastry. http:\/\/www.cs.rice.edu\/CS\/Systems\/Pastry\/FreePastry.]]  FreePastry. http:\/\/www.cs.rice.edu\/CS\/Systems\/Pastry\/FreePastry.]]"},{"volume-title":"Proceedings of the International Symposium on Distributed Computing. 330--344","author":"Gafni E.","key":"e_1_2_1_20_1","unstructured":"Gafni , E. and Lamport , L . 2000. Disk paxos . In Proceedings of the International Symposium on Distributed Computing. 330--344 .]] Gafni, E. and Lamport, L. 2000. Disk paxos. In Proceedings of the International Symposium on Distributed Computing. 330--344.]]"},{"volume-title":"Proceedings of the International Conference on Dependable Systems and Networks (DSN).]]","author":"Gilbert S.","key":"e_1_2_1_21_1","unstructured":"Gilbert , S. , Lynch , N. , and Shvartsman , A . 2003. RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks . In Proceedings of the International Conference on Dependable Systems and Networks (DSN).]] Gilbert, S., Lynch, N., and Shvartsman, A. 2003. RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In Proceedings of the International Conference on Dependable Systems and Networks (DSN).]]"},{"key":"e_1_2_1_22_1","first-page":"4","article-title":"The diameter of a strongly connected graph (Russian)","volume":"170","author":"Goldberg M. K.","year":"1966","unstructured":"Goldberg , M. K. 1966 . The diameter of a strongly connected graph (Russian) . Doklady 170 , 4 .]] Goldberg, M. K. 1966. The diameter of a strongly connected graph (Russian). Doklady 170, 4.]]","journal-title":"Doklady"},{"volume-title":"Proceedings of the 12th ACM Symposium on Operating Systems Principles. 202--210","author":"Gray C.","key":"e_1_2_1_23_1","unstructured":"Gray , C. and Cheriton , D . 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency . In Proceedings of the 12th ACM Symposium on Operating Systems Principles. 202--210 .]] 10.1145\/74850.74870 Gray, C. and Cheriton, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the 12th ACM Symposium on Operating Systems Principles. 202--210.]] 10.1145\/74850.74870"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"volume-title":"Proceedings of the 10th International Conference on Distributed Computing Systems. 222--230","author":"Kaashoek M. F.","key":"e_1_2_1_25_1","unstructured":"Kaashoek , M. F. and Tanenbaum , A. S . 1991. Group communication in the Amoeba distributed operating system . In Proceedings of the 10th International Conference on Distributed Computing Systems. 222--230 .]] Kaashoek, M. F. and Tanenbaum, A. S. 1991. Group communication in the Amoeba distributed operating system. In Proceedings of the 10th International Conference on Distributed Computing Systems. 222--230.]]"},{"volume-title":"Proceedings of the ACM Symposium of Principles of Database Systems.]] 10","author":"Keidar I.","key":"e_1_2_1_26_1","unstructured":"Keidar , I. and Dolev , D . 1995. Increasing the resilience of atomic commit, at no additional cost . In Proceedings of the ACM Symposium of Principles of Database Systems.]] 10 .1145\/212433.212468 Keidar, I. and Dolev, D. 1995. Increasing the resilience of atomic commit, at no additional cost. In Proceedings of the ACM Symposium of Principles of Database Systems.]] 10.1145\/212433.212468"},{"volume-title":"Proceedings of ACM ASPLOS.]] 10","author":"Kubiatowicz J.","key":"e_1_2_1_27_1","unstructured":"Kubiatowicz , J. , Bindel , D. , Chen , Y. , Eaton , P. , Geels , D. , Gummadi , R. , Rhea , S. , Weatherspoon , H. , Weimer , W. , Wells , C. , and Zhao , B . 2000. OceanStore: An architecture for global-scale persistent storage . In Proceedings of ACM ASPLOS.]] 10 .1145\/378993.379239 Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. 2000. OceanStore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS.]] 10.1145\/378993.379239"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"volume-title":"Distributed algorithms","author":"Lynch N.","key":"e_1_2_1_29_1","unstructured":"Lynch , N. 1997. Distributed algorithms . Morgan Kaufmann Publishers .]] Lynch, N. 1997. Distributed algorithms. Morgan Kaufmann Publishers.]]"},{"volume-title":"Proceedings of the 16th International Symposium on Distributed Computing (DISC).]]","author":"Lynch N.","key":"e_1_2_1_30_1","unstructured":"Lynch , N. and Shvartsman , A . 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks . In Proceedings of the 16th International Symposium on Distributed Computing (DISC).]] Lynch, N. and Shvartsman, A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Proceedings of the 16th International Symposium on Distributed Computing (DISC).]]"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1088\/0967-1846\/1\/2\/004"},{"volume-title":"Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]","author":"Muthitacharoen A.","key":"e_1_2_1_32_1","unstructured":"Muthitacharoen , A. , Morris , R. , Gil , T. , and Chen , B . 2002. Ivy: A read\/write peer-to-peer file system . In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]] Muthitacharoen, A., Morris, R., Gil, T., and Chen, B. 2002. Ivy: A read\/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 6th International Conference on Distributed Computer Systems. 606--612","author":"Paris J.-F.","year":"1986","unstructured":"Paris , J.-F. 1986 . Voting with Witnesses: A consistency scheme for replicated files . In Proceedings of the 6th International Conference on Distributed Computer Systems. 606--612 .]] Paris, J.-F. 1986. Voting with Witnesses: A consistency scheme for replicated files. In Proceedings of the 6th International Conference on Distributed Computer Systems. 606--612.]]"},{"volume-title":"Proceedings of the ACM HotNets-I Workshop.]]","author":"Peterson L.","key":"e_1_2_1_34_1","unstructured":"Peterson , L. , Anderson , T. , Culler , D. , and Roscoe , T . 2002. A blueprint for introducing disruptive technology into the internet . In Proceedings of the ACM HotNets-I Workshop.]] Peterson, L., Anderson, T., Culler, D., and Roscoe, T. 2002. A blueprint for introducing disruptive technology into the internet. In Proceedings of the ACM HotNets-I Workshop.]]"},{"volume-title":"Proceedings of the 13th International Symposium on Distributed Computing (DISC).]]","author":"Prisco R. D.","key":"e_1_2_1_35_1","unstructured":"Prisco , R. D. , Fekete , A. , Lynch , N. , and Shvartsman , A . 1999. A dynamic primary configuration group communication service . In Proceedings of the 13th International Symposium on Distributed Computing (DISC).]] Prisco, R. D., Fekete, A., Lynch, N., and Shvartsman, A. 1999. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing (DISC).]]"},{"key":"e_1_2_1_36_1","unstructured":"Renesse R. Birman K. Cooper R. Glade B. and Stephenson P. 1993. The Horus System. In Reliable Distributed Computing with the Isis Toolkit K. P. Birman and R. van Renesse Eds. 133--147.]]  Renesse R. Birman K. Cooper R. Glade B. and Stephenson P. 1993. The Horus System. In Reliable Distributed Computing with the Isis Toolkit K. P. Birman and R. van Renesse Eds. 133--147.]]"},{"volume-title":"Proceedings of the 2nd USENIX Conference on File and Storage Technologies.]]","author":"Rhea S.","key":"e_1_2_1_37_1","unstructured":"Rhea , S. , Eaton , P. , Geels , D. , Weatherspoon , H. , Zhao , B. , and Kubiatowicz , J . 2003. Pond: the OceanStore prototype . In Proceedings of the 2nd USENIX Conference on File and Storage Technologies.]] Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., and Kubiatowicz, J. 2003. Pond: the OceanStore prototype. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies.]]"},{"volume-title":"Proceedings of the 10th ACM Symposium of Principles of Distributed Computing. 341--352","author":"Ricciardi A.","key":"e_1_2_1_38_1","unstructured":"Ricciardi , A. and Birman , K . 1991. Using process groups to implement failure detection in asynchronous environments . In Proceedings of the 10th ACM Symposium of Principles of Distributed Computing. 341--352 .]] 10.1145\/112600.112628 Ricciardi, A. and Birman, K. 1991. Using process groups to implement failure detection in asynchronous environments. In Proceedings of the 10th ACM Symposium of Principles of Distributed Computing. 341--352.]] 10.1145\/112600.112628"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45518-3_18"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 18th ACM Symposium on Operating Systems Principles. 188--201","author":"Rowstron A.","year":"2034","unstructured":"Rowstron , A. and Druschel , P . 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility . In Proceedings of the 18th ACM Symposium on Operating Systems Principles. 188--201 .]] 10.1145\/50 2034 .502053 Rowstron, A. and Druschel, P. 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles. 188--201.]] 10.1145\/502034.502053"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Sahner R. A. Trivedi K. S. and Puliafito A. 1996. Performance and Reliability Analysis of Computer Systems. Kluwer Academic Publishers.]]   Sahner R. A. Trivedi K. S. and Puliafito A. 1996. Performance and Reliability Analysis of Computer Systems. Kluwer Academic Publishers.]]","DOI":"10.1007\/978-1-4615-2367-3"},{"key":"e_1_2_1_42_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"},{"volume-title":"Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]","author":"Saito Y.","key":"e_1_2_1_43_1","unstructured":"Saito , Y. , Karamanolis , C. , Karlsson , M. , and Mahalingam , M . 2002. Taming aggressive replication in the Pangaea wide-area file system . In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]] Saito, Y., Karamanolis, C., Karlsson, M., and Mahalingam, M. 2002. Taming aggressive replication in the Pangaea wide-area file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation.]]"},{"volume-title":"Proceedings of the 2nd Symposium on Discrete Algorithms. 351--362","author":"Saks M.","key":"e_1_2_1_44_1","unstructured":"Saks , M. , Shavit , N. , and Woll , H . 1991. Optimal time randomized consensus---Making resilient algorithms fast in practice . In Proceedings of the 2nd Symposium on Discrete Algorithms. 351--362 .]] Saks, M., Shavit, N., and Woll, H. 1991. Optimal time randomized consensus---Making resilient algorithms fast in practice. In Proceedings of the 2nd Symposium on Discrete Algorithms. 351--362.]]"},{"volume-title":"Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG-8). 39--52","author":"Schiper A.","key":"e_1_2_1_45_1","unstructured":"Schiper , A. and Sandoz , A . 1994. Primary partition \"virtually-synchronous communication\" harder than consensus . In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG-8). 39--52 .]] Schiper, A. and Sandoz, A. 1994. Primary partition \"virtually-synchronous communication\" harder than consensus. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG-8). 39--52.]]"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Schneider F. B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 299--319.]] 10.1145\/98163.98167   Schneider F. B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 299--319.]] 10.1145\/98163.98167","DOI":"10.1145\/98163.98167"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Network.]]","author":"Skeen D.","year":"1982","unstructured":"Skeen , D. 1982 . A quorum-based commit protocol . In Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Network.]] Skeen, D. 1982. A quorum-based commit protocol. In Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Network.]]"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"volume-title":"Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).]]","author":"Venkataramani A.","key":"e_1_2_1_49_1","unstructured":"Venkataramani , A. , Kokku , R. , and Dahlin , M . 2002. TCP nice: A mechanism for background transfers . In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).]] Venkataramani, A., Kokku, R., and Dahlin, M. 2002. TCP nice: A mechanism for background transfers. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).]]"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 17th International Symposium on Distributed Computing (DISC).]]","author":"Yu H.","year":"2003","unstructured":"Yu , H. 2003 . Overcoming the majority barrier in large-scale systems . In Proceedings of the 17th International Symposium on Distributed Computing (DISC).]] Yu, H. 2003. Overcoming the majority barrier in large-scale systems. In Proceedings of the 17th International Symposium on Distributed Computing (DISC).]]"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP).]] 10","author":"Yu H.","year":"2034","unstructured":"Yu , H. and Vahdat , A . 2001. The costs and limits of availability for replicated services . In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP).]] 10 .1145\/50 2034 .502038 Yu, H. and Vahdat, A. 2001. The costs and limits of availability for replicated services. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP).]] 10.1145\/502034.502038"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1044956.1044958","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1044956.1044958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:05Z","timestamp":1750264265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1044956.1044958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["10.1145\/1044956.1044958"],"URL":"https:\/\/doi.org\/10.1145\/1044956.1044958","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2005,2]]},"assertion":[{"value":"2005-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}