Distributed Computing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
A Real-Time Primary-Backup Replication Service
IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Remus: high availability via asynchronous virtual machine replication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
The inherent difficulty of timely primary-backup replication
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hi-index | 0.00 |
We show that existing methods for primary-backup replication may disrupt the timing behavior of an underlying service to the extent of making it unusable. Furthermore, we prove that this problem is inherent to the standard primary-backup model. The formal proof is based on an analysis of the “local knowledge” available to each party in a correct primary-backup protocol. This negative result implies that entirely new approaches are needed to resolve the problem; on the positive side, the proof offers some hints for designing a solution. © 2012 Alcatel-Lucent. © 2012 Wiley Periodicals, Inc.