Tile-based Caching Optimization for 360° Videos

Georgios Papaioannou, I. Koutsopoulos
{"title":"Tile-based Caching Optimization for 360° Videos","authors":"Georgios Papaioannou, I. Koutsopoulos","doi":"10.1145/3323679.3326515","DOIUrl":null,"url":null,"abstract":"Panoramic, or 360° video streaming and playback are prime components of mixed-reality and panoramic movie-viewing experiences, they offer an immersive viewing experience, and they are becoming increasingly popular, albeit very resource-demanding. Caching of 360° video content at caches close to the user reduces content delivery delay and bandwidth consumption. In 360° video streaming, the recently proposed tiling approach allows the streaming of different parts (tiles) of the 360° content at different resolutions as opposed to monolithic single-stream transmission. We study the problem of optimal caching of 360° video streams. The difference from conventional video is that each tile may need to be cached simultaneously at multiple resolutions, since it may appear in different positions at different viewports, and the time proportions of these positions are dictated by users' viewing statistics. For example, a tile close to the center of a viewport must have high resolution, while the same tile close to the edge of another viewport can have low resolution. This leads us to a novel caching objective. Cached resolutions for each tile should be as close as possible to the required ones for each tile, according to tile viewing statistics. We study the cases of caching tile streams at different resolutions or in a layered encoding fashion. We seek to optimize an objective that combines (i) an error metric between requested and cached tile resolutions across viewports, and (ii) coverage of the tile set. For the case of multiple resolutions, we show that the problem of selecting the tile resolutions to cache so as to minimize the error metric above is equivalent to the K-Medoids problem. For layered encoding, the problem is to find the maximum-resolution layer to cache for each tile stream, and this is equivalent to a Multiple-Choice Knapsack problem. We present an implementation of the cache optimization scheme, we evaluate our model on a tiled 360° video distribution simulator and demonstrate a significant increase in cache hit ratio over conventional caching strategies.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3323679.3326515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

Panoramic, or 360° video streaming and playback are prime components of mixed-reality and panoramic movie-viewing experiences, they offer an immersive viewing experience, and they are becoming increasingly popular, albeit very resource-demanding. Caching of 360° video content at caches close to the user reduces content delivery delay and bandwidth consumption. In 360° video streaming, the recently proposed tiling approach allows the streaming of different parts (tiles) of the 360° content at different resolutions as opposed to monolithic single-stream transmission. We study the problem of optimal caching of 360° video streams. The difference from conventional video is that each tile may need to be cached simultaneously at multiple resolutions, since it may appear in different positions at different viewports, and the time proportions of these positions are dictated by users' viewing statistics. For example, a tile close to the center of a viewport must have high resolution, while the same tile close to the edge of another viewport can have low resolution. This leads us to a novel caching objective. Cached resolutions for each tile should be as close as possible to the required ones for each tile, according to tile viewing statistics. We study the cases of caching tile streams at different resolutions or in a layered encoding fashion. We seek to optimize an objective that combines (i) an error metric between requested and cached tile resolutions across viewports, and (ii) coverage of the tile set. For the case of multiple resolutions, we show that the problem of selecting the tile resolutions to cache so as to minimize the error metric above is equivalent to the K-Medoids problem. For layered encoding, the problem is to find the maximum-resolution layer to cache for each tile stream, and this is equivalent to a Multiple-Choice Knapsack problem. We present an implementation of the cache optimization scheme, we evaluate our model on a tiled 360° video distribution simulator and demonstrate a significant increase in cache hit ratio over conventional caching strategies.
基于磁贴的缓存优化360°视频
全景或360度视频流和播放是混合现实和全景观影体验的主要组成部分,它们提供了身临其境的观影体验,尽管非常需要资源,但它们正变得越来越受欢迎。在靠近用户的缓存处缓存360°视频内容,减少了内容传输延迟和带宽消耗。在360°视频流中,最近提出的平铺方法允许以不同分辨率对360°内容的不同部分(平铺)进行流传输,而不是单片流传输。研究了360°视频流的最优缓存问题。与传统视频的不同之处在于,每个贴片可能需要以多种分辨率同时缓存,因为它可能在不同的视口出现在不同的位置,而这些位置的时间比例是由用户的观看统计决定的。例如,靠近视口中心的贴图必须具有高分辨率,而靠近另一个视口边缘的相同贴图可能具有低分辨率。这就引出了一个新的缓存目标。根据磁贴查看统计数据,每个磁贴的缓存分辨率应该尽可能接近所需的分辨率。我们研究了以不同分辨率或分层编码方式缓存tile流的情况。我们寻求优化一个目标,它结合了(i)请求和缓存的贴图分辨率之间的误差度量,以及(ii)贴图集的覆盖率。对于多分辨率的情况,我们表明选择要缓存的贴图分辨率以最小化上述误差度量的问题相当于k - mediids问题。对于分层编码,问题是为每个图层流找到最大分辨率层来缓存,这相当于一个多选题背包问题。我们提出了一个缓存优化方案的实现,我们在平铺360°视频分发模拟器上评估了我们的模型,并证明了与传统缓存策略相比,缓存命中率显着增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信