用于加密内容分发的随机动态缓存划分
Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery
摘要：
网内缓存是一种很有吸引力的解决方案，以应付日益增长的带宽需求的视频，音频和数据传输在互联网上。尽管如此，越来越多的内容交付服务通过HTTPS进行加密，这与传统的ISP管理方法（如透明和代理缓存）不兼容。这就提出了对涉及互联网服务提供商（ISP）和内容提供方（CP）的解决方案的需求：通过设计，解决方案应该保留关键业务CP信息（例如，内容流行度，用户偏好），同时允许高速缓存在ISP体系结构中的更深集成（例如，在5G毫微微小区中）。在本文中，我们解决这个问题，考虑内容无关的ISP运营的缓存。ISP将缓存存储分配给各个内容提供方，以便最大限度地节省缓存提供的带宽：主要的新颖性在于，为了保护业务关键信息，ISP只需要测量各个CP的聚合未命中率，而不需要像传统缓存那样知道所请求的对象。我们提出了一种基于扰动随机次梯度方法的缓存分配算法，并证明了该算法收敛于最大化整体缓存命中率的分配。我们使用大量的模拟来验证算法，并评估其收敛速度下固定和非固定的内容流行。我们的结果（i）证明了内容无关缓存的可行性和（ii）表明，所提出的算法可以实现在10%以内的全球最优在我们的评估。
英文摘要：
In-network caching is an appealing solution to cope with the increasing bandwidth demand of video, audio and data transfer over the Internet. Nonetheless, an increasing share of content delivery services adopt encryption through HTTPS, which is not compatible with traditional ISP-managed approaches like transparent and proxy caching. This raises the need for solutions involving both Internet Service Providers (ISP) and Content Providers (CP): by design, the solution should preserve business-critical CP information (e.g., content popularity, user preferences) on the one hand, while allowing for a deeper integration of caches in the ISP architecture (e.g., in 5G femto-cells) on the other hand. In this paper we address this issue by considering a content-oblivious ISP-operated cache. The ISP allocates the cache storage to various content providers so as to maximize the bandwidth savings provided by the cache: the main novelty lies in the fact that, to protect business-critical information, ISPs only need to measure the aggregated miss rates of the individual CPs and do not need to be aware of the objects that are requested, as in classic caching. We propose a cache allocation algorithm based on a perturbed stochastic subgradient method, and prove that the algorithm converges close to the allocation that maximizes the overall cache hit rate. We use extensive simulations to validate the algorithm and to assess its convergence rate under stationary and non-stationary content popularity. Our results (i) testify the feasibility of content-oblivious caches and (ii) show that the proposed algorithm can achieve within 10\% from the global optimum in our evaluation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
