{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T12:24:51Z","timestamp":1778847891409,"version":"3.51.4"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009,1]]},"abstract":"<jats:p>\n            Kinesis is a novel data placement model for distributed storage systems. It exemplifies three design principles:\n            <jats:italic>structure<\/jats:italic>\n            (division of servers into a few failure-isolated segments),\n            <jats:italic>freedom of choice<\/jats:italic>\n            (freedom to allocate the best servers to store and retrieve data based on current resource availability), and\n            <jats:italic>scattered distribution<\/jats:italic>\n            (independent, pseudo-random spread of replicas in the system). These design principles enable storage systems to achieve balanced utilization of storage and network resources in the presence of incremental system expansions, failures of single and shared components, and skewed distributions of data size and popularity. In turn, this ability leads to significantly reduced resource provisioning costs, good user-perceived response times, and fast, parallelized recovery from independent and correlated failures.\n          <\/jats:p>\n          <jats:p>This article validates Kinesis through theoretical analysis, simulations, and experiments on a prototype implementation. Evaluations driven by real-world traces show that Kinesis can significantly outperform the widely used Chain replica-placement strategy in terms of resource requirements, end-to-end delay, and failure recovery.<\/jats:p>","DOI":"10.1145\/1480439.1480440","type":"journal-article","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T16:42:19Z","timestamp":1234284139000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Kinesis"],"prefix":"10.1145","volume":"4","author":[{"given":"John","family":"MacCormick","sequence":"first","affiliation":[{"name":"Dickinson College, Carlisle, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Murphy","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venugopalan","family":"Ramasubramanian","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfeng","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Zhou","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335411"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS).","author":"Byers J.","unstructured":"Byers , J. , Considine , J. , and Mitzenmacher , M . 2003. Simple load balancing for distributed hash tables . In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS). Byers, J., Considine, J., and Mitzenmacher, M. 2003. Simple load balancing for distributed hash tables. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Czumaj A. Riley C. and Scheideler C. 2003. Perfectly balanced allocation.  Czumaj A. Riley C. and Scheideler C. 2003. Perfectly balanced allocation.","DOI":"10.1007\/978-3-540-45198-3_21"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM).","author":"Godfrey B.","unstructured":"Godfrey , B. , Lakshminarayanan , K. , Surana , S. , Karp , R. , and Stoica , I . 2004. Load balancing in dynamic structured p2p systems . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., and Stoica, I. 2004. Load balancing in dynamic structured p2p systems. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645475.654157"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Windows Systems Symposium.","author":"Ji M.","unstructured":"Ji , M. , Felten , E. W. , Wang , R. , and Singh , J. P . 2000. Archipelago: An island-based file system for highly available and scalable internet services . In Proceedings of the Windows Systems Symposium. Ji, M., Felten, E. W., Wang, R., and Singh, J. P. 2000. Archipelago: An island-based file system for highly available and scalable internet services. In Proceedings of the Windows Systems Symposium."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237157"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the Intlernational Conference on Very Large Data Bases (VLDB).","author":"Litwin W.","year":"1980","unstructured":"Litwin , W. 1980 . Linear hashing: A new tool for file and table addressing . In Proceedings of the Intlernational Conference on Very Large Data Bases (VLDB). Litwin, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the Intlernational Conference on Very Large Data Bases (VLDB)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024399"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI).","author":"MacCormick J.","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 ACM\/USENIX Symposium on Operating Systems 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 ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291048"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST).","author":"Quinlan S.","unstructured":"Quinlan , S. and Dorward , S . 2002. Venti: A new approach to archival storage . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST). Quinlan, S. and Dorward, S. 2002. Venti: A new approach to archival storage. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0987-0"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250829"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI).","author":"van Renesse R.","unstructured":"van Renesse , R. and Schneider , F. B . 2004. Chain replication for supporting high throughput and availability . In Proceedings of the ACM\/USENIX 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 ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796480"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI).","author":"Weil S. A.","unstructured":"Weil , S. A. , Brandt , S. A. , Miller , E. L. , Long , D. D. E. , and Maltzahn , C . 2006. Ceph: A scalable, high-performance distributed file system . In Proceedings of the ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI). Weil, S. A., Brandt, S. A., Miller, E. L., Long, D. D. E., and Maltzahn, C. 2006. Ceph: A scalable, high-performance distributed file system. In Proceedings of the ACM\/USENIX Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188582"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248407"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480439.1480440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1480439.1480440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:59Z","timestamp":1750253399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480439.1480440"}},"subtitle":["A new approach to replica placement in distributed storage systems"],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1145\/1480439.1480440"],"URL":"https:\/\/doi.org\/10.1145\/1480439.1480440","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]},"assertion":[{"value":"2008-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}