arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.12468cs.NI
收藏

基于 restless 多臂老虎机的动态内容实时缓存

Fresh Caching of Dynamic Contents using Restless Multi-armed Bandits

Ankita Koley, Chandramani Singh

AI总结:

针对动态内容缓存中基站仅掌握部分版本年龄信息、需最小化获取与老化成本的问题,提出基于连续时间restless多臂老虎机的Whittle指数策略,仿真验证其最优性。

摘要:

我们研究了一个动态内容缓存问题:内容在中央服务器更新,基站(BS)关联的本地缓存存储部分内容的本地副本。当内容请求到达时,基站根据内容是否在本地缓存,决定从中央服务器获取内容或从本地缓存提供缓存版本。获取内容产生固定的获取成本,提供缓存版本产生与内容版本年龄(AoV)成比例的老化成本。基站仅掌握内容AoV的部分信息。我们将最优内容获取与缓存问题建模为在缓存容量约束下最小化平均成本的问题。该问题存在维度灾难,且已被证明难以求解。我们将其建模为连续时间 restless 多臂老虎机过程(RMAB),其中对应RMAB的单内容问题是部分可观测马尔可夫决策过程。我们将单内容问题重构为半马尔可夫决策过程,证明其可索引性,并提供基于Whittle指数的解决方案。最后,我们将性能与近期工作比较,通过仿真表明所提策略是最优的。

英文摘要:

We consider a dynamic content caching problem wherein the contents get updated at a central server, and local copies of a subset of contents are cached at a local cache associated with a Base station (BS). When a content request arrives, based on whether the content is in the local cache, the BS can decide whether to fetch the content from the central server or serve the cached version from the local cache. Fetching a content incurs a fixed fetching cost, and serving the cached version incurs an ageing cost proportional to the age-of-version (AoV) of the content. The BS has only partial information regarding AoVs of the contents. We formulate an optimal content fetching and caching problem to minimize the average cost subject to cache capacity constraints. The problem suffers from the curse of dimensionality and is provably hard to solve. We formulate this problem as a continuous time restless multi-armed bandit process (RMAB), where a single content problem of the corresponding RMAB is a partially observable Markov decision process. We reformulate the single content problem as a semi-Markov decision process, prove indexability, and provide a Whittle index based solution to this problem. Finally, we compare the performance with recent work and show that our proposed policy is optimal via simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑