Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
How to construct random functions
Journal of the ACM (JACM)
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Secure communications over insecure channels
Communications of the ACM
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Sampling from a moving window over streaming data
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Stream Statistics over Sliding Windows
SIAM Journal on Computing
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Araneola: A Scalable Reliable Multicast System for Dynamic Environments
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Distributed Computing
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Defending against eclipse attacks on overlay networks
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Random sampling from a search engine's index
Proceedings of the 15th international conference on World Wide Web
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Identifying Malicious Peers Before It's Too Late: A Decentralized Secure Peer Sampling Service
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
ACM Transactions on Computer Systems (TOCS)
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Scalable byzantine computation
ACM SIGACT News
Mean-field framework for performance evaluation of push-pull gossip protocols
Performance Evaluation
Dynamic networks: models and algorithms
ACM SIGACT News
LiFTinG: lightweight freerider-tracking in gossip
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
Decentralized polling with respectable participants
Journal of Parallel and Distributed Computing
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on Computing
On leveraging social relationships for decentralized privacy-preserving group communication
Proceedings of the Fifth Workshop on Social Network Systems
PAC'nPost: a framework for a micro-blogging social network in an unstructured P2P network
Proceedings of the 21st international conference companion on World Wide Web
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
We present Brahms, an algorithm for sampling random nodes in a large dynamic system prone to malicious behavior. Brahms stores small membership views at each node, and yet overcomes Byzantine attacks by a linear portion of the system. Brahms is composed of two components. The first is an attack-resilient gossip-based membership protocol. The second component extracts independent uniformly random node samples from the stream of node ids gossiped by the first. We evaluate Brahms using rigorous analysis, backed by simulations, which show that our theoretical model captures the protocol's essentials. We study two representative attacks, and show that with high probability, an attacker cannot create a partition between correct nodes. We further prove that each node's sample converges to an independent uniform one over time. To our knowledge, no such properties were proven for gossip protocols in the past.