Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Randomized algorithms
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
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Routing networks for distributed hash tables
Proceedings of the twenty-second annual symposium on Principles of distributed computing
An analysis of internet content delivery systems
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
Approximately uniform random sampling in sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Decentralized algorithms using both local and random probes for P2P load balancing
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient Approximate Query Processing in Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on Computer Systems (TOCS)
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The "art" of programming gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Distinct value estimation on peer-to-peer networks
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Random Subsets of the Interval and P2P Protocols
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distribution fairness in Internet-scale networks
ACM Transactions on Internet Technology (TOIT)
Probably Approximately Correct Search
ICTIR '09 Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory
Uniform Sampling for Directed P2P Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Multi-dimensional data density estimation in P2P networks
Distributed and Parallel Databases
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing
Future Generation Computer Systems
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
HiPC'07 Proceedings of the 14th international conference on High performance computing
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
LiFTinG: lightweight freerider-tracking in gossip
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Private information retrieval with a trusted hardware unit - revisited
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On sampling in higher-dimensional peer-to-peer systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A dynamic load balancing strategy with the push and pull approaches in DHT networks
Computers and Electrical Engineering
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
We present the first fully distributed algorithm which chooses a peer uniformly at random from the set of all peers in a distributed hash table (DHT). Our algorithm has latency O(log n) and sends O(log n) messages in expectation for a DHT like Chord [17]. Our motivation for studying this problem is threefold: to enable data collection by statistically rigorous sampling methods; to provide support for randomized, distributed algorithms over peer-to-peer networks; and to support the creation and maintenance of random links, and thereby offer a simple means of improving fault-tolerance.