Paper Info
Title
On the tradeoff of availability and consistency for quorum systems in data center networks.
Abstract
Large-scale distributed storage systems often replicate data across servers and even geographically-distributed data centers for high availability, while existing theories like CAP and PACELC show that there is a tradeoff between availability and consistency. Thus eventual consistency is proposed to provide highly available storage systems. However, current practice is mainly experience-based and lacks quantitative analysis for identifying a good tradeoff between the two. In this work, we are concerned with providing a quantitative analysis on availability for widely-used quorum systems in data center networks. First, a probabilistic model is proposed to quantify availability for typical data center networks: 2-tier basic tree, 3-tier basic tree, fat tree and folded clos, and even geo-distributed data center networks. Second, we analyze replica placements on network topologies to obtain maximal availability. Third, we build the availability-consistency table and propose a set of rules to quantitatively make tradeoff between availability and consistency. Finally, with Monte Carlo based simulations, we validate our presented quantitative results and show that our approach to make tradeoff between availability and consistency is effective.
Year
DOI
Venue
2015
10.1016/j.comnet.2014.11.006
Computer Networks
Keywords
Field
DocType
Quorum systems,Availability,Data center networks
Computer science,Distributed data store,Server,Computer network,Data center,High availability,Replicate,Distributed computing
Journal
Volume
Issue
ISSN
76
C
1389-1286
Citations 
PageRank 
References 
2
0.37
19
Authors
4
Name
Order
Citations
PageRank
Xu Wang112016.42
Hailong Sun268064.83
Ting Deng314912.51
Jinpeng Huai41187130.18