首页> 外文会议>2010 IEEE Global Telecommunications Conference >Popularity-Aware Caching Algorithm for Video-on-Demand Delivery over Broadband Access Networks
【24h】

Popularity-Aware Caching Algorithm for Video-on-Demand Delivery over Broadband Access Networks

机译:宽带访问网络上的视频点播的流行度感知缓存算法

获取原文

摘要

Video on Demand (VoD) service is regarded as one of the most promising services over increasingly deployed next generation broadband access networks. The distributed server architecture, in which the popular content is cached at a location closer to the viewer, is a widely used methodology to optimize the transport capacity of VoD delivery. However, due to the dynamic (change with time) nature of movie popularity distribution, identifying the popular content and updating the cache servers accordingly is not straightforward. In this paper, using a novel caching architecture for Passive Optical Networks (PON), we discuss the need for a fast caching algorithm that can respond to time changing movie popularity distribution, and we propose a novel Last-k caching algorithm, which identifies the popular content using the most recent statistics. The proposed algorithm estimates movie popularity using most recent inter-arrival times of movie requests and updates the cache accordingly such that the most popular content at any given time would reside in the cache. Simulations indicate that the proposed algorithm out-performs existing algorithms by effectively responding to the dynamic nature of movie popularity distribution.
机译:视频点播(VoD)服务被视为在日益部署的下一代宽带接入网络上最有前途的服务之一。流行的内容被缓存在更靠近观看者的位置的分布式服务器体系结构,是一种用于优化VoD交付的传输能力的广泛使用的方法。但是,由于电影受欢迎程度分布的动态(随时间变化)性质,识别受欢迎的内容并相应地更新缓存服务器并不是一件容易的事。本文使用无源光网络(PON)的新型缓存体系结构,讨论了对可响应时变电影受欢迎程度分布的快速缓存算法的需求,并提出了一种新颖的Last-k缓存算法,该算法可识别使用最新统计信息的热门内容。所提出的算法使用电影请求的最新到达间隔时间来估计电影受欢迎程度,并相应地更新缓存,以使任何给定时间的最受欢迎内容将驻留在缓存中。仿真表明,该算法通过有效响应电影流行度分布的动态特性,优于现有算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号