{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:53Z","timestamp":1750307753136,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"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":[[2007,10]]},"abstract":"<jats:p>In recent years the labels \"gossip\" and \"gossip-based\" have been applied to an increasingly general class of algorithms, including approaches to information aggregation, overlay network management and clock synchronization. These algorithms are intuitively similar, irrespective of their purpose. Their distinctive features include relying on local information, being round-based and relatively simple, and having a bounded information transmission and processing complexity in each round. Our position is that this class can and should be significantly extended to involve algorithms from other disciplines that share the same or similar distinctive features, like certain parallel numerical algorithms, routing protocols, bio-inspired algorithms and cellular automata, to name but a few. Such a broader perspective would allow us to import knowledge and tools to design and understand gossip-based distributed systems, and we could also export accumulated knowledge to re-interpret some of the problems in other disciplines, such as vehicular traffic control. In this position paper we describe a number of areas that show parallels with gossip protocols. These example areas will hopefully serve as inspiration for future research. In addition, we believe that comparisons with other fields also helps clarify the definition of gossip protocols and represents a necessary first step towards an eventual formal definition.<\/jats:p>","DOI":"10.1145\/1317379.1317388","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T15:57:07Z","timestamp":1195228627000},"page":"51-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Exploring the interdisciplinary connections of gossip-based systems"],"prefix":"10.1145","volume":"41","author":[{"given":"Paolo","family":"Costa","sequence":"first","affiliation":[{"name":"Vrije Universiteit, Amsterdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[{"name":"INRIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rk","family":"Jelasity","sequence":"additional","affiliation":[{"name":"University of Szeged and HAS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian Paolo","family":"Jesi","sequence":"additional","affiliation":[{"name":"University of Bologna"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwan","family":"Le Merrer","sequence":"additional","affiliation":[{"name":"FTR&amp;D\/IRISA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[{"name":"University of Trento"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"Querzoni","sequence":"additional","affiliation":[{"name":"University of Rome \"La Sapienza\""}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"BMW Connected Drive July 2004. http:\/\/www.connected-drive.de.  BMW Connected Drive July 2004. http:\/\/www.connected-drive.de."},{"key":"e_1_2_1_2_1","volume-title":"The Evolution of Cooperation. Basic books","author":"Axelrod R.","year":"1984","unstructured":"R. Axelrod . The Evolution of Cooperation. Basic books , New York, US , 1984 . R. Axelrod. The Evolution of Cooperation. Basic books, New York, US, 1984."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2007.25"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719581","volume-title":"Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide","author":"Bai Z.","year":"2000","unstructured":"Z. Bai , J. Demmel , J. Dongarra , A. Ruhe , and H. van der Vorst , editors. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide . SIAM , Philadelphia , 2000 . Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, editors. Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide. SIAM, Philadelphia, 2000."},{"key":"e_1_2_1_5_1","volume-title":"MidLab 2\/07 -- Universit\u00e0 degli Studi di Roma \"La Sapienza\"","author":"Baldoni R.","year":"2007","unstructured":"R. Baldoni , A. Corsaro , L. Querzoni , S. Scipioni , and S. Tucci-Piergiovanni . An adaptive coupling-based algorithm for internal clock synchronization of large scale dynamic systems. Technical report , MidLab 2\/07 -- Universit\u00e0 degli Studi di Roma \"La Sapienza\" , 2007 . R. Baldoni, A. Corsaro, L. Querzoni, S. Scipioni, and S. Tucci-Piergiovanni. An adaptive coupling-based algorithm for internal clock synchronization of large scale dynamic systems. Technical report, MidLab 2\/07 -- Universit\u00e0 degli Studi di Roma \"La Sapienza\", 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2005.06.004"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.59.3876"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the Learning and Intelligent Optimization Workshop (LION 2007","author":"Brunato M.","year":"2007","unstructured":"M. Brunato , R. Battiti , and A. Montresor . GOSH! Gossiping Optimization Search Heuristics . In Proceedings of the Learning and Intelligent Optimization Workshop (LION 2007 ), Andalo, Italy , 2007 . M. Brunato, R. Battiti, and A. Montresor. GOSH! Gossiping Optimization Search Heuristics. In Proceedings of the Learning and Intelligent Optimization Workshop (LION 2007), Andalo, Italy, 2007."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018940026670"},{"key":"e_1_2_1_10_1","volume-title":"AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317--365","author":"Caro G. D.","year":"1998","unstructured":"G. D. Caro and M. Dorigo . AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317--365 , 1998 . G. D. Caro and M. Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research (JAIR), 9:317--365, 1998."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems","author":"Cohen B.","year":"2003","unstructured":"B. Cohen . Incentives Build Robustness in BitTorrent . In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems , Berkeley, CA, USA , 2003 . B. Cohen. Incentives Build Robustness in BitTorrent. In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA, 2003."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645825.669098"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01417909"},{"issue":"4","key":"e_1_2_1_15_1","volume":"15","author":"Caro G. Di","year":"2005","unstructured":"G. Di Caro , F. Ducatelle , and L. Gambardella . AntHocNet: An Adaptive Nature-inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications , 15 ( 4 ), 2005 . G. Di Caro, F. Ducatelle, and L. Gambardella. AntHocNet: An Adaptive Nature-inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications, 15(4), 2005.","journal-title":"European Transactions on Telecommunications"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_2_1_17_1","first-page":"11","volume-title":"New Ideas in Optimization","author":"Dorigo M.","year":"1999","unstructured":"M. Dorigo and G. D. Caro . New Ideas in Optimization , chapter The Ant Colony Optimization metaheuristic, pages 11 -- 32 . McGraw Hill , London, UK , 1999 . M. Dorigo and G. D. Caro. New Ideas in Optimization, chapter The Ant Colony Optimization metaheuristic, pages 11--32. McGraw Hill, London, UK, 1999."},{"key":"e_1_2_1_18_1","volume-title":"EPFL","author":"Felegyhazi M.","year":"2006","unstructured":"M. Felegyhazi and J. P. Hubaux . Game theory in wireless networks: A tutorial. Technical report , EPFL , 2006 . M. Felegyhazi and J. P. Hubaux. Game theory in wireless networks: A tutorial. Technical report, EPFL, 2006."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.102"},{"key":"e_1_2_1_20_1","unstructured":"A. Festag H. Fu\u00dfler H. Hartenstein A. Sarma and R. Schmitz. FLEETNET: Bringing car-to-car communication into the real world. Computer 4(L15):16.  A. Festag H. Fu\u00dfler H. Hartenstein A. Sarma and R. Schmitz. FLEETNET: Bringing car-to-car communication into the real world. Computer 4(L15):16."},{"key":"e_1_2_1_21_1","volume-title":"Chaos, Complex Systems, and Adaptation","author":"Flake G. W.","year":"2000","unstructured":"G. W. Flake . The Computational Beauty of Nature: Computer Explorations of Fractals , Chaos, Complex Systems, and Adaptation . The MIT Press , 2000 . G. W. Flake. The Computational Beauty of Nature: Computer Explorations of Fractals, Chaos, Complex Systems, and Adaptation. The MIT Press, 2000."},{"key":"e_1_2_1_22_1","volume-title":"du Palais de la decouverte","author":"Grass\u00e9 P. P.","year":"1946","unstructured":"P. P. Grass\u00e9 . Les Insectes Dans Leur Univers. Ed. du Palais de la decouverte , Paris, France , 1946 . P. P. Grass\u00e9. Les Insectes Dans Leur Univers. Ed. du Palais de la decouverte, Paris, France, 1946."},{"key":"e_1_2_1_23_1","volume-title":"rfc 1058","author":"N. W. Group","year":"1988","unstructured":"N. W. Group . Routing information protocol. rfc 1058 , 1988 . N. W. Group. Routing information protocol. rfc 1058, 1988."},{"key":"e_1_2_1_24_1","volume-title":"Rip version 2. rfc 2453","author":"N. W. Group","year":"1998","unstructured":"N. W. Group . Rip version 2. rfc 2453 , 1998 . N. W. Group. Rip version 2. rfc 2453, 1998."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-006-7291-4"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876186"},{"key":"e_1_2_1_27_1","first-page":"63","volume-title":"In Proceedings of ANTS2000: From Ant Colonies to Artificial Ants","author":"Hadji R.","year":"2000","unstructured":"R. Hadji , M. Rahoual , E. Talbi , and V. Bachelet . Ant colonies for the set covering problem . In In Proceedings of ANTS2000: From Ant Colonies to Artificial Ants , pages 63 -- 66 , Bruxelles , 2000 . R. Hadji, M. Rahoual, E. Talbi, and V. Bachelet. Ant colonies for the set covering problem. In In Proceedings of ANTS2000: From Ant Colonies to Artificial Ants, pages 63--66, Bruxelles, 2000."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2006.35"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806739"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767886_3"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11734697_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1045658.1045666"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217937"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946317"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing","author":"Lamport L.","year":"1984","unstructured":"L. Lamport . Solved problems , unsolved problems and nonproblems in concurrency . In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing , Aug. 1984 . L. Lamport. Solved problems, unsolved problems and nonproblems in concurrency. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Aug. 1984."},{"key":"e_1_2_1_37_1","volume-title":"The Travelling Salesman Problem","author":"Lawler E. L.","year":"1985","unstructured":"E. L. Lawler , J. K. Lenstra , A. H. G. R. Kan , and D. B. Shmoys . The Travelling Salesman Problem . John Wiley & Sons , Chichester, UK , 1985 . E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys. The Travelling Salesman Problem. John Wiley & Sons, Chichester, UK, 1985."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4801"},{"key":"e_1_2_1_39_1","volume-title":"Conway's game of life project. 5","author":"Matthews J.","year":"2000","unstructured":"J. Matthews . Conway's game of life project. 5 2000 . J. Matthews. Conway's game of life project. 5 2000."},{"key":"e_1_2_1_40_1","unstructured":"D. L. Mills. Network time protocol (version 1) specification and implementation.   D. L. Mills. Network time protocol (version 1) specification and implementation."},{"key":"e_1_2_1_41_1","volume-title":"Self-reproduction in asynchronous cellular automata. eh, 00:201","author":"Nehaniv C. L.","year":"2002","unstructured":"C. L. Nehaniv . Self-reproduction in asynchronous cellular automata. eh, 00:201 , 2002 . C. L. Nehaniv. Self-reproduction in asynchronous cellular automata. eh, 00:201, 2002."},{"key":"e_1_2_1_42_1","volume-title":"The pagerank citation ranking: Bringing order to the web. Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web. Technical report , Stanford Digital Library Technologies Project , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/151254.151256"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28876"},{"key":"e_1_2_1_45_1","first-page":"163","volume-title":"Evolutionary Algorithms in Engineering and Computer Science","author":"St\u00fctzle T.","year":"1999","unstructured":"T. St\u00fctzle and M. Dorigo . Evolutionary Algorithms in Engineering and Computer Science , chapter ACO algorithms for the traveling salesman problem, pages 163 -- 183 . John Wiley & Sons , Chichester, UK , 1999 . T. St\u00fctzle and M. Dorigo. Evolutionary Algorithms in Engineering and Computer Science, chapter ACO algorithms for the traveling salesman problem, pages 163--183. John Wiley & Sons, Chichester, UK, 1999."},{"key":"e_1_2_1_46_1","first-page":"832","volume-title":"Proc. Fifteenth International Joint Conference on Artificial Intelligence (IJCAI97)","author":"Subramanian D.","year":"1997","unstructured":"D. Subramanian , P. Druschel , and J. Chen . Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks . In Proc. Fifteenth International Joint Conference on Artificial Intelligence (IJCAI97) , pages 832 -- 839 , Nagoya, Japan , 1997 . D. Subramanian, P. Druschel, and J. Chen. Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks. In Proc. Fifteenth International Joint Conference on Artificial Intelligence (IJCAI97), pages 832--839, Nagoya, Japan, 1997."},{"key":"e_1_2_1_47_1","volume-title":"Nov. 17","author":"Sumner R.","year":"1992","unstructured":"R. Sumner . In-vehicle traffic congestion information system , Nov. 17 1992 . US Patent 5,164,904. R. Sumner. In-vehicle traffic congestion information system, Nov. 17 1992. US Patent 5,164,904."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762485"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_125"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317379.1317388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1317379.1317388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:17Z","timestamp":1750253957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317379.1317388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["10.1145\/1317379.1317388"],"URL":"https:\/\/doi.org\/10.1145\/1317379.1317388","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2007,10]]},"assertion":[{"value":"2007-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}