Can I read Asymptotics of Replication and Matching in Large Caching Systems on EtoBox?

Asymptotics of Replication and Matching in Large Caching Systems by Arpan Mukhopadhyay; Nidhi Hegde; Marc Lelarge is a Computer Science article available to read on EtoBox.

What is Asymptotics of Replication and Matching in Large Caching Systems about?

We consider a generic model of distributed caching systems, where the cache servers are constrained by two main resources: memory size and bandwidth. Content distribution networks (CDNs) providing video contents and peer-to-peer video-on-demand services are a few examples of such systems. The throughput of these systems crucially depends on how these resources are managed, i.e., how contents are replicated across servers and how requests of specific contents are matched to servers storing the contents. In this paper, we formulate the problem of computing the replication policy and the matching policy, which jointly maximizes the throughput of the caching system. It is shown that computing the optimal replication policy for a given finite system is an NP-hard problem. A greedy replication scheme is then proposed and is shown to achieve a constant factor approximation guarantee when combined with the optimal matching policy. We note that the optimal matching policy has the problem of interruption in service of the ongoing requests due to re-assignment or repacking of the existing requests. To avoid this problem, we propose a simple randomized online matching scheme and analyze its pe

Who reads Asymptotics of Replication and Matching in Large Caching Systems?

Author

Arpan Mukhopadhyay; Nidhi Hegde; Marc Lelarge

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Published

2019

Language

EN

Field

Computer Science (Physical Sciences)