Paper Info
Title
Peer to peer size estimation in large and dynamic networks: A comparative study
Abstract
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are characterized by their self-organizing capabilities, resilience to failure and fully decentralized control. In a peer to peer overlay, no entity has a global knowledge of the system. As much as this property is essential to ensure the scalability, monitoring the system under such circumstances is a complex task. Yet, estimating the size of the system is core functionality for many distributed applications to parameter setting or monitoring purposes. In this paper, we propose a comparative study between three algorithms that estimate in a fully decentralized way the size of a peer to peer overlay. Candidate approaches are generally applicable irrespective of the underlying structure of the peer to peer overlay. The paper reports the head to head comparison of estimation system size algorithms. The simulations have been conducted using the same simulation framework and inputs and highlight the differences in cost and accuracy of the estimation between the algorithms both in static and dynamic settings
Year
DOI
Venue
2006
10.1109/HPDC.2006.1652131
Paris
Keywords
Field
DocType
computer network reliability,peer-to-peer computing,P2P overlay network,P2P self-organizing capability,distributed system,peer- to-peer size estimation
Psychological resilience,Decentralised system,Peer-to-peer,Computer science,Peer to peer overlay,Peer to peer computing,Computer network,Real-time computing,Peer to peer overlay networks,Scalability,Distributed computing
Conference
ISSN
ISBN
Citations 
1082-8907
1-4244-0307-3
33
PageRank 
References 
Authors
1.50
13
4
Name
Order
Citations
PageRank
Erwan Le Merrer132223.58
Anne-Marie Kermarrec26649453.63
Laurent Massoulié33512244.42
Le Merrer, E.4332.17