Exploring the interdisciplinary connections of gossip-based systems

Abstract : 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.
Type de document :
Article dans une revue
SIGOPS Oper. Syst. Rev., ACM, 2007, 41 (5), pp.51--60. 〈10.1145/1317379.1317388〉
Liste complète des métadonnées

Contributeur : Erwan Le Merrer <>
Soumis le : vendredi 17 octobre 2008 - 10:54:16
Dernière modification le : jeudi 15 novembre 2018 - 11:57:35

Lien texte intégral



Erwan Le Merrer, Paolo Costa, Vincent Gramoli, Mark Jelasity, Gian Paolo Jesi, et al.. Exploring the interdisciplinary connections of gossip-based systems. SIGOPS Oper. Syst. Rev., ACM, 2007, 41 (5), pp.51--60. 〈10.1145/1317379.1317388〉. 〈inria-00331619〉



Consultations de la notice