Bridging the Gap between Population and Gossip-based Protocols

Yann Busnel (1) , Marin Bertier (1) , Anne-Marie Kermarrec (1)

1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems

Gossip-based protocols are simple, robust and scalable and have been consistently applied in many distributed, mostly wired, settings. Most validation in this area has been so far empirical and there is a clear lack of a theoretical counterpart clearly defining what can and cannot be computed with gossip-based protocols. Population protocols, on the other hand, provide a clear and formal model for mobile sensor networks, capturing their power and limitations. In this paper, we establish a correlation between population and gossip-based protocols. Studying the equivalence between them, we propose a classification of gossip-based protocols, based on the nature of the underlying peer sampling service. First, we show that the class of gossip protocols, where each node relies on an arbitrary sample, is equivalent to population protocols. Second, we show that gossip-based protocols, relying on a more powerful peer sampling providing peers using a clearly identified set of other peers, are equivalent to community protocols, a variant of population protocols. Leveraging the resemblances between these areas enables to provide a theoretical framework for distributed systems where global behaviours emerge from a set of local interactions, both in wired and wireless settings. Likewise, the practical validations of gossip-protocols provide empirical evidence of quick convergence times of such algorithms and demonstrate their practical relevance. While existing results in each area can be immediately applied, this also leaves the space to transfer any new results, practical or theoretical, from one domain to the other. As an application of this possibility, we also propose a new result in the area of population protocols and show that a uniform distribution of interactions is optimal for population and community protocols with respect to convergence time. Consequently, we can conclude that the gossip-based random peer sampling service provides such an optimal sampling for gossip-based protocols, corroborating practical evidences.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Yann Busnel, Marin Bertier, Anne-Marie Kermarrec. Bridging the Gap between Population and Gossip-based Protocols. [Research Report] RR-6720, INRIA. 2008, pp.26. ⟨inria-00338098⟩