Year: 2019
Type: article
Abstract: Coded caching is a technique for reducing peak data rate in content delivery systems that employ caching. The original formulation of the coded caching problem assumes that the file requests from the users are synchronous, i.e., they arrive at the same time. In this work, we consider the asynchronous setting where the file requests are revealed to the server in an online fashion. We propose a novel online algorithm for this problem building on our prior work for the offline setting (where the server knows the request arrival times and deadlines in advance). Our simulation results demonstrate that our proposed online algorithm allows for a natural tradeoff between the feasibility of the schedule and the rate gains of coded caching.
Authors: Hooshang Ghasemi, Aditya Ramamoorthy
Language: English
Topic: Caching and Content Delivery
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2971955524
