{"title":"P2P文件分发中的调度——关于减少平均分发时间的研究","authors":"Lingjun Ma, K. Lui","doi":"10.1109/CCNC08.2007.121","DOIUrl":null,"url":null,"abstract":"We study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, rarest-piece-first and most-demanding-node-last-piece-oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Scheduling in P2P File Distribution - On Reducing the Average Distribution Time\",\"authors\":\"Lingjun Ma, K. Lui\",\"doi\":\"10.1109/CCNC08.2007.121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, rarest-piece-first and most-demanding-node-last-piece-oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms.\",\"PeriodicalId\":183858,\"journal\":{\"name\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC08.2007.121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC08.2007.121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling in P2P File Distribution - On Reducing the Average Distribution Time
We study in this paper the scheduling problem in P2P file distribution. Our aim is to reduce the average distribution time. We present two distribution mechanisms: distributing the rarest pieces first and distributing to the least demanding nodes first. The new algorithm, rarest-piece-first and most-demanding-node-last-piece-oriented, is developed and we demonstrate by simulation its effectiveness over some related algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
