{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:35Z","timestamp":1750307795514,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"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":[[2008,2]]},"abstract":"<jats:p>\n            The task of consistently and reliably replicating data is fundamental in distributed systems, and numerous existing protocols are able to achieve such replication efficiently. When called on to build a large-scale enterprise storage system with built-in replication, we were therefore surprised to discover that no existing protocols met our requirements. As a result, we designed and deployed a new replication protocol called\n            <jats:italic>Niobe<\/jats:italic>\n            . Niobe is in the primary-backup family of protocols, and shares many similarities with other protocols in this family. But we believe Niobe is significantly more\n            <jats:italic>practical<\/jats:italic>\n            for large-scale enterprise storage than previously published protocols. In particular, Niobe is simple, flexible, has rigorously proven yet simply stated consistency guarantees, and exhibits excellent performance. Niobe has been deployed as the backend for a commercial Internet service; its consistency properties have been proved formally from first principles, and further verified using the TLA + specification language. We describe the protocol itself, the system built to deploy it, and some of our experiences in doing so.\n          <\/jats:p>","DOI":"10.1145\/1326542.1326543","type":"journal-article","created":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T14:02:33Z","timestamp":1204207353000},"page":"1-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Niobe"],"prefix":"10.1145","volume":"3","author":[{"given":"John","family":"Maccormick","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandramohan A.","family":"Thekkath","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Jager","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristof","family":"Roomp","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Peterson","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,2,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Tech. Rep. 2003-241, Hewlett-Packard Laboratories.","author":"Aguilera M.","year":"2003","unstructured":"Aguilera , M. and Fr\u00f8lund , S . 2003 . Strict linearizability and the power of aborting. Tech. Rep. 2003-241, Hewlett-Packard Laboratories. Aguilera, M. and Fr\u00f8lund, S. 2003. Strict linearizability and the power of aborting. Tech. Rep. 2003-241, Hewlett-Packard Laboratories."},{"volume-title":"Proceedings of the 2nd International Conference on Software Engineering, 627--644","author":"Alsberg P.","key":"e_1_2_1_2_1","unstructured":"Alsberg , P. and Day , J . 1976. A principle for resilient sharing of distributed resources . In Proceedings of the 2nd International Conference on Software Engineering, 627--644 . Alsberg, P. and Day, J. 1976. A principle for resilient sharing of distributed resources. In Proceedings of the 2nd International Conference on Software Engineering, 627--644."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_2_1_4_1","unstructured":"Budhiraja N. Marzullo K. Schneider F. B. and Toueg S. 1993. The primary-backup approach. In Distributed Systems. ACM Press\/Addison-Wesley.   Budhiraja N. Marzullo K. Schneider F. B. and Toueg S. 1993. The primary-backup approach. In Distributed Systems. ACM Press\/Addison-Wesley."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298487"},{"volume-title":"Proceedings of the Conference on File and Storage Technologies (FAST).","author":"Chang F.","key":"e_1_2_1_6_1","unstructured":"Chang , F. , Ji , M. , Leung , S. , MacCormick , J. , Perl , S. , and Zhang , L . 2002. Myriad: Cost-Effective disaster tolerance . In Proceedings of the Conference on File and Storage Technologies (FAST). Chang, F., Ji, M., Leung, S., MacCormick, J., Perl, S., and Zhang, L. 2002. Myriad: Cost-Effective disaster tolerance. In Proceedings of the Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259424"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/74850.74870"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.10.003"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645475.654157"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/146941.146942"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/579617"},{"volume-title":"Proceedings of the International Conference on Dependable Systems and Networks (DSN), 307--314","author":"Lamport L.","key":"e_1_2_1_17_1","unstructured":"Lamport , L. and Massa , M . 2004. Cheap paxos . In Proceedings of the International Conference on Dependable Systems and Networks (DSN), 307--314 . Lamport, L. and Massa, M. 2004. Cheap paxos. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), 307--314."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237157"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121169"},{"volume-title":"Proceedings of the Symposium on Operating System Design and Implementation (OSDI).","author":"MacCormick J.","key":"e_1_2_1_20_1","unstructured":"MacCormick , J. , Murphy , N. , Najork , M. , Thekkath , C. A. , and Zhou , L . 2004. Boxwood: Abstractions as the foundation for storage infrastructure . In Proceedings of the Symposium on Operating System Design and Implementation (OSDI). MacCormick, J., Murphy, N., Najork, M., Thekkath, C. A., and Zhou, L. 2004. Boxwood: Abstractions as the foundation for storage infrastructure. In Proceedings of the Symposium on Operating System Design and Implementation (OSDI)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62549"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"volume-title":"Proceedings of the 3rd USENIX Workshop on Real, Large Distributed Systems (WORLDS).","author":"Perl S. E.","key":"e_1_2_1_23_1","unstructured":"Perl , S. E. and Seltzer , M . 2006. Data management for Internet-scale single-sign-on . In Proceedings of the 3rd USENIX Workshop on Real, Large Distributed Systems (WORLDS). Perl, S. E. and Seltzer, M. 2006. Data management for Internet-scale single-sign-on. In Proceedings of the 3rd USENIX Workshop on Real, Large Distributed Systems (WORLDS)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266711"},{"volume-title":"Proceedings of the 1st Latin American Web Congress (LA-WEB), Empowering Our Web. IEEE Computer Society, 132--143","author":"Risvik K. M.","key":"e_1_2_1_25_1","unstructured":"Risvik , K. M. , Aasheim , Y. , and Lidal , M . 2003. Multi-tier architecture for web search engines . In Proceedings of the 1st Latin American Web Congress (LA-WEB), Empowering Our Web. IEEE Computer Society, 132--143 . Risvik, K. M., Aasheim, Y., and Lidal, M. 2003. Multi-tier architecture for web search engines. In Proceedings of the 1st Latin American Web Congress (LA-WEB), Empowering Our Web. IEEE Computer Society, 132--143."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037947.1024400"},{"volume-title":"Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).","author":"van Renesse R.","key":"e_1_2_1_27_1","unstructured":"van Renesse , R. and Schneider , F. B . 2004. Chain replication for supporting high throughput and availability . In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI). van Renesse, R. and Schneider, F. B. 2004. Chain replication for supporting high throughput and availability. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI)."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1326542.1326543","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1326542.1326543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:25Z","timestamp":1750254985000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1326542.1326543"}},"subtitle":["A practical replication protocol"],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1145\/1326542.1326543"],"URL":"https:\/\/doi.org\/10.1145\/1326542.1326543","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2008,2]]},"assertion":[{"value":"2007-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}