Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Estimating network size from local information
Information Processing Letters
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
POST: a secure, resilient, cooperative messaging system
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Journal of Systems and Software
Self-managed topologies in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-factors oriented study of P2P Churn
International Journal of Communication Systems - Secure communications and data management in ubiquitous services
Information Sciences: an International Journal
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Distributed recommender for peer-to-peer knowledge sharing
Information Sciences: an International Journal
Supporting multi-dimensional queries in mobile P2P network
Information Sciences: an International Journal
Using a Pheromone Mechanism to Estimate the Size of Unstructured Networks
ICPADS '11 Proceedings of the 2011 IEEE 17th International Conference on Parallel and Distributed Systems
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.07 |
Peer to Peer (P2P) systems have shown to be a good solution to build self-organized large scale distributed information systems. Within Peer to Peer overlays, Distributed Hash Tables (DHTs) offer strong fault tolerance properties as well as efficient object look-up algorithms. Even if the essence of a P2P system is to provide to each node a restricted local view of the whole system, it is often useful to have some global knowledge of the system, such as knowing the DHT size. The DHT size is relevant, as this information is used to adapt some parameters of the system (the number of replicas of a given object, the depth for epidemic algorithms, the potential number of clients for a given service). Computing the number of nodes in a DHT is a difficult task as it requires the best possible accuracy at the lowest achievable cost in terms of messages overhead. In this paper, we propose a new algorithm to estimate the number of nodes in a DHT called Fixed Interval Nodes Estimation (FINE). Our approach is fairly accurate for the estimation, and has a very low overhead in the number of generated messages. We give a complete set of results from simulations as well as a statistical study to demonstrate the accuracy of FINE and that it does not depend either on the DHT size, nor on the hash function used to build the DHT.