Downton abbey without the hiccups: buffer-based rate adaptation for HTTP video streaming

Te-Yuan Huang, Ramesh Johari, N. McKeown
{"title":"Downton abbey without the hiccups: buffer-based rate adaptation for HTTP video streaming","authors":"Te-Yuan Huang, Ramesh Johari, N. McKeown","doi":"10.1145/2491172.2491179","DOIUrl":null,"url":null,"abstract":"Recent work has shown how hard it is to pick a video streaming rate. Video service providers use heuristics to estimate the network capacity leading to unnecessary rebuffering events and suboptimal video quality. This paper argues that we should do away with estimating network capacity, and instead directly observe and control the playback buffer. We present a class of rate selection algorithms that allow us to optimize the delivered video quality while provably never unnecessarily rebuffering. Our algorithms work with discrete video rates, video chunking and for both CBR and VBR video codecs.","PeriodicalId":130413,"journal":{"name":"Proceedings of the 2013 ACM SIGCOMM workshop on Future human-centric multimedia networking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"123","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2013 ACM SIGCOMM workshop on Future human-centric multimedia networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2491172.2491179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 123

Abstract

Recent work has shown how hard it is to pick a video streaming rate. Video service providers use heuristics to estimate the network capacity leading to unnecessary rebuffering events and suboptimal video quality. This paper argues that we should do away with estimating network capacity, and instead directly observe and control the playback buffer. We present a class of rate selection algorithms that allow us to optimize the delivered video quality while provably never unnecessarily rebuffering. Our algorithms work with discrete video rates, video chunking and for both CBR and VBR video codecs.
没有打嗝的唐顿庄园:HTTP视频流的基于缓冲的速率适应
最近的研究表明,选择一个视频流传输速率是多么困难。视频服务提供商使用启发式方法来估计导致不必要的再缓冲事件和次优视频质量的网络容量。本文认为我们不应该估计网络容量,而应该直接观察和控制回放缓冲区。我们提出了一类速率选择算法,使我们能够优化交付的视频质量,同时证明不会不必要地重新缓冲。我们的算法适用于离散视频速率、视频分块以及CBR和VBR视频编解码器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信