att_abstract={Modern distributed storage systems offer large capacity to satisfy the exponentially increasing need of storage space. They often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. This paper provides an insightful upper bound on the average service delay of such erasure-coded storage with arbitrary service time distribution and consisting of multiple heterogeneous files.
Not only does the result supersede known delay bounds that only work for a single file or homogeneous files, it also enables a novel problem of joint latency and storage cost minimization over three dimensions: selecting the erasure code, placement of encoded chunks, and optimizing scheduling policy. The problem is efficiently solved via the computation of a sequence of convex approximations with provable convergence. We further prototype our solution in an open-source, cloud storage deployment over three geographically distributed data centers. Experimental results validate our theoretical delay analysis and show significant latency reduction, providing valuable insights into the proposed latency-cost tradeoff in erasure-coded storage.},
	att_categories={C_NSS.4, C_CCF.8},
	att_copyright_notice={(c) ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM/IEEE Transactions on Networking {{, Volume 24}}{{, Issue 4}}{{, 2016-08-31}}{{, http://www.comsoc.org/ton}}.
	att_tags={erasure-coded storage, optimization, latency analysis},
	author={Xiang, Yu, Tian Lan, Vaneet Aggarwal, and Yih Farn R. Chen},
	institution={{ACM/IEEE Transactions on Networking, Vol. 24, Issue 4, pp. 2443 - 2457, August 2016.}},
	title={{Joint Latency and Cost Optimization for Erasure-coded Data Center Storage}},