{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:13:33Z","timestamp":1762506813211,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395180"},{"type":"electronic","value":"9783319395197"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39519-7_12","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T13:18:53Z","timestamp":1464095933000},"page":"192-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Improving Gossip Dynamics Through Overlapping Replicates"],"prefix":"10.1007","author":[{"given":"Danilo","family":"Pianini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Beal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirko","family":"Viroli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"12_CR1","unstructured":"Beal, J.: Accelerating approximate consensus with self-organizing overlays. In: Spatial Computing Workshop, May 2013"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2700322","volume":"10","author":"J Beal","year":"2015","unstructured":"Beal, J.: Superdiffusive dispersion and mixing of swarms. ACM Trans. Auton. Adapt. Syst. 10(2), 1\u201324 (2015)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"9","key":"12_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MC.2015.261","volume":"48","author":"J Beal","year":"2015","unstructured":"Beal, J., Pianini, D., Viroli, M.: Aggregate programming for the internet of things. IEEE Comput. 48(9), 22\u201330 (2015)","journal-title":"IEEE Comput."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Beal, J., Viroli, M.: Building blocks for aggregate programming of self-organising applications. In: IEEE SASO Workshops, pp. 8\u201313 (2014)","DOI":"10.1109\/SASOW.2014.6"},{"issue":"5","key":"12_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1317379.1317382","volume":"41","author":"K Birman","year":"2007","unstructured":"Birman, K.: The promise, and limitations, of gossip protocols. ACM SIGOPS Oper. Syst. Rev. 41(5), 8\u201313 (2007)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live: an engineering perspective. In: Principles of Distributed Computing, pp. 398\u2013407 (2007)","DOI":"10.1145\/1281100.1281103"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.scico.2015.11.005","volume":"117","author":"F Damiani","year":"2016","unstructured":"Damiani, F., Viroli, M., Beal, J.: A type-sound calculus of computational fields. Sci. Comput. Program. 117, 17\u201344 (2016)","journal-title":"Sci. Comput. Program."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-19195-9_8","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"F Damiani","year":"2015","unstructured":"Damiani, F., Viroli, M., Pianini, D., Beal, J.: Code mobility meets self-organisation: a higher-order calculus of computational fields. In: Graf, S., Viswanathan, M. (eds.) Formal Techniques for Distributed Objects, Components, and Systems. LNCS, vol. 9039, pp. 113\u2013128. Springer, Heidelberg (2015)"},{"key":"12_CR9","unstructured":"Elhage, N., Beal, J.: Laplacian-based consensus on spatial computers. In: International Conference on Autonomous Agents and Multiagent Systems, pp. 907\u2013914 (2010)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I Gupta","year":"2003","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) Peer-to-Peer Systems II. LNCS, vol. 2735, pp. 160\u2013169. Springer, Heidelberg (2003)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. (TOCS) 23(3), 219\u2013252 (2005)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"13","key":"12_CR13","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1016\/j.comnet.2009.03.013","volume":"53","author":"M Jelasity","year":"2009","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: T-man: gossip-based fast overlay topology construction. Comput. Netw. 53(13), 2321\u20132339 (2009)","journal-title":"Comput. Netw."},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"12_CR15","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"7","key":"12_CR16","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1109\/TIT.2008.924648","volume":"54","author":"D Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Trans. Inf. Theor. 54(7), 2997\u20133007 (2008)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215\u2013233 (2007)","journal-title":"Proc. IEEE"},{"key":"12_CR18","first-page":"395","volume":"7","author":"RJ Perlman","year":"1983","unstructured":"Perlman, R.J.: Fault-tolerant broadcast of routing information. Comput. Netw. 7, 395\u2013405 (1983). \n                    http:\/\/dx.org\/10.1016\/0376-5075(83)90034-X","journal-title":"Comput. Netw."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1057\/jos.2012.27","volume":"7","author":"D Pianini","year":"2013","unstructured":"Pianini, D., Montagna, S., Viroli, M.: Chemical-oriented simulation of computational systems with ALCHEMIST. J. Simul. 7(3), 202\u2013215 (2013)","journal-title":"J. Simul."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Pianini, D., Viroli, M., Beal, J.: Protelis: practical aggregate programming. In: ACM Symposium on Applied Computing, pp. 1846\u20131853 (2015)","DOI":"10.1145\/2695664.2695913"},{"key":"12_CR21","volume-title":"Gossip Algorithms","author":"D Shah","year":"2009","unstructured":"Shah, D.: Gossip Algorithms. Now Publishers Inc, Norwell (2009)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Viroli, M., Beal, J., Damiani, F., Pianini, D.: Efficient engineering of complex self-organising systems by self-stabilising fields. In: IEEE SASO, pp. 81\u201390 (2015)","DOI":"10.1109\/SASO.2015.16"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-39671-0_5","volume-title":"Self-Managing Distributed Systems","author":"S Voulgaris","year":"2003","unstructured":"Voulgaris, S., van Steen, M.: An epidemic protocol for managing routing tables in very large peer-to-peer networks. In: Brunner, M., Keller, A. (eds.) DSOM 2003. LNCS, vol. 2867, pp. 41\u201354. Springer, Heidelberg (2003)"},{"issue":"8","key":"12_CR24","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MC.2012.280","volume":"45","author":"F Zambonelli","year":"2012","unstructured":"Zambonelli, F.: Toward sociotechnical urban superorganisms. IEEE Comput. 45(8), 76\u201378 (2012)","journal-title":"IEEE Comput."}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39519-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T00:08:34Z","timestamp":1590192514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39519-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395180","9783319395197"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39519-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}