Optimistic no-regret algorithms for discrete caching
We take a systematic look at the problem of storing whole files in a cache with limited
capacity in the context of optimistic learning, where the caching policy has access to a …
capacity in the context of optimistic learning, where the caching policy has access to a …
Online caching with no regret: Optimistic learning via recommendations
The design of effective online caching policies is an increasingly important problem for
content distribution networks, online social networks and edge computing services, among …
content distribution networks, online social networks and edge computing services, among …
Fair resource allocation in virtualized O-RAN platforms
O-RAN systems and their deployment in virtualized general-purpose computing platforms (O-
Cloud) constitute a paradigm shift expected to bring unprecedented performance gains …
Cloud) constitute a paradigm shift expected to bring unprecedented performance gains …
Optimistic online caching for batched requests
F Faticanti, G Neglia - Computer Networks, 2024 - Elsevier
In this paper, we investigate 'optimistic'online caching policies, distinguished by their use of
future request predictions derived, for example, from machine learning models. Traditional …
future request predictions derived, for example, from machine learning models. Traditional …
Reservation of Virtualized Resources with Optimistic Online Learning
The virtualization of wireless networks enables new services to access network resources
made available by the Network Operator (NO) through a Network Slicing market. The …
made available by the Network Operator (NO) through a Network Slicing market. The …
An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees
The commonly used caching policies, such as LRU or LFU, exhibit optimal performance only
for specific traffic patterns. Even advanced Machine Learning-based methods, which detect …
for specific traffic patterns. Even advanced Machine Learning-based methods, which detect …
No-regret caching with noisy request estimates
Online learning algorithms have been successfully used to design caching policies with
regret guarantees. Existing algorithms assume that the cache knows the exact request …
regret guarantees. Existing algorithms assume that the cache knows the exact request …
Online Caching With Switching Cost and Operational Long-Term Constraints: An Online Learning Approach
The design of effective online caching policies is an increasingly important problem for
content distribution networks, online recommender systems, and edge computing services …
content distribution networks, online recommender systems, and edge computing services …
An Online Caching Scheme for 360-Degree Videos at the Edge
Z Liu, K Cai, J Zhang, N Xin - 2023 IEEE 98th Vehicular …, 2023 - ieeexplore.ieee.org
360-degree videos have gained considerable popularity by offering immersive experiences
to viewers. However, they consume significantly high bandwidth and demand for specialized …
to viewers. However, they consume significantly high bandwidth and demand for specialized …
Caching dynamic contents via mortal restless bandits
A Krishna, C Singh - … on Modeling and Optimization in Mobile …, 2023 - ieeexplore.ieee.org
We study content caching in a network consisting of a server and a base station with a finite-
capacity cache. Contents are dynamic. They stochastically arrive in the system, stay for …
capacity cache. Contents are dynamic. They stochastically arrive in the system, stay for …