E. Anceaume, X. Defago, M. Gradinariu, and M. Roy, Towards a theory of self-organization, Proc. of 9th Int'l Conference on Principles of Distributed Systems, 2005.

D. P. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.
DOI : 10.1109/GRID.2004.14

A. Bavier, M. Bowman, B. Chun, D. Culler, S. Karlin et al., Operating system support for planetary-scale network services, Symposium on Networked Systems Design and Implementation, pp.253-266, 2004.

R. Bhagwan, S. Savage, and G. Voelker, Understanding Availability, Proc. of the 2nd Int'l Workshop on Peer-to- Peer Systems, pp.256-267, 2003.
DOI : 10.1007/978-3-540-45172-3_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1523

D. J. Dewitt, J. F. Naughton, and D. A. Schneider, Parallel sorting on a shared-nothing architecture using probabilistic splitting, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems, pp.280-291, 1991.
DOI : 10.1109/PDIS.1991.183115

A. Fernández, V. Gramoli, E. Jiménez, A. Kermarrec, and M. , Distributed Slicing in Dynamic Systems, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2006.
DOI : 10.1109/ICDCS.2007.102

R. W. Floyd and R. L. Rivest, Expected time bounds for selection, Communications of the ACM, vol.18, issue.3, pp.165-172, 1975.
DOI : 10.1145/360680.360691

. Gnutella-homepage, http://www.gnutella.com. [9] The gnutella protocol development homepage

K. Iwanicki, Gossip-based dissemination of time, 2005.

B. Iyer, G. Ricard, and P. Varman, Percentile finding algorithm for multiple sorted runs, Proc. of the 15th Int'l Conference on Very Large Data Bases, pp.135-144, 1989.

M. Jelasity, R. Guerraoui, A. Kermarrec, and M. Van-steen, The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations, Proc. of the 5th ACM/IFIP/USENIX Int'l Conference on Middleware, pp.79-98, 2004.
DOI : 10.1038/30918

M. Jelasity and A. Kermarrec, Ordered Slicing of Very Large-Scale Overlay Networks, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), pp.117-124, 2006.
DOI : 10.1109/P2P.2006.25

M. Jelasity, A. Montresor, and O. Babaoglu, A Modular Paradigm for Building Self-Organizing Peer-to-Peer Applications, Engineering Self-Organising Systems: Nature- Inspired Approaches to Software Engineering, pp.265-282, 2004.
DOI : 10.1007/978-3-540-24701-2_18

M. Jelasity, A. Montresor, and O. Babaoglu, Gossip-based aggregation in large dynamic networks, ACM Transactions on Computer Systems, vol.23, issue.3, pp.219-252, 2005.
DOI : 10.1145/1082469.1082470

D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregrate information, Proc. of 44th Annual IEEE Symposium of Foundations of Computer Science, pp.482-491, 2003.

J. Sacha, J. Dowling, R. Cunningham, and R. Meier, Using Aggregation for Adaptive Super-Peer Discovery on the Gradient Topology, IEEE Int'l Workshop on Self-Managed Networks , Systems and Services, pp.77-90, 2006.
DOI : 10.1007/11767886_6

S. Saroiu, K. P. Gummadi, and S. D. Gribble, A measurement study of peer-to-peer file sharing systems, Proc. of Multimedia Computing and Networking, pp.156-170, 2002.

D. Stutzbach and R. Rejaie, Understanding churn in peer-topeer networks, Internet Measurement Conference, pp.189-202, 2006.

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, pp.197-217, 2005.
DOI : 10.1007/s10922-005-4441-x