R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, p.47, 2002.
DOI : 10.1103/RevModPhys.74.47

M. Bawa, H. Garcia-molina, A. Gionis, and R. Motwani, Estimating aggregates on a peer-to-peer network, 2003.

M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, Security for structured peer-to-peer overlay networks, 2002.

P. Eugster, S. Handurukande, R. Guerraoui, A. Kermarrec, and P. Kouznetsov, Lightweight probabilistic broadcast, ACM Transaction on Computer Systems, vol.21, issue.4, 2003.
DOI : 10.1109/dsn.2001.941428
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.9532

M. , F. Kaashoek, and D. R. Karger, Koorde: A simple degreeoptimal distributed hash table, IPTPS, 2003.
DOI : 10.1007/978-3-540-45172-3_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5574

T. Friedman and D. Towsley, Multicast session membership size estimation, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 1999.
DOI : 10.1109/INFCOM.1999.751487
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.286

A. J. Ganesh, A. M. Kermarrec, and L. , Massoulié Peer-to-peer membership management for gossip-based protocols, IEEE transactions on computers, vol.52, issue.2, 2003.

M. Jelasity, R. Guerraoui, A. Kermarrec, and M. Van-steen, The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations, 2004.
DOI : 10.1038/30918

M. Jelasity and A. Montresor, Epidemic-style proactive aggregation in large overlay networks, 24th International Conference on Distributed Computing Systems, 2004. Proceedings., 2004.
DOI : 10.1109/ICDCS.2004.1281573

M. Jelasity, S. Voulgaris, R. Guerraoui, and A. Kermarrec, Gossipbased peer sampling

D. Kostoulas, D. Psaltoulis, I. Gupta, K. Birman, and A. Demers, Decentralized Schemes for Size Estimation in Large and Dynamic Groups, Fourth IEEE International Symposium on Network Computing and Applications, 2005.
DOI : 10.1109/NCA.2005.15

D. Malkhi, M. Naor, and D. Ratajczak, Viceroy, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, 2002.
DOI : 10.1145/571825.571857

G. S. Manku, Routing networks for distributed hash tables, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, 2003.
DOI : 10.1145/872035.872054

G. S. Manku, M. Bawa, and P. Raghavan, Symphony: Distributed Hashing, 2003.

L. Massoulié, E. L. Merrer, A. Kermarrec, and A. J. Ganesh, Peer counting and sampling in overlay networks, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, 2006.
DOI : 10.1145/1146381.1146402

D. Psaltoulis, D. Kostoulas, I. Gupta, K. Birman, and A. Demers, Practical algorithms for size estimation in large and dynamic groups, PODC, 2004.

R. Van-renesse, K. Birman, and W. Vogels, Astrolabe, ACM Transactions on Computer Systems, vol.21, issue.2, pp.164-206, 2003.
DOI : 10.1145/762483.762485

S. Voulgaris, D. Gavidia, and M. Van-steen, CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, Journal of Network and Systems Management, vol.21, issue.6, 2005.
DOI : 10.1007/s10922-005-4441-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.4965