. Gnutella, the gnutella protocol specification v

A. Allavena, A. Demers, and J. E. Hopcroft, Correctness of a gossip based membership protocol, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.292-301, 2005.
DOI : 10.1145/1073814.1073871

O. Beaumont, P. Duchon, and M. Korzeniowski, Heterogenous dating service with application to rumor spreading, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-10, 2008.
DOI : 10.1109/IPDPS.2008.4536294
URL : https://hal.archives-ouvertes.fr/inria-00142778

M. Sherif, S. R. Botros, and . Waterhouse, Search in JXTA and other distributed networks, Proc. of P2P '01, pp.30-35, 2001.

C. Cooper, M. Dyer, and A. J. Handley, The flip markov chain and a randomising P2P protocol, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.141-150, 2009.
DOI : 10.1145/1582716.1582742

C. Cooper, M. E. Dyer, and C. S. Greenhill, Sampling Regular Graphs and a Peer-to-Peer Network, Combinatorics, Probability and Computing, vol.16, issue.04, pp.557-593, 2007.
DOI : 10.1017/S0963548306007978

C. Cooper, R. Klasing, and T. Radzik, A randomized algorithm for the joining protocol in dynamic distributed networks, Theoretical Computer Science, vol.406, issue.3, pp.248-262, 2008.
DOI : 10.1016/j.tcs.2008.06.049
URL : https://hal.archives-ouvertes.fr/inria-00070627

A. Czumaj and M. Kutylowski, Delayed path coupling and generating random permutations. Random Struct, Algorithms, vol.17, issue.3-4, pp.238-259, 2000.
DOI : 10.1002/1098-2418(200010/12)17:3/4<238::aid-rsa4>3.0.co;2-e

A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson et al., Epidemic algorithms for replicated database maintenance, Proc. of ACM PODC '87, pp.1-12, 1987.

R. Elsässer and T. Sauerwald, On the runtime and robustness of randomized broadcasting, Proc. of ISAAC '06, pp.349-358, 2006.

T. Feder, A. Guetz, M. Mihail, and A. Saberi, A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.69-76, 2006.
DOI : 10.1109/FOCS.2006.5

J. Ayalvadi, A. Ganesh, L. Kermarrec, and . Massoulié, Peer-to-peer membership management for gossip-based protocols, IEEE Transactions on Computers, vol.52, issue.2, pp.139-149, 2003.

M. Gurevich and I. Keidar, Correctness of gossip-based membership under message loss, Proc. of ACM PODC '09, pp.151-160, 2009.

K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed Object Location in a Dynamic Network, Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.41-52, 2002.

S. Jagannathan, G. Pandurangan, and S. Srinivasan, Query protocols for highly resilient peer-to-peer networks, Proc. of ISCA PDCS '06, pp.247-252, 2006.

R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, Randomized rumor spreading, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.565-574, 2000.
DOI : 10.1109/SFCS.2000.892324

A. Kermarrec, V. Leroy, and C. Thraves, Converging Quickly to Independent Uniform Random Topologies, 2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing, pp.159-166, 2011.
DOI : 10.1109/PDP.2011.60
URL : https://hal.archives-ouvertes.fr/inria-00543249

C. Law and K. Siu, Distributed construction of random expander networks, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.2133-2143, 2003.
DOI : 10.1109/INFCOM.2003.1209234

P. Mahlmann and C. Schindelhauer, Peer-to-peer networks based on random transformations of connected regular undirected graphs, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.155-164, 2005.
DOI : 10.1145/1073970.1073992

P. Mahlmann and C. Schindelhauer, Distributed random digraph transformations for peer-to-peer networks, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.308-317, 2006.
DOI : 10.1145/1148109.1148162

G. Pandurangan, P. Raghavan, and E. Upfal, Building low-diameter peer-to-peer networks, Proc. of FOCS '01, pp.492-499, 2001.
DOI : 10.1109/JSAC.2003.814666
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3455

S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker, A Scalable Content Addressable Network, Proc. of the ACM SIGCOMM, pp.161-172, 2001.

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proc. of the 3rd IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18

I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: A Scalable Peerto-Peer Lookup Service for Internet Applications, Proc. of the ACM SIGCOMM, pp.149-160, 2001.