TY  - INPR
Y1  - 2018/04/19/
TI  - DR-Cache: Distributed Resilient Caching with Latency Guarantees
N1  - This version is the author accepted manuscript. For information on re-use, please refer to the publisher?s terms and conditions.
ID  - discovery10042012
N2  - The dominant application in today?s Internet is
content streaming, which is increasingly relying on caches to
meet the stringent conditions on the latency between content
servers and end-users. These systems routinely face the challenges
of limited bandwidth capacities and network server failures,
which degrade caching performance. In this paper, we study
the problem of optimally allocating content over a resilient
caching network, in which each cache may fail under some
situations. Given content request rates and multiple routing
paths, we formulate an optimization problem to maximize the
expected caching gain, i.e., the reduction of latency due to
intermediate caching. The offline version of this problem is
NP-hard. We first propose a centralized, offline algorithm and
show that a solution with (1-1/e) approximation ratio to the
optimal can be constructed. We then propose a distributed ascent
algorithm based on the concave relaxation of the expected gain.
Informed by the results of our analysis, we finally propose a
distributed resilient caching algorithm (DR-Cache) that is simple
and adaptive to network failures. We show numerically that
DR-Cache significantly outperforms other candidate algorithms
under synthetic requests, as well as real world traces over a class
of network topologies.
AV  - public
UR  - http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
A1  - Li, J
A1  - Phan, TK
A1  - Chai, W
A1  - Tuncer, D
A1  - Pavlou, G
A1  - Griffin, D
A1  - Rio, M
ER  -