A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Information and Computation
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on 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
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
From Static Distributed Systems to Dynamic Systems
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
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
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |
Distributed systems are now both very large and highly dynamic Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can no longer accommodate While the challenge of organizing peers in an overlay network has generated a lot of interest leading to a large number of solutions, maintaining critical data in such a network remains an open issue In this paper, we are interested in defining the portion of nodes and frequency one has to probe, given the churn observed in the system, in order to achieve a given probability of maintaining the persistence of some critical data More specifically, we provide a clear result relating the size and the frequency of the probing set along with its proof as well as an analysis of the way of leveraging such an information in a large scale dynamic distributed system.