On the uniformity of peer sampling based on view shuffling

Journal of Parallel and Distributed Computing

Volumn 71, Issue 8, 2011, Pages 1165-1176

  Busnel, Yann ^a,c   Beraldi, Roberto ^b   Baldoni, Roberto ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Gossip based protocol; Numerical evaluation; Peer sampling; Stochastic process; Theoretical analysis

Indexed keywords

GOSSIP-BASED PROTOCOL; NUMERICAL EVALUATIONS; PEER SAMPLING; STOCHASTIC PROCESS; THEORETICAL ANALYSIS;

COMPUTER SIMULATION; RANDOM PROCESSES;

CONVERGENCE OF NUMERICAL METHODS;

EID: 79958295538     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2011.01.009     Document Type: Article

References (24)

1. E. Anceaume, Y. Busnel, S. Gambs, Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes, in: The 14th International Conference on Principles of Distributed Systems, OPODIS 2010, Tozeur, Tunisia, 2010, pp. 115.
2. R. Bakhshi, D. Gavidia, W. Fokkink, and M. van Steen An analytical model of information dissemination for a gossip-based protocol Computer Networks 53 13 2009 2288 2303
3. A. Bakker, M. van Steen, Puppetcast: A secure peer sampling protocol, Computer Network Defense, European Conference on 0, 2008, 310. doi: http://doi.ieeecomputersociety.org/10.1109/EC2ND.2008.7.
4. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, S. Tucci-Piergiovanni, TERA: topic-based event routing for peer-to-peer architectures, in: The 2007 Inaugural International Conference on Distributed Event-Based Systems, DEBS '07, ACM, Toronto, Ontario, Canada, 2007, pp. 213. doi: http://doi.acm.org/10.1145/ 1266894.1266898. (Pubitemid 47281501)
5. R. Baldoni, A. Corsaro, L. Querzoni, S. Scipioni, and S.T. Piergiovanni Coupling-based internal clock synchronization for large-scale dynamic distributedsystems IEEE Transactions on Parallel and Distributed Systems 99 (RapidPosts) 2009 607 619 doi: http://doi.ieeecomputersociety.org/10.1109/TPDS. 2009.111
6. B. Bollobs Random Graphs 2nd ed. 2001 Cambridge University Press Cambridge, UK
7. E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, A. Shraer, Brahms: byzantine resilient random membership sampling, in: The 27th ACM Symposium on Principles of Distributed Computing, PODC '08, ACM, Toronto, Canada, 2008, pp. 145154. doi: http://doi.acm.org/10.1145/1400751.1400772.
8. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah Randomized gossip algorithms IEEE/ACM Transaction on Networks 14 SI 2006 2508 2530 doi: http://dx.doi.org/ 10.1109/TIT.2006.874516 (Pubitemid 43898906)
9. Y. Busnel, R. Beraldi, R. Baldoni, A formal characterization of uniform peer sampling based on view shuffling, in: The 10th International Conference on Parallel and Distributed Computing Applications and Technologies, IEEE Computer Society, Los Alamitos, CA, USA, 2009, pp. 360365. http://doi. ieeecomputersociety.org/10.1109/PDCAT.2009.61.
10. C. Cooper, M. Dyer, A.J. Handley, The flip markov chain and a randomising p2p protocol, in: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC '09, ACM, New York, NY, USA, 2009, pp. 141150. doi: http://doi.acm.org/10.1145/1582716.1582742.
11. E.W. Dijkstra Cooperating sequential processes F. Genuys, Programming Languages 1968 NATO Advanced Study Institute, Academic Press 43 112
12. P.T. Eugster, S. Handurukande, R. Guerraoui, A.-M. Kermarrec, and P. Kouznetsov Lightweight probabilistic broadcast ACM Transactions on Computer Systems 21 4 2003 341 374 doi: http://doi.acm.org/10.1145/945506.945507
13. M. Gurevich, I. Keidar, Correcness of gossip-based membership under message loss, in: The 28th annual ACM Symposium on Principles of Distributed Computing, PODC '09, ACM Press, Calgary, AL, Canada, 2009, pp. 151160.
14. M. Jelasity, A. Montresor, and O. Babaoglu T-Man: gossip-based fast overlay topology construction Computer Networks 53 13 2009 2321 2339
15. M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen Gossip-based peer sampling ACM Transaction on Computer System 25 3 2007 8
16. R. Karp, C. Schindelhauer, S. Shenker, B. Vocking, Randomized rumor spreading, in: The 41st Annual Symposium on Foundations of Computer Science, FOCS '00, IEEE Computer Society, Washington, DC, USA, 2000, pp. 565.
17. D. Kempe, A. Dobra, J. Gehrke, Gossip-based computation of aggregate information, in: The 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03, IEEE Press, Cambridge, MA, USA, 2003, pp. 482491.
18. V. King, J. Saia, Choosing a random peer, in: The 23rd Annual ACM symposium on Principles of Distributed Computing, PODC '04, ACM, New York, NY, USA, 2004, pp. 125130. doi: http://doi.acm.org/10.1145/1011767.1011786.
19. P. Mahlmann, C. Schindelhauer, Peer-to-peer networks based on random transformations of connected regular undirected graphs, in: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '05, ACM, New York, NY, USA, 2005, pp. 155164. doi: http://doi.acm.org/10. 1145/1073970.1073992. (Pubitemid 43206562)
20. P. Mahlmann, C. Schindelhauer, Distributed random digraph transformations for peer-to-peer networks, in: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '06, ACM, New York, NY, USA, 2006, pp. 308317. doi: http://doi.acm.org/10.1145/1148109. 1148162. (Pubitemid 44535662)
21. L. Massouli, E.L. Merrer, A.-M. Kermarrec, A. Ganesh, Peer counting and sampling in overlay networks: random walk methods, in: The 25th Annual ACM Symposium on Principles of Distributed Computing, PODC '06, ACM Press, Denver, CO, USA, 2006, pp. 123132. doi: http://doi.acm.org/10.1145/1146381.1146402. (Pubitemid 44393700)
22. I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan Chord: a scalable peer-to-peer lookup protocol for internet applications IEEE/ACM Transaction on Networks 11 1 2003 17 32 doi: http://dx.doi.org/10.1109/TNET.2002.808407
23. S. Voulgaris, D. Gavidia, and M. van Steen CYCLON: inexpensive membership management for unstructured p2p overlays Journal of Network System Management 13 2 2005 197 217
24. M. Zhong, K. Shen, J. Seiferas, Non-uniform random membership management in peer-to-peer networks, in: 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM '05, vol. 2, IEEE Press, Piscataway, NJ, USA, 2005, pp. 11511161 vol. 2. doi: 10.1109/INFCOM.2005.1498342. (Pubitemid 41390768)