{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:15:44Z","timestamp":1773868544550,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T00:00:00Z","timestamp":1513641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00446-017-0322-2","type":"journal-article","created":{"date-parts":[[2017,12,19]],"date-time":"2017-12-19T11:50:37Z","timestamp":1513684237000},"page":"69-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scalable eventually consistent counters over unreliable networks"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7000-0485","authenticated-orcid":false,"given":"Paulo S\u00e9rgio","family":"Almeida","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3933-6850","authenticated-orcid":false,"given":"Carlos","family":"Baquero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,19]]},"reference":[{"key":"322_CR1","unstructured":"Asc\u00f3, A.: SyncFree: WP1 deliverable. In: Application and Environment Requirements. https:\/\/syncfree.lip6.fr\/attachments\/article\/46\/d1_1.pdf , (2015)"},{"issue":"5","key":"322_CR2","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM 41(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"key":"322_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Dolev, S., Welch, J.L.: Connection management without retaining information. In: Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, vol.\u00a02, pp. 622\u2013631. (1995)","DOI":"10.1109\/HICSS.1995.375494"},{"key":"322_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0020433","volume-title":"Distributed Algorithms","author":"H Attiya","year":"1994","unstructured":"Attiya, H., Rappoport, R.: The level of handshake required for establishing a connection. In: Tel, G., Vitnyi, P. (eds.) Distributed Algorithms. Lecture Notes in Computer Science, vol. 857, pp. 179\u2013193. Springer, Berlin Heidelberg (1994)"},{"key":"322_CR5","doi-asserted-by":"crossref","unstructured":"Brewer, E.A.: Towards robust distributed systems (abstract). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201900, p. 7, New York (2000)","DOI":"10.1145\/343477.343502"},{"issue":"5","key":"322_CR6","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TCOM.1974.1092259","volume":"22","author":"V Cerf","year":"1974","unstructured":"Cerf, V., Kahn, R.: A protocol for packet network intercommunication. IEEE Trans. Commun. 22(5), 637\u2013648 (1974)","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"322_CR7","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1002\/spe.2325","volume":"46","author":"S Chambi","year":"2016","unstructured":"Chambi, S., Lemire, D., Kaser, O., Godin, R.: Better bitmap performance with roaring bitmaps. Softw. Pract. Exp. 46(5), 709\u2013719 (2016)","journal-title":"Softw. Pract. Exp."},{"key":"322_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to lattices and order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to lattices and order. Cambridge University Press, Cambridge (2002)"},{"key":"322_CR9","doi-asserted-by":"crossref","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon\u2019s highly available key-value store. In: Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles, SOSP \u201907, pp. 205\u2013220, New York (2007)","DOI":"10.1145\/1294261.1294281"},{"key":"322_CR10","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201987, pp. 1\u201312, New York (1987)","DOI":"10.1145\/41840.41841"},{"issue":"5","key":"322_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/174147.169676","volume":"40","author":"A Fekete","year":"1993","unstructured":"Fekete, A., Lynch, N., Mansour, Y., Spinelli, J.: The impossibility of implementing reliable communication in the face of crashes. J. ACM 40(5), 1087\u20131107 (1993)","journal-title":"J. ACM"},{"issue":"2","key":"322_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"322_CR13","doi-asserted-by":"crossref","unstructured":"Goodman, J.R., Vernon, M.K., Woest, P.J.: Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In: Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-III, pp. 64\u201375, New York (1989)","DOI":"10.1145\/70082.68188"},{"key":"322_CR14","unstructured":"Goudarzi, A.: Cassandra-4775: Counters 2.0. https:\/\/issues.apache.org\/jira\/browse\/CASSANDRA-4775 , (2012)"},{"issue":"1","key":"322_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1132863.1132867","volume":"31","author":"J Gray","year":"2006","unstructured":"Gray, J., Lamport, L.: Consensus on transaction commit. ACM Trans. Database Syst. 31(1), 133\u2013160 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"322_CR16","unstructured":"Helland, P.: Life beyond distributed transactions: an apostate\u2019s opinion. In: CIDR, pp. 132\u2013141. www.cidrdb.org , (2007)"},{"issue":"4","key":"322_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1145\/210223.210225","volume":"13","author":"M Herlihy","year":"1995","unstructured":"Herlihy, M., Lim, B.-H., Shavit, N.: Scalable concurrent counting. ACM Trans. Comput. Syst. 13(4), 343\u2013364 (1995)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"322_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"Maurice P Herlihy","year":"1990","unstructured":"Herlihy, Maurice P., Wing, Jeannette M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"322_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1049\/ip-com:20050335","volume":"153","author":"J Hernandez","year":"2006","unstructured":"Hernandez, J., Phillips, I.: Weibull mixture model to characterise end-to-end Internet delay at coarse time-scales. IEE Proc. Commun. 153(2), 295\u2013304 (2006)","journal-title":"IEE Proc. Commun."},{"key":"322_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jpdc.2015.02.003","volume":"78","author":"P Jesus","year":"2015","unstructured":"Jesus, P., Baquero, C., Almeida, P.S.: Flow updating: fault-tolerant aggrega-tion for dynamic networks. J. Parallel Distrib. Comput. 78, 53\u201364 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"322_CR21","doi-asserted-by":"crossref","unstructured":"Klophaus, R.: Riak core: building distributed applications without shared state. In: ACM SIGPLAN Commercial Users of Functional Programming, CUFP \u201910, p. 14:1, New York (2010)","DOI":"10.1145\/1900160.1900176"},{"issue":"2","key":"322_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"322_CR23","unstructured":"Lebresne, S.: Cassandra-2495: add a proper retry mechanism for counters in case of failed request. https:\/\/issues.apache.org\/jira\/browse\/CASSANDRA-2495 , (2011)"},{"key":"322_CR24","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201987, pp. 137\u2013151, New York (1987)","DOI":"10.1145\/41840.41852"},{"issue":"3","key":"322_CR25","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/TSE.1983.236733","volume":"9","author":"DS Parker Jr","year":"1983","unstructured":"Parker Jr., D.S., Popek, G.J., Rudisin, G., Stoughton, A., Walker, B.J., Walton, E., Chow, J.M., Edwards, D., Kiser, S., Kline, C.: Detection of mutual inconsistency in distributed systems. IEEE Trans. Softw. Eng. 9(3), 240\u2013247 (1983)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"322_CR26","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: A comprehensive study of convergent and commutative replicated data types. In: Rapport de recherche 7506, Institut Nat. de la Recherche en Informatique et Automatique (INRIA), Rocquencourt, France, (2011)"},{"key":"322_CR27","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: Proceedings of the 13th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS\u201911, pp. 386\u2013400. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24550-3_29"},{"issue":"4","key":"322_CR28","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/235543.235546","volume":"14","author":"N Shavit","year":"1996","unstructured":"Shavit, N., Zemach, A.: Diffracting trees. ACM Trans. Comput. Syst. 14(4), 385\u2013428 (1996)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"7","key":"322_CR29","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TC.1984.5009333","volume":"33","author":"HS Stone","year":"1984","unstructured":"Stone, H.S.: Database applications of the fetch-and-add instruction. IEEE Trans. Comput. 33(7), 604\u2013612 (1984)","journal-title":"IEEE Trans. Comput."},{"key":"322_CR30","doi-asserted-by":"crossref","unstructured":"Terry, D.B., Demers, A.J., Petersen, K., Spreitzer, M., Theimer, M., Welch, B.W.: Session guarantees for weakly consistent replicated data. In: IEEE Computer Society and Proceedings of the Third International Conference on Parallel and Distributed Information Systems, PDIS \u201994, pp. 140\u2013149, Washington (1994)","DOI":"10.1109\/PDIS.1994.331722"},{"issue":"1","key":"322_CR31","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1435417.1435432","volume":"52","author":"W Vogels","year":"2009","unstructured":"Vogels, W.: Eventually consistent. Commun. ACM 52(1), 40\u201344 (2009)","journal-title":"Commun. ACM"},{"issue":"4","key":"322_CR32","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0743-7315(03)00114-X","volume":"64","author":"R Wattenhofer","year":"2004","unstructured":"Wattenhofer, R., Widmayer, P.: The counting pyramid: an adaptive distributed counting scheme. J. Parallel Distrib. Comput. 64(4), 449\u2013460 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"322_CR33","first-page":"388","volume":"36","author":"P-C Yew","year":"1987","unstructured":"Yew, P.-C., Tzeng, N.-F., Lawrie, D.H.: Distributing hot-spot addressing in large-scale multiprocessors. IEEE Trans. Comput. 36(4), 388\u2013395 (1987)","journal-title":"IEEE Trans. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-017-0322-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0322-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0322-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T03:47:44Z","timestamp":1570506464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-017-0322-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s00446-017-0322-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,19]]},"assertion":[{"value":"5 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}