Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Eventually-serializable data services
Theoretical Computer Science
ACM Transactions on Computer Systems (TOCS)
1/k phase stamping for continuous shared data (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Improving Data Access in P2P Systems
IEEE Internet Computing
Optimistic Total Order in Wide Area Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Taming aggressive replication in the Pangaea wide-area file system
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Processing Transactions over Optimistic Atomic Broadcast Protocols
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Meaningful metrics for evaluating eventual consistency
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
| Hi-index | 0.00 |
This paper combines various self-stabilization techniques within a replication protocol that ensures eventual consistency in largescale distributed systems subject to network partitions and asynchrony. A simulation study shows that the resulting protocol is scalable and achieves high throughput under load. Our protocol does not rely on any form of consensus, which would lead to block the replicas in case of partitions and asynchrony. Our protocol instead ensures that (1) updates are continuously applied to the replicas and (2) no two updates are ever performed in a different order. Gaps might occur during periods of unreliable communication. They are filled whenever connectivity is provided, and consistency is then eventually ensured, but without any conscious commitment. That is, there is no point in the computation when replicas know that consistency is achieved. This unconsciousness is the key to tolerating perpetual asynchrony with no consensus support.