{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:24Z","timestamp":1750307244772,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2012,2,16]]},"abstract":"<jats:p>We consider the problem of strongly consistent replication in a multi data center cloud setting. This environment is characterized by high latency communication between data centers, significant fluctuations in the performance of seemingly identical virtual machines (VMs) and temporary disconnects of data centers from the rest of the cloud. In this paper we introduce the adaptive and dynamic Funnel Replication (FR) protocol that is designed to achieve high throughout and low latency for reads, to accommodate arbitrary latency\/throughput tradeoffs for writes, to maximize performance in the face of VM performance variations and to provide high availability for read requests in the presence of network partitions. FR is based on the idea of flexible write dissemination topologies which enables it to achieve, per message, the desired tradeoff between latency and throughput, depending on the message size, the observed network conditions, and the importance of latency as indicated by the client. We demonstrate the benefits of flexible dissemination topologies and show that in a cloud setting with N identical replicas FR can improve the write latency up to a factor of N\/2 for N \u2265 2 compared to the notable chain replication (CR) protocol at the expense of a slight decrease in the write throughput. In a setting with potentially high variability in the performance of replicas, e.g., as in Amazon EC2, FR can achieve throughput up to a factor of 16 higher than CR while also improving the latency. FR does this by adopting a topology that consists of concurrent disjoint data replication paths so that load on high throughput paths is adaptively increased while load on congested replicas is reduced.<\/jats:p>","DOI":"10.1145\/2146382.2146390","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T18:42:36Z","timestamp":1329936156000},"page":"40-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive and dynamic funnel replication in clouds"],"prefix":"10.1145","volume":"46","author":[{"given":"Guy","family":"Laden","sequence":"first","affiliation":[{"name":"IBM Research Haifa, Israel"}]},{"given":"Roie","family":"Melamed","sequence":"additional","affiliation":[{"name":"IBM Research Haifa, Israel"}]},{"given":"Ymir","family":"Vigfusson","sequence":"additional","affiliation":[{"name":"School of CS, Reykjavik University"}]}],"member":"320","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Amazon EC2 Instance Types. http:\/\/aws.amazon.com\/ec2\/instance-types\/.  Amazon EC2 Instance Types. http:\/\/aws.amazon.com\/ec2\/instance-types\/."},{"key":"e_1_2_1_2_1","unstructured":"J. Baker C. Bond J. C. Corbett J. Furman A. Khorlin J. Larson J. M. Leon Y. Li A. Lloyd and V. Yushprakh. Megastore: Providing scalable highly available storage for interactive services. In CIDR 11.  J. Baker C. Bond J. C. Corbett J. Furman A. Khorlin J. Larson J. M. Leon Y. Li A. Lloyd and V. Yushprakh. Megastore: Providing scalable highly available storage for interactive services. In CIDR 11."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1730836.1730842"},{"volume-title":"Microsoft Research","year":"2010","author":"Birman K.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343502"},{"key":"e_1_2_1_6_1","unstructured":"M. Burrows. The chubby lock service for loosely-coupled distributed systems. In OSDI 06.   M. Burrows. The chubby lock service for loosely-coupled distributed systems. In OSDI 06."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_2_1_9_1","unstructured":"F. Chang J. Dean S. Ghemawat W. C. Hsieh D. A. Wallach M. Burrows T. Chandra A. Fikes and R. E. Gruber. Bigtable: A distributed storage system for structured data. In OSDI 06.   F. Chang J. Dean S. Ghemawat W. C. Hsieh D. A. Wallach M. Burrows T. Chandra A. Fikes and R. E. Gruber. Bigtable: A distributed storage system for structured data. In OSDI 06."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"volume-title":"WebApps '11","year":"2011","author":"Dejun J.","key":"e_1_2_1_11_1"},{"volume-title":"Tuesday","year":"2010","author":"Demirbas M.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","unstructured":"D. Dobre M. Majuntke and N. Suri. Contention-resistant fast paxos for wans. TR-TUDDEEDS-11-01-2006 Dept. of CS Technische Universit\u00e4t Darmstadt.  D. Dobre M. Majuntke and N. Suri. Contention-resistant fast paxos for wans. TR-TUDDEEDS-11-01-2006 Dept. of CS Technische Universit\u00e4t Darmstadt."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_15_1","unstructured":"P. Hunt M. Konar F. P. Junqueira and B. Reed. Zookeeper: wait-free coordination for internet-scale systems. In USENIXATC 10.   P. Hunt M. Konar F. P. Junqueira and B. Reed. Zookeeper: wait-free coordination for internet-scale systems. In USENIXATC 10."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/937598.937601"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687657"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0005-x"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667057"},{"volume-title":"OSDI'08","author":"Mao Y.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems -","volume":"3","author":"Perl S. E.","year":"2006"},{"volume-title":"USENIX","year":"2009","author":"Terrace J.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2172338.2172340"},{"volume-title":"OSDI","year":"2004","author":"van Renesse R.","key":"e_1_2_1_26_1"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2146382.2146390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:02Z","timestamp":1750243922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2,16]]}},"alternative-id":["10.1145\/2146382.2146390"],"URL":"https:\/\/doi.org\/10.1145\/2146382.2146390","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2012,2,16]]},"assertion":[{"value":"2012-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}