Optimized packet scheduling for live streaming on peer-to-peer network with network coding

Shenglan Huang, E. Izquierdo, Pengwei Hao
{"title":"Optimized packet scheduling for live streaming on peer-to-peer network with network coding","authors":"Shenglan Huang, E. Izquierdo, Pengwei Hao","doi":"10.1109/ICCW.2015.7247394","DOIUrl":null,"url":null,"abstract":"This paper proposed an optimized packet scheduling algorithm for live peer-to-peer streaming system, where network coding technique is extended to improve the efficiency in bandwidth utilization. We identify a problem of undesirable non-innovative packet transmission due to the latency of buffer-map update among peers, which, with many previous proposed techniques, yields to bandwidth inefficiencies. In the proposed system, we present an optimized packet scheduling algorithm for forecasting the number of required packets at parent nodes in advance, a selection mechanism for selecting and encoding packets for forwarding, and an adaptive push algorithm for smart frame skipping. The proposed optimized packet scheduling algorithm calculates the minimum number of required packets for full rate transmission. Transmitting as the scheduled results can reduce non-innovative packet transmission, save limited bandwidth for innovative transmission, thereby improving the streaming continuity. The simulation results show that the proposed scheme provides significantly better video quality, delivery ratio, lower redundancy rate, and higher innovative video packet rate compared with previous packet scheduling algorithms.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposed an optimized packet scheduling algorithm for live peer-to-peer streaming system, where network coding technique is extended to improve the efficiency in bandwidth utilization. We identify a problem of undesirable non-innovative packet transmission due to the latency of buffer-map update among peers, which, with many previous proposed techniques, yields to bandwidth inefficiencies. In the proposed system, we present an optimized packet scheduling algorithm for forecasting the number of required packets at parent nodes in advance, a selection mechanism for selecting and encoding packets for forwarding, and an adaptive push algorithm for smart frame skipping. The proposed optimized packet scheduling algorithm calculates the minimum number of required packets for full rate transmission. Transmitting as the scheduled results can reduce non-innovative packet transmission, save limited bandwidth for innovative transmission, thereby improving the streaming continuity. The simulation results show that the proposed scheme provides significantly better video quality, delivery ratio, lower redundancy rate, and higher innovative video packet rate compared with previous packet scheduling algorithms.
利用网络编码优化了点对点网络直播的数据包调度
本文针对实时点对点流系统提出了一种优化的分组调度算法,该算法扩展了网络编码技术,提高了带宽利用效率。我们确定了由于对等体之间缓冲映射更新延迟而导致的不受欢迎的非创新数据包传输问题,这与许多先前提出的技术一样,导致带宽效率低下。在该系统中,我们提出了一种优化的数据包调度算法,用于提前预测父节点所需的数据包数量,一种选择机制,用于选择和编码用于转发的数据包,以及一种自适应推送算法,用于智能跳帧。优化后的包调度算法计算全速率传输所需的最小包数。按预定结果传输可以减少非创新分组的传输,节省有限的带宽用于创新传输,从而提高流的连续性。仿真结果表明,与现有的分组调度算法相比,该方案具有更好的视频质量、更高的传输率、更低的冗余率和更高的创新视频包率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信