The Library
Asymptotics of replication and matching in large caching systems
Tools
Tools
Tools
Mukhopadhyay, Arpan, Hegde, Nidhi and Lelarge, Marc (2019) Asymptotics of replication and matching in large caching systems. IEEE/ACM Transactions on Networking, 27 (4). pp. 1657-1668. doi:10.1109/TNET.2019.2926235
|
PDF
WRAP-asymptotics-replication-matching-caching-systems-Mukhopadhyay-2019.pdf - Accepted Version - Requires a PDF viewer. Download (1327Kb) | Preview |
Official URL: https://doi.org/10.1109/TNET.2019.2926235
Abstract
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 performance in conjunction with the proposed replication scheme. We consider a limiting regime, where the number of servers is large and the arrival rates of the contents are scaled proportionally, and show that the proposed policies achieve asymptotic optimality. Extensive simulation results are presented to evaluate the performance of different policies and study the behavior of the caching system under different service time distributions of the requests.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science) T Technology > TK Electrical engineering. Electronics Nuclear engineering |
||||||||
| Divisions: | Faculty of Science > Computer Science | ||||||||
| Library of Congress Subject Headings (LCSH): | Cloud computing, Cache memory, Computer storage devices, Electronic data processing -- Backup processing alternatives | ||||||||
| Journal or Publication Title: | IEEE/ACM Transactions on Networking | ||||||||
| Publisher: | IEEE | ||||||||
| ISSN: | 1063-6692 | ||||||||
| Official Date: | August 2019 | ||||||||
| Dates: |
|
||||||||
| Volume: | 27 | ||||||||
| Number: | 4 | ||||||||
| Page Range: | pp. 1657-1668 | ||||||||
| DOI: | 10.1109/TNET.2019.2926235 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Publisher Statement: | © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | ||||||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
