Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The simple random walk and max-degree walk on a directed graph
Random Structures & Algorithms
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |
Quorums are a fundamental building block for solving various fundamental problems such as consensus, distributed dictionaries, distributed storage, among others. In particular, probabilistic quorums have shown to be scalable, efficient, and suitable for dynamic environments [12]. Unfortunately, most existent analytic results for accessing probabilistic quorums are tailored to static networks [8]. However, we believe that the correct functioning of such systems must be assured in a much wider range of scenarios. In this paper, we discuss the random walk based scheme for accessing probabilistic quorums in dynamic networks where an oblivious adversary changes the communication links arbitrarily in each round. We show that O(n3 log n) communication steps are needed to access a probabilistic quorum under these conditions.