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)
SIAM Journal on Applied Mathematics
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Epidemic algorithms for replicated database maintenance
ACM SIGOPS Operating Systems Review
Development of the domain name system
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The generalized tree quorum protocol: an efficient approach for managing replicated data
ACM Transactions on Database Systems (TODS)
Improved algorithms for synchronizing computer network clocks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Principles of transaction processing: for the systems professional
Principles of transaction processing: for the systems professional
Designing and implementing asynchronous collaborative applications with Bayou
Proceedings of the 10th annual ACM symposium on User interface software and technology
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The IceCube approach to the reconciliation of divergent replicas
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Light-Weight Currency Management Mechanisms in Mobile and Weakly-Connected Environments
Distributed and Parallel Databases
Microsoft® Windows® 2000 Active DirectoryTM Programming
Microsoft® Windows® 2000 Active DirectoryTM Programming
Application-independent reconciliation for nomadic applications
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
Optimistic Replication for Internet Data Services
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Support for Speculative Update Propagation and Mobility in Deno
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Roam: a scalable replication system for mobile and distributed computing
Roam: a scalable replication system for mobile and distributed computing
Deno: A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments
IEEE Transactions on Computers
Epidemic Algorithms for Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Replication techniques for peer-to-peer networks
Replication techniques for peer-to-peer networks
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
ACM Computing Surveys (CSUR)
In-place rsync: file synchronization for mobile and wireless devices
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
| Hi-index | 0.24 |
Optimistic replication algorithms allow data presented to users to be stale (non-up-to-date) but in a controlled way: they propagate updates in background and allow any replica to be accessed directly most of the time. When the timely propagation of updates to remote distributed replicas is an important issue, it is preferable that a replica gets the same update twice than it does not receive it at all. On the other hand, few assumptions on the topology of the network can be made in a nomadic environment, where connections are likely to change unpredictably. An extreme approach would be to blindly ''push'' every update to every replica; however, this would lead to a huge waste of bandwidth and of resources. In this paper, we present a novel approach based on timed buffers, a technique that tends to reduce the overall number of propagated updates while guaranteeing that every update is delivered to every replica and that the propagation is not delayed.