Converging Quickly to Independent Uniform Random Topologies

Abstract : The peer sampling service is a core building block for gossip protocols in peer-to-peer networks. Ideally, a peer sampling service continuously provides each peer with a sample of peers picked uniformly at random in the network. While empirical studies have shown that uniformity was achieved, analysis proposed so far assume strong restrictions on the topology of the overlay network it continuously generates. In this work, we analyze a Generic Random Peer Sampling Service (GRPS) that satisfies the desirable properties for any peer sampling service –small views, uniform sample, load balancing, and independence– and relieve strong degree connections in the nodes assumed in previous works. The main result we prove is: starting from any simple (without loops and parallel edges) directed graph with out-degree equal to c for all nodes, and recursively applying GRPS, eventually results in a random simple directed graph with out-degree equal to c for all nodes. We test empirically convergence time and independence time for GRPS. Finally, We use this empirical evaluation to show that GRPS performs better than previously presented peer sampling services.
Type de document :
Communication dans un congrès
19th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP), 2011., Feb 2011, Ayia Napa, Cyprus. 2011
Liste complète des métadonnées

https://hal.inria.fr/inria-00543249
Contributeur : Chrsitopher Thraves Caro <>
Soumis le : lundi 6 décembre 2010 - 11:12:34
Dernière modification le : mercredi 16 mai 2018 - 11:23:13

Identifiants

  • HAL Id : inria-00543249, version 1

Citation

Anne-Marie Kermarrec, Vincent Leroy, Christopher Thraves-Caro. Converging Quickly to Independent Uniform Random Topologies. 19th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP), 2011., Feb 2011, Ayia Napa, Cyprus. 2011. 〈inria-00543249〉

Partager

Métriques

Consultations de la notice

136