Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Preventive Replication in a Database Cluster
Distributed and Parallel Databases
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
From spontaneous total order to uniform total order: different degrees of optimistic delivery
Proceedings of the 2006 ACM symposium on Applied computing
Providing dependability for web services
Proceedings of the 2008 ACM symposium on Applied computing
Unconscious eventual consistency with gossips
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
On the inherent cost of atomic broadcast and multicast in wide area networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Towards robust optimistic approaches
Future directions in distributed computing
Rewriting: sleeping to get there faster
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Consistent data replication: is it feasible in WANs?
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Towards a generic group communication service
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Group-Based replication of on-line transaction processing servers
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Practical database replication
Replication
Modeling and validating the performance of atomic broadcast algorithms in high latency networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Scalable service-oriented replication with flexible consistency guarantee in the cloud
Information Sciences: an International Journal
| Hi-index | 0.00 |
Total order multicast greatly simplifies the implementation of fault-tolerant services using the replicated state machine approach. The additional latency of total ordering can be masked by taking advantage of spontaneous ordering observed in LANs: A tentative delivery allows the application to proceed in parallel with the ordering protocol. The effectiveness of the technique rests on the optimistic assumption that a large share of correctly ordered tentative deliveries offsets the cost of undoing the effect of mistakes.This paper proposes a simple technique which enables the usage of optimistic delivery also in WANs with much larger transmission delays where the optimistic assumption does not normally hold. Our proposal exploits local clocks and the stability of network delays to reduce the mistakes in the ordering of tentative deliveries. An experimental evaluation of a modified sequencer-based protocol is presented, illustrating the usefulness of the approach in fault-tolerant database management.