{"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}
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.