The costs and limits of availability for replicated services
Authors:
Open Access
- 1 February 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 24 (1) , 70-113
Abstract
As raw system 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 trade-offs between service consistency and availability. Thus, this article 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 article, we: i) evaluate the 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 bound 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 21 references indexed in Scilit:
- Improving the reliability of commodity operating systemsACM Transactions on Computer Systems, 2005
- End-to-end WAN service availabilityIEEE/ACM Transactions on Networking, 2003
- Design and evaluation of a conit-based continuous consistency model for replicated servicesACM Transactions on Computer Systems, 2002
- The future of systems researchComputer, 1999
- Optimal availability quorum systems: Theory and practiceInformation Processing Letters, 1998
- A quantitative comparison of graph-based models for Internet topologyIEEE/ACM Transactions on Networking, 1997
- Bounded ignoranceACM Transactions on Database Systems, 1994
- Voting as the optimal static pessimistic scheme for managing replicated dataIEEE Transactions on Parallel and Distributed Systems, 1994
- Cost and availability tradeoffs in replicated data concurrency controlACM Transactions on Database Systems, 1993
- The vulnerability of vote assignmentsACM Transactions on Computer Systems, 1986