• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Teletraffic Congress >Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery
【24h】

Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery

机译：随机动态缓存分区，用于加密内容交付

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：网络内缓存是一种有吸引力的解决方案，可以满足通过Internet传输视频，音频和数据的带宽需求的增长。但是，越来越多的内容交付服务采用通过HTTPS进行加密，这与传统的ISP管理的方法（如透明和代理缓存）不兼容。这就增加了对涉及互联网服务提供商（ISP）和内容提供商（CP）的解决方案的需求：通过设计，该解决方案应一方面保留业务关键的CP信息（例如，内容受欢迎程度，用户偏好），同时允许另一方面，ISP架构（例如5G毫微微小区）中缓存的更深层次集成。在本文中，我们通过考虑内容无关的ISP操作的缓存来解决此问题。 ISP将缓存存储分配给各种内容提供商，以最大程度地节省缓存提供的带宽：主要的新颖之处在于，为了保护关键业务信息，ISP只需要测量各个人的总未命中率即可。 CP和不需要像经典缓存中那样知道请求的对象。我们提出了一种基于扰动随机次梯度法的缓存分配算法，并证明该算法收敛于接近分配的位置，从而使整体缓存命中率最大化。我们使用广泛的模拟来验证算法并评估其在固定和非固定内容受欢迎度下的收敛速度。我们的结果（i）证明了内容可忽略的缓存的可行性，并且（ii）表明，在我们的评估中，所提出的算法可以达到全局最优值的10％之内。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号