A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming

Hiroki Okada, Takayuki Shiroma, Celimuge Wu, T. Yoshinaga
{"title":"A Color-Based Cooperative Caching Strategy for Time-Shifted Live Video Streaming","authors":"Hiroki Okada, Takayuki Shiroma, Celimuge Wu, T. Yoshinaga","doi":"10.1109/CANDARW.2018.00030","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDARW.2018.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

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.
基于颜色的时移实时视频流协同缓存策略
本文提出了一种有效的网络内缓存策略,以减少伪直播视频流网络的流量。伪直播是一种技术,它将视频数据记录为缓存服务器中的碎片文件,并通过连续组合碎片来再现它们。录制的视频数据可以被视为静态视频文件。因此,网络内缓存技术可以通过仔细管理缓存服务器和重要内容的安排来有效地减少网络流量。提出的网络内缓存策略在考虑数据新鲜度的情况下,以分布式缓存服务器之间的协作方式缓存流行的分块视频片段。我们扩展了一种基于颜色的合作缓存算法,该算法最近被提出用于内容交付网络,以有效地处理时移视频块。扩展策略根据实时流的数据生成及其多个视频质量结构,在开始内容交付之前确定最佳缓存位置。在我们的实验中,根据接入概率和通信跳数来计算流量,并选择一种内容安排,使网络中的总通信距离最小。我们对一个三层分层结构网络进行了网络模拟,该网络的流量模式是由伽马分布的内容访问概率生成的。仿真结果表明,与传统的LRU和LFU方法相比,该方法的流量分别减少了50%和40%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信