The costs and limits of availability for replicated services

  • Authors:

  • Haifeng Yu;Amin Vahdat

  • Affiliations:

  • Intel Research Pittsburgh and Carnegie Mellon University, Pittsburgh, PA;University of California, San Diego, La Jolla, CA

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.