A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming
A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming
复制标题
DOI：
10.1109/candarw.2018.00030
复制
发表时间：
2018-11
期刊：
影响因子：
--
通讯作者：
Hiroki Okada;Takayuki Shiroma;Celimuge Wu;T. Yoshinaga
中科院分区：
文献类型：
--
作者：
Hiroki Okada;Takayuki Shiroma;Celimuge Wu;T. Yoshinaga
本文提出了一种有效的网络内缓存策略来减少伪直播视频流网络的流量。伪直播是一种将视频数据作为碎片文件记录在缓存服务器中，并通过不断组合碎片来再现它们的技术。录制的视频数据可以视为静态视频文件。因此，网络内缓存技术可以通过仔细管理缓存服务器和重要内容的安排来有效地减少网络流量。所提出的网络内缓存策略尝试以分布式缓存服务器之间的协作方式缓存流行的分块视频片段，同时考虑到数据的新鲜度。我们扩展了最近为内容交付网络提出的基于颜色的协作缓存算法，以有效地处理时移视频块。扩展策略根据数据的生成及其实时流的多种视频质量结构，在开始内容交付之前确定最佳缓存放置。在我们的实验中，根据访问概率和通信跳数来计算流量，并选择内容安排以使网络中的总通信距离变得最小。我们使用根据三层分层结构网络的伽玛分布的内容访问概率生成的流量模式进行网络模拟。仿真结果表明，与传统的LRU和LFU方法相比，流量分别减少了50%和40%。
This paper proposes an efficient in-network caching strategy to reduce traffic volume for pseudo-live video streaming networks. Pseudo-live streaming is a technique that records video data as fragmented files in a cache server and reproduces them by continuously combining the fragments. The recorded video data can be treated as static video files. Therefore, in-network caching techniques could efficiently reduce network traffic by carefully managing cache servers and important contents arrangement. The proposed in-network caching strategy tries to cache popular chunking video fragments with taking account of the freshness of the data in a cooperative way among distributed cache servers. We extend a color-based cooperative cache algorithm, which is recently proposed for contents delivery networks, to effectively treat time-shifting video chunks. The extension strategy determines an optimal cache placement before starting content delivery based on the generation of the data and its multiple video quality structures of the real-time streaming. In our experiment, traffic volume is calculated from access probability and the number of hops of communication, and a content arrangement is selected in such a way that the total communication distance in the network becomes the smallest. We conduct a network simulation with traffic patterns that are generated from content access probability of gamma distribution for a three-layer hierarchical structure network. Simulation results show that the traffic volume is reduced up to 50% and 40% compared with conventional LRU and LFU methods, respectively.