{"title":"雪崩:一个网络编码分析","authors":"R. Yeung","doi":"10.4310/CIS.2007.V7.N4.A3","DOIUrl":null,"url":null,"abstract":"In this paper, we study the application of random network coding in peer-to-peer (P2P) networks. The system we analyze is based on a prototype called Avalanche proposed in [8] for large scale content distribution on such networks. We present the necessary techniques for analyzing the system and show that random network coding provides the system with both maximum bandwidth efficiency and robustness. We also point out that the model for random network coding in P2P networks is very different from the one that has been studied extensively in the literature.","PeriodicalId":45018,"journal":{"name":"Communications in Information and Systems","volume":"7 1","pages":"353-358"},"PeriodicalIF":0.6000,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"Avalanche: A Network Coding Analysis\",\"authors\":\"R. Yeung\",\"doi\":\"10.4310/CIS.2007.V7.N4.A3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the application of random network coding in peer-to-peer (P2P) networks. The system we analyze is based on a prototype called Avalanche proposed in [8] for large scale content distribution on such networks. We present the necessary techniques for analyzing the system and show that random network coding provides the system with both maximum bandwidth efficiency and robustness. We also point out that the model for random network coding in P2P networks is very different from the one that has been studied extensively in the literature.\",\"PeriodicalId\":45018,\"journal\":{\"name\":\"Communications in Information and Systems\",\"volume\":\"7 1\",\"pages\":\"353-358\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2007-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications in Information and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/CIS.2007.V7.N4.A3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Information and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/CIS.2007.V7.N4.A3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
In this paper, we study the application of random network coding in peer-to-peer (P2P) networks. The system we analyze is based on a prototype called Avalanche proposed in [8] for large scale content distribution on such networks. We present the necessary techniques for analyzing the system and show that random network coding provides the system with both maximum bandwidth efficiency and robustness. We also point out that the model for random network coding in P2P networks is very different from the one that has been studied extensively in the literature.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
