论文标题

用于分类内容的连续请求的缓存分配:服务提供商的观点

Cache Allocations for Consecutive Requests of Categorized Contents: Service Provider's Perspective

论文作者

Choi, Minseok, Molisch, Andreas F., Han, Dong-Jun, Kim, Joongheon, Moon, Jaekyun

论文摘要

在无线缓存网络中,用户通常具有在特定优先类别中食用内容的具体目的,并要求多个内容。尽管有关无线缓存和交付的大多数现有研究仅集中在一次性请求上,但所请求的内容的普及分布肯定与单次请求肯定不同,但尚未考虑。同样,尤其是从服务提供商的角度来看,用户消耗尽可能多的内容是有利的。因此,本文提出了针对分类内容和连续用户需求的两个缓存分配策略,它们最大化1)缓存命中率和2)连续内容消耗的数量。数值结果显示了分类的内容和连续内容请求如何对缓存分配产生影响。

In wireless caching networks, a user generally has a concrete purpose of consuming contents in a certain preferred category, and requests multiple contents in sequence. While most existing research on wireless caching and delivery has focused only on one-shot requests, the popularity distribution of contents requested consecutively is definitely different from the one-shot request and has been not considered. Also, especially from the perspective of the service provider, it is advantageous for users to consume as many contents as possible. Thus, this paper proposes two cache allocation policies for categorized contents and consecutive user demands, which maximize 1) the cache hit rate and 2) the number of consecutive content consumption, respectively. Numerical results show how categorized contents and consecutive content requests have impacts on the cache allocation.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源