期刊文献+

应用网络编码的P2P内容分发 预览 被引量:5

P2P Content Distribution with Network Coding
在线阅读 下载PDF
分享 导出
摘要 讨论如何在P2P内容分发系统中应用网络编码技术,结论是网络编码能简化P2P内容分发中的Piece Selection算法的复杂度,提高网络资源的利用率.但是,网络编码必须结合较好的NeighborSelection和Choking/Unchoking机制,否则,其优势将无从体现.同时,还详细描述在P2P内容分发中如何应用网络编码技术,并逐一讨论应用过程中所涉及到的主要问题.为了证明基于网络编码的P2P内容分发系统的可行性,在单机上实现主要的编、解码算法,分析其对系统资源的消耗.实验的结果是如果一个peer的上载速率为50KBps,则编码操作导致的CPU占用率为2.25%,相应的内存开销在20MB左右.这些数据说明网络编码的系统开销是较轻的,基于网络编码的P2P内容分发系统是完全可行的. Network coding is a field of information theory and coding theory and is a method of attaining maximum information flow in a network. Many researchers believe that network coding could help improve P2P network performance. But some other researchers still hold their views on this issue. Discussed here is the application of network coding to PgP content distribution system. It is concluded that network coding can be used to reduce the complexity of the piece selection in P2P content distribution, and to increase the utilization of the network resource. However, without being combined with good neighbor selection and choking/unchoking, its advantage can not be realized. Meanwhile, how to apply network coding to the P2P content distribution system is presented in detail with further discussion about primary imple.mentation problems. To verify the feasibility of P2P content distribution system based on network coding, the main coding and decoding operation of network coding is implemented, and its system resource consumption is analyzed. Results are as follows: The coding operation consumes 2. 25% of the CPU resource and 20 MB of the memory resource while the upload rate is 50 KBps. It is indicated that the system consumption of network coding is relatively low, and it is completely feasible to apply network coding to the P2P content distribution.
作者 雷迎春 程实 吴产乐 龚奕利 康勍 Lei Yingchun, Cheng Shi, Wu Chanle , Gong Yi, and Kang Qing(School of Computer Science, Wuhan University, Wuhan 430079;Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190;Wuhan Branch, China Telecom Corporation Limited, Wuhan 430071)
出处 《计算机研究与发展》 EI CSCD 北大核心 2009年第1期 108-119,共12页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60773058,60672051)
关键词 P2P内容分发 网络编码 ShareStorm BITTORRENT 性能 P2P content distribution network coding ShareStorm BitTorrent performance
作者简介 (leiyc@ict.ac.cn)雷迎春,1973年生,博士,副研究员,主要研究方向为计算机网络、高性能服务器系统、分布式系统和P2P系统. 程实,1983年生,博士研究生,主要研究方向为P2P计算与网络编码. 吴产乐,1945年生,教授,博士生导师,主要研究方向为削络计算与网络多媒体. 龚奕利,1976年生,博士后,主要研究方向为网格系统、P2P系统和无线网络技术. 康勃,1973年生,工程师,主要研究方向为分布式系统和P2P系统.
  • 相关文献

参考文献16

  • 1Ben R. ISP's battle against encrypted BitTorrent downloading [OL]. [2006-09-02]. http://www. afterdawn. com/news/archive/7896.cfm 被引量:1
  • 2雷迎春,阳立堂,姜琦,龚奕利,张军,度量和分析BitTorrent[J].计算机研究与发展,2008,45(9):1589-1600. 被引量:3
  • 3Bharambe A, Herley C, Padmanabhan V. Analyzing and improving bittorrent performance [C] //Proc of the IEEE Conf on Computer Communications. New York: IEEE, 2006:2884-2895 被引量:1
  • 4Li S -Y R, Yeung R W, Cai N. Linear network coding [J]. IEEE Trans on Information Theory, 2003, 49(2): 371-381 被引量:1
  • 5Chun B G, Wu P, Weatherspoon H, et al. ChunkCast: An anyeast service for large scale content distribution [OL]. [2006-12-19]. http://iptps06. cs. uesb. edu/papers/Chunehunkcast06. pdf 被引量:1
  • 6Ho T, Koetter R, Medard M, et al. The benefits of coding over routing in a randomized setting [C]//Proc of the IEEE Int Symp on Information Theory. New York: IEEE, 2003: 442-447 被引量:1
  • 7Ahlswede R, Cai N, Li S R, et al. Network information flow [J]. IEEE Trans on Information Theory, 2000, 46(4) : 1204-1216 被引量:1
  • 8Sander P, Egner S, Tolhuizen L. Polynomial time algorithms for network information flow [C] // Proc of the 15th ACM Syrup on Parallel Algorithms and Architectures (SPAA). New York: ACM, 2003:286-294 被引量:1
  • 9Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for network code construction [J]. IEEE Trans on Information Theory, 2005, 51(6) : 1973-1982 被引量:1
  • 10Widmer J, Fragouli C, LeBoudec J Y. Energy efficient broadcasting in wireless ad hoc networks [C] //Proc of the 1st Workshop Network Coding, Theory, and Applications. New York: ACM, 2005:897-910 被引量:1

二级参考文献22

  • 1周文莉,雷振明,BitTorrent文件共享系统的流量模型与文件评估方法[J].计算机工程,2006,32(13):15-17. 被引量:9
  • 2Cooper C.On the distribution of rank of a random matrix over a finite field[J].Random Struct.Algorithms,2000,17(3-4):197-212. 被引量:1
  • 3Stoica I,Morris R,Karger D,et al.Chord:a scalablepeer-to-peer lookup service for internet applications[C]//ACM SIGCOMM 2001.2001. 被引量:1
  • 4Ahlswede R,Cai N,Li S R,et al.Network information flow[J].IEEE Trans.on Information Theory,2000,46(4):1 204-1 216. 被引量:1
  • 5Ho T,Koetter R,Medard M,et al.The benefits of coding over routing in a randomized setting[C]//Proc.ISIT2003.2003. 被引量:1
  • 6Chou P A,Wu Y,Jain K.Practical network coding[C] //Allerton Conference on Communication,Control and Computing.Monticello,2003. 被引量:1
  • 7Gkantsidis C,Rodriguez P.Network coding for large scale content distribution[C] // Proc.INFOCOM.Miami,2005. 被引量:1
  • 8Wang M,Li B.How practical is network coding?[C] //14th IEEE International Workshop on Quality of Service 2006.Yale University,New Haven,Connecticut,2006. 被引量:1
  • 9Ben R. ISP's battle against encrypted BitTorrent downloading [OL]. [2006-09-02]. http://www.afterdawn. com/news/archive/7896. cfm 被引量:1
  • 10Cohen B. Incentives build robustness in BitTorrent [OL]. 1-2006-09-02]. http//www.bittorrent.org/bittorrentecon. pdf 被引量:1

共引文献12

同被引文献39

  • 1张明龙,冯博琴,王雪平,并发多媒体服务系统超载模型分析[J].西安交通大学学报,2006,40(2):161-164. 被引量:1
  • 2赵翔,郝林,数字水印综述[J].计算机工程与设计,2006,27(11):1946-1950. 被引量:40
  • 3马冠骏,许胤龙,林明宏,宣颖,基于网络编码的P2P内容分发性能分析[J].中国科学技术大学学报,2006,36(11):1237-1240. 被引量:11
  • 4Ahlswede R, Cai N, Li Shuoyan, et al. Network information flow [J]. IEEE Trans on Information Theory, 2000, 46(4) :1204-1216. 被引量:1
  • 5Li S Y R, Yeung R W, Cai N. Linear network coding [J]. IEEE Trans on Information Theory, 2003, 49(2) : 371-381. 被引量:1
  • 6Koetter R, Medard M. An algebraic approach to network coding [J]. IEEE/ACM Trans on Networking, 2003, 11(5) : 782-795. 被引量:1
  • 7Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for muhicast network code construction [J]. IEEETrans on Information Theory, 2005, 51(6): 1973- 1982. 被引量:1
  • 8Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast [J]. IEEE Trans on Information Theory, 2006, 52(10): 4413-4430. 被引量:1
  • 9Chachulski S, Jennings M, Katti S, et al. Trading structure for randomness in wireless opportunistic routing [C]//Proc of the Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, CA: ACM, 2007:169-180. 被引量:1
  • 10Katti S, Rahul H, Hu W, et al. XORs in the air: Practical wireless network coding [J]. IEEE/ACM Trans on Networking, 2008, 16(3): 497-510. 被引量:1

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部 意见反馈