基于综合因素的P2P流媒体调度算法

Zheng Quan, Wang Peng, L. Jun, Z. Le, Wang Song
{"title":"基于综合因素的P2P流媒体调度算法","authors":"Zheng Quan, Wang Peng, L. Jun, Z. Le, Wang Song","doi":"10.1109/ICBNMT.2009.5348394","DOIUrl":null,"url":null,"abstract":"A comprehensive-factors-based (CFB) scheduling algorithm is proposed for Peer-to-Peer media streaming. In CFB, considering the number of chunks' suppliers and urgency, a priority is defined for each data chunk and the neighbours' bandwidth is effectively evaluated. A peer requests chunks from neighbors according to priorities as well as bandwidth. Simulation results show that the proposed CFB scheduling algorithm for Peer-to-Peer media streaming outperforms conventional scheduling algorithms in peer average throughput, continuity index and start delay.","PeriodicalId":267128,"journal":{"name":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","volume":"172 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Comprehensive-factors-based scheduling algorithm for P2P media streaming\",\"authors\":\"Zheng Quan, Wang Peng, L. Jun, Z. Le, Wang Song\",\"doi\":\"10.1109/ICBNMT.2009.5348394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A comprehensive-factors-based (CFB) scheduling algorithm is proposed for Peer-to-Peer media streaming. In CFB, considering the number of chunks' suppliers and urgency, a priority is defined for each data chunk and the neighbours' bandwidth is effectively evaluated. A peer requests chunks from neighbors according to priorities as well as bandwidth. Simulation results show that the proposed CFB scheduling algorithm for Peer-to-Peer media streaming outperforms conventional scheduling algorithms in peer average throughput, continuity index and start delay.\",\"PeriodicalId\":267128,\"journal\":{\"name\":\"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology\",\"volume\":\"172 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBNMT.2009.5348394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBNMT.2009.5348394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种基于综合因素的点对点媒体流调度算法。在CFB中,考虑到数据块供应商的数量和紧迫性,为每个数据块定义优先级,并有效地评估相邻数据块的带宽。对等体根据优先级和带宽向邻居请求块。仿真结果表明,所提出的点对点媒体流CFB调度算法在对等体平均吞吐量、连续性指数和启动延迟等方面优于传统调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comprehensive-factors-based scheduling algorithm for P2P media streaming
A comprehensive-factors-based (CFB) scheduling algorithm is proposed for Peer-to-Peer media streaming. In CFB, considering the number of chunks' suppliers and urgency, a priority is defined for each data chunk and the neighbours' bandwidth is effectively evaluated. A peer requests chunks from neighbors according to priorities as well as bandwidth. Simulation results show that the proposed CFB scheduling algorithm for Peer-to-Peer media streaming outperforms conventional scheduling algorithms in peer average throughput, continuity index and start delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信