Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
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
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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
On Obtaining Global Information in a Peer-to-Peer Fully Distributed Environment (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
SWIM: Scalable Weakly-consistent Infection-style Process Group Membership Protocol
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
ACM Transactions on Computer Systems (TOCS)
Estimating membership in a multicast session
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
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
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Robust distributed name service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
The promise, and limitations, of gossip protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
A parameter-free load balancing mechanism for P2P networks
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Scalable Stealth Mode P2P Overlays of Very Small Constant Degree
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
InfoPuzzle: exploring group decision making in mobile peer-to-peer databases
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
Shaping opportunistic networks
Computer Communications
Distributed online flash-crowd detection in P2P swarming systems
Computer Communications
Decentralized monitoring in peer-to-peer systems
Benchmarking Peer-to-Peer Systems
| Hi-index | 0.00 |
This paper presents two solutions to a distributed statistic collection problem, called Group Size Estimation. These algorithms are intended for large-scale and dynamic distributed systems such as Grids, peer-to-peer overlays, etc. Each algorithm estimates (both in a one-shot and continuous manner) the number of non-faulty processes present in the global group. The first active scheme samples receipt times of gossip messages, while the second passive scheme calculates the density of process identifiers when hashed to a real interval. Our analysis, trace-driven simulation and deployment on a 33-node Linux cluster study and compare the latencies, scalability, and accuracy of these schemes.