The costs and limits of availability for replicated services
- 21 October 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 35 (5) , 29-42
- https://doi.org/10.1145/502059.502038
Abstract
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A key approach to improving availability involves replicating the service across multiple, wide-area sites. However, replication introduces well-known tradeoffs between service consistency and availability. Thus, this paper explores the benefits of dynamically trading consistency for availability using a continuous consistency model . In this model, applications specify a maximum deviation from strong consistency on a per-replica basis. In this paper, we: i) evaluate availability of a prototype replication system running across the Internet as a function of consistency level, consistency protocol, and failure characteristics, ii) demonstrate that simple optimizations to existing consistency protocols result in significant availability improvements (more than an order of magnitude in some scenarios), iii) use our experience with these optimizations to prove tight upper bounds on the availability of services, and iv) show that maximizing availability typically entails remaining as close to strong consistency as possible during times of good connectivity, resulting in a communication versus availability trade-off.Keywords
This publication has 24 references indexed in Scilit:
- The future of systems researchComputer, 1999
- A quantitative comparison of graph-based models for Internet topologyIEEE/ACM Transactions on Networking, 1997
- Managing update conflicts in Bayou, a weakly connected replicated storage systemPublished by Association for Computing Machinery (ACM) ,1995
- Bounded ignoranceACM Transactions on Database Systems, 1994
- Optimal coteries and voting schemesInformation Processing Letters, 1994
- Cost and availability tradeoffs in replicated data concurrency controlACM Transactions on Database Systems, 1993
- Providing high availability using lazy replicationACM Transactions on Computer Systems, 1992
- Disconnected operation in the Coda File SystemACM Transactions on Computer Systems, 1992
- The vulnerability of vote assignmentsACM Transactions on Computer Systems, 1986
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979