RetroRenting: An Online Policy for Service Caching at the Edge

12/24/2019
by   Lakshmi Narayana, et al.
0

The rapid proliferation of shared edge computing platforms has enabled application service providers to deploy a wide variety of services with stringent latency and high bandwidth requirements. A key advantage of these platforms is that they provide pay-as-you-go flexibility by charging clients in proportion to their resource usage through short-term contracts. This affords the client significant cost-saving opportunities, by dynamically deciding when to host (cache) its service on the platform, depending on the changing intensity of requests. A natural caching policy for our setting is the Time-To-Live (TTL) policy. We show that TTL performs poorly both in the adversarial arrival setting, i.e., in terms of the competitive ratio, and for i.i.d. stochastic arrivals with low arrival rates, irrespective of the value of the TTL timer. We propose an online caching policy called RetroRenting (RR) and show that in the class of deterministic online policies, RR is order-optimal with respect to the competitive ratio. In addition, we provide performance guarantees for RR for i.i.d. stochastic arrival processes and prove that it compares well with the optimal online policy. Further, we conduct simulations using both synthetic and real world traces to compare the performance of RR and its variants with the optimal offline and online policies. The simulations show that the performance of RR is near optimal for all settings considered. Our results illustrate the universality of RR.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2021

Online Partial Service Hosting at the Edge

We consider the problem of service hosting where an application provider...
research
07/29/2022

Renting Edge Computing Resources for Service Hosting

We consider the setting where a service is hosted on a third-party edge ...
research
06/03/2023

On Optimal Caching and Model Multiplexing for Large Model Inference

Large Language Models (LLMs) and other large foundation models have achi...
research
03/13/2023

On the Regret of Online Edge Service Hosting

We consider the problem of service hosting where a service provider can ...
research
11/29/2022

Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals

We consider the online caching problem for a cache of limited size. In a...
research
01/10/2023

Dynamic Regret of Randomized Online Service Caching in Edge Computing

This paper studies an online service caching problem, where an edge serv...
research
02/02/2021

On the Power of False Negative Awareness in Indicator-based Caching Systems

Distributed caching systems such as content distribution networks often ...

Please sign up or login with your details

Forgot password? Click here to reset