Optimal chunk scheduling algorithm based on taboo search for adaptive live video streaming in CDN-P2P

M. Meskovic, M. Kos, Amir Meskovic
{"title":"Optimal chunk scheduling algorithm based on taboo search for adaptive live video streaming in CDN-P2P","authors":"M. Meskovic, M. Kos, Amir Meskovic","doi":"10.1109/SOFTCOM.2015.7314110","DOIUrl":null,"url":null,"abstract":"With a massive increase in user device heterogeneity, an effective distribution of live video streaming that takes into consideration varying display sizes and processing capabilities of end user devices is becoming a necessity for live multimedia content providers worldwide. In order to answer the challenges of device heterogeneity, an underlying delivery architecture needs to be enhanced so that the best possible quality of video is delivered to the end user in accordance with the end users' device capabilities in a timely and effective fashion. In a primitive video streaming environment that does not take device heterogeneity into consideration, video streaming is based on a single-layered video which uses a scheduling algorithm that ensures timely download of video chunks (i.e. chunks are downloaded before they need to be played back). This paper introduces a model for chunk scheduling algorithm which examines the issue of live video streaming performance optimization as a knapsack NP-hard problem. The proposed scheduling algorithm uses a taboo search method to identify and prioritize chunk delivery in addition to taking bandwidth throughput and delivery ratio into consideration. It optimizes bandwidth utilization by identification of “useless available chunks” by identifying them via chunk playback deadline. With this approach, chunks whose playback deadline has passed as well as those who belong to layers that do not have corresponding lower values will be considered as useless and will be disposed of. Finally, this paper provides simulation results which show that the proposed algorithm significantly performs better than the `primitive' chunk scheduling strategies especially in situations with rigid bandwidth constraints.","PeriodicalId":264787,"journal":{"name":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFTCOM.2015.7314110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

With a massive increase in user device heterogeneity, an effective distribution of live video streaming that takes into consideration varying display sizes and processing capabilities of end user devices is becoming a necessity for live multimedia content providers worldwide. In order to answer the challenges of device heterogeneity, an underlying delivery architecture needs to be enhanced so that the best possible quality of video is delivered to the end user in accordance with the end users' device capabilities in a timely and effective fashion. In a primitive video streaming environment that does not take device heterogeneity into consideration, video streaming is based on a single-layered video which uses a scheduling algorithm that ensures timely download of video chunks (i.e. chunks are downloaded before they need to be played back). This paper introduces a model for chunk scheduling algorithm which examines the issue of live video streaming performance optimization as a knapsack NP-hard problem. The proposed scheduling algorithm uses a taboo search method to identify and prioritize chunk delivery in addition to taking bandwidth throughput and delivery ratio into consideration. It optimizes bandwidth utilization by identification of “useless available chunks” by identifying them via chunk playback deadline. With this approach, chunks whose playback deadline has passed as well as those who belong to layers that do not have corresponding lower values will be considered as useless and will be disposed of. Finally, this paper provides simulation results which show that the proposed algorithm significantly performs better than the `primitive' chunk scheduling strategies especially in situations with rigid bandwidth constraints.
基于禁忌搜索的CDN-P2P自适应直播最优块调度算法
随着用户设备异质性的大量增加,考虑到终端用户设备的不同显示尺寸和处理能力的实时视频流的有效分发正成为全球实时多媒体内容提供商的必要条件。为了应对设备异构的挑战,需要增强底层交付体系结构,以便根据最终用户的设备功能及时有效地向最终用户交付尽可能高质量的视频。在不考虑设备异构性的原始视频流环境中,视频流基于单层视频,使用调度算法确保及时下载视频块(即在需要播放之前下载视频块)。本文介绍了一个块调度算法模型,该模型将实时视频流性能优化问题作为一个背包np难题来研究。该调度算法在考虑带宽吞吐量和投递率的基础上,采用禁忌搜索方法对块投递进行识别和排序。它通过通过块回放截止日期识别“无用的可用块”来识别它们,从而优化带宽利用率。使用这种方法,播放截止日期已过的块以及那些属于没有相应较低值的层的块将被认为是无用的,并将被处理。最后,仿真结果表明,该算法在带宽严格约束的情况下明显优于“原始”块调度策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信