Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
MON: on-demand overlays for distributed system management
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Journal of Systems and Software
The "art" of programming gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
HRS: A Hybrid Replication Strategy for Exhaustive P2P Search
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
A Practical Approach to Network Size Estimation for Structured Overlays
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks
WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
Gossiping for threshold detection
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
On the self-organization of a hybrid peer-to-peer system
Journal of Network and Computer Applications
Decentralized cooperative manipulation with a swarm of mobile robots
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
PINTS: peer-to-peer infrastructure for tagging systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Efficient and secure decentralized network size estimation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Gossip-Based counting in dynamic networks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Information Sciences: an International Journal
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
Gossip-based density estimation in dynamic heterogeneous wireless sensor networks
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manner. In this paper, we tackle a specific statistic collection problem called Group Size Estimation, for estimating the number of non-faulty processes present in the global group at any given point of time. We present two new decentralized algorithms for estimation in dynamic groups, analyze the algorithms, and experimentally evaluate them using real-life traces. One scheme is active: it spreads a gossip into the overlay first, and then samples the receipt times of this gossip at different processes. The second scheme is passive: it measures the density of processes when their identifiers are hashed into a real interval. Both schemes have low latency, scalable perprocess overheads, and provide high levels of probabilistic accuracy for the estimate. They are implemented as part of a size estimation utility called PeerCounter that can be incorporated modularly into standard peer-to-peer overlays. We present experimental results from both the simulations and PeerCounter, running on a cluster of 33 Linux servers.