A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Development of the domain name system
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Efficient at-most-once messages based on synchronized clocks
ACM Transactions on Computer Systems (TOCS)
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved algorithms for synchronizing computer network clocks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Principles of transaction processing: for the systems professional
Principles of transaction processing: for the systems professional
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Proceedings of the seventeenth ACM symposium on Operating systems principles
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Microsoft Windows 2000 Professional Resource Kit
Microsoft Windows 2000 Professional Resource Kit
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Roam: a scalable replication system for mobile and distributed computing
Roam: a scalable replication system for mobile and distributed computing
Optimistic deltas for WWW latency reduction
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Using the transformational approach to build a safe and generic data synchronizer
GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
Improving Availability and Performance with Application-Specific Data Replication
IEEE Transactions on Knowledge and Data Engineering
A safe and generic model for synchronizing divergent data
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
ACM Computing Surveys (CSUR)
Neptune: scalable replication management and programming support for cluster-based network services
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Conflict-aware scheduling for dynamic content applications
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Timed buffers: A technique for update propagation in nomadic environments
Computer Communications
Replica refresh strategies in a database cluster
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
| Hi-index | 0.00 |
We present a new replication algorithm that supports replication of a large number of objects on a diverse set of nodes. The Agoritinn allows replica sets to be changed dynamically on a per-objetct basis. It tolerates most types of failures, including multiple node failures, network partitions, and sudden node retirements. These advantages make the algorithm particularly attractive in large cluster-based data services that experience frequent failures and configuration changes. We prove the correctness of the algorithm and show that its performance is near-optimal.