Computer Science

Characterizing and adapting the consistency-latency tradeoff in distributed key-value stores

Document Type

Article

Abstract

The CAP theorem is a fundamental result that applies to distributed storage systems. In this article, we first present and prove two CAP-like impossibility theorems. To state these theorems, we present probabilistic models to characterize the three important elements of the CAP theorem: consistency (C), availability or latency (A), and partition tolerance (P). The theorems show the un-achievable envelope, that is, which combinations of the parameters of the three models make them impossible to achieve together. Next, we present the design of a class of systems called Probabilistic CAP (PCAP) that perform close to the envelope described by our theorems. In addition, these systems allow applications running on a single data center to specify either a latency Service Level Agreement (SLA) or a consistency SLA. The PCAP systems automatically adapt, in real time and under changing network conditions, to meet the SLA while optimizing the other C/A metric. We incorporate PCAP into two popular key-value stores: Apache Cassandra and Riak. Our experiments with these two deployments, under realistic workloads, reveal that the PCAP systems satisfactorily meets SLAs and perform close to the achievable envelope. We also extend PCAP from a single data center to multiple geo-distributed data centers.

Publication Title

ACM Transactions on Autonomous and Adaptive Systems

Publication Date

2017

Volume

11

Issue

4

ISSN

1556-4665

DOI

10.1145/2997654

Keywords

adaptivity, consistency, distributed storage

APA Citation

Rahman, M. R., Tseng, L., Nguyen, S., Gupta, I., & Vaidya, N. (2017). Characterizing and adapting the consistency-latency tradeoff in distributed key-value stores. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 11(4), 1-36.

Link to Full Text

Share

COinS