Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: FAST CLOUD: Pushing the Envelope on Delay Performance of Cloud Storage
  with Coding   Our paper presents solutions that can significantly improve the delay
performance of putting and retrieving data in and out of cloud storage. We
first focus on measuring the delay performance of a very popular cloud storage
service Amazon S3. We establish that there is significant randomness in service
times for reading and writing small and medium size objects when assigned
distinct keys. We further demonstrate that using erasure coding, parallel
connections to storage cloud and limited chunking (i.e., dividing the object
into a few smaller objects) together pushes the envelope on service time
distributions significantly (e.g., 76%, 80%, and 85% reductions in mean, 90th,
and 99th percentiles for 2 Mbyte files) at the expense of additional storage
(e.g., 1.75x). However, chunking and erasure coding increase the load and hence
the queuing delays while reducing the supportable rate region in number of
requests per second per node. Thus, in the second part of our paper we focus on
analyzing the delay performance when chunking, FEC, and parallel connections
are used together. Based on this analysis, we develop load adaptive algorithms
that can pick the best code rate on a per request basis by using off-line
computed queue backlog thresholds. The solutions work with homogeneous services
with fixed object sizes, chunk sizes, operation type (e.g., read or write) as
well as heterogeneous services with mixture of object sizes, chunk sizes, and
operation types. We also present a simple greedy solution that
opportunistically uses idle connections and picks the erasure coding rate
accordingly on the fly. Both backlog and greedy solutions support the full rate
region and provide best mean delay performance when compared to the best fixed
coding rate policy. Our evaluations show that backlog based solutions achieve
better delay performance at higher percentile values than the greedy solution.

4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics