Date of Award

12-2016

Degree Type

Thesis

Degree Name

Master of Science in Industrial Engineering (MSIE)

Department

Industrial Engineering

First Advisor

Vaneet Aggarwal

Committee Chair

Vaneet Aggarwal

Committee Member 1

Christopher J. Quinn

Committee Member 2

Gesualdo Scutari

Abstract

Nowadays, in distributed storage systems, long tails of responsible time are of particular concern. Modern large companies like Bing, Facebook and Amazon Web Service show that 99.9th percentile response times being orders of magnitude worse than the mean. With the advantages of maintaining high data reliability and ensur- ing enough space eciency, erasure code has become a popular storage method in distributed storage systems. However, due to the lack of mathematical models for analyzing erasure-coded based distributed storage systems, taming tail latency is still an open problem.

In this research, we quantify tail latency in such systems by deriving a closed upper bounds on tail latency for general service time distribution and heterogeneous files. Later we specified service time to shifted exponentially distributed. Based on this model, we developed an optimization problem to minimize weighted tail latency probability of deriving all files. We propose an alternating minimization algorithm for this problem. Our simulation results have shown significant reduction on tail latency of erasure-coded distributed storage systems with realistic environment workload.

Download

Share

COinS