P2P节点智能选择机制的研究与实现

计算机应用 ›› 2011, Vol. 31 ›› Issue (02): 293-297.

• 网络与通信 • 下一篇

P2P节点智能选择机制的研究与实现

陈兴蜀¹,林大云²,王文贤³

1. 四川大学计算机学院
2. 四川大学计算机学院网络与可信计算研究所
3. 四川大学信息安全研究所

收稿日期:2010-08-06 修回日期:2010-09-19 发布日期:2011-02-01 出版日期:2011-02-01
通讯作者: 林大云
基金资助:
国家重点基础研究发展计划（973计划）;国家信息安全战略研究与标准制定工作项目“P2P应用安全相关标准研究”

Research and implementation of intelligent selection mechanism in P2P

Received:2010-08-06 Revised:2010-09-19 Online:2011-02-01 Published:2011-02-01

摘要/Abstract

摘要： 对对等网络（P2P）的流量问题进行了分析，指出P2P流量问题产生的原因。融合网络运营商、地理位置等信息，提出了一种节点智能选择机制。该机制优先选择属于相同运营商和地理位置接近的节点作为数据交换对象，最大限度地将数据流量控制在本地网络和同一运营商的网络中，从而减少骨干网和网络出口的负载，同时提高了数据传输性能。在Bit Torrent (BT)系统中融合智能选择机制后，Tracker智能选择的节点在往返时延、路由跳数上均得到优化，实验数据表明该机制能有效减少“流量旅行”，提高P2P传输效率。

关键词: 对等网络, Tracker, 流量控制, 智能

Abstract: P2P traffic problem was analyzed to point out the reasons of P2P traffic problem firstly. Then the information of Internet Service Provider (ISP) and geographic position was used to design an intelligent node selection mechanism. In this mechanism, one node chose nodes which belonged to the same ISP and were in geographical proximity to the objects for exchanging data, so the mechanism could control the data flow in the local network and the same ISPs network to the greatest extent, thus reducing the network load, and improving data transmission performance. To prove the validity of intelligent node selection mechanism, RoundTrip Time (RTT) and number of hops were tested. The simulation results show that the mechanism can effectively reduce the "flow travel" and improve the P2P transmission efficiency.

Key words: PeertoPeer (P2P), Tracker, flow control, intelligent

陈兴蜀林大云王文贤. P2P节点智能选择机制的研究与实现[J]. 计算机应用, 2011, 31(02): 293-297.

参考文献

[1]COHEN B.The BitTorrent protocol specification［EB/OL］. ［2010-01-01］. http://www.bittorrent.org/beps/bep_0003.htm
[2]Ipoque company.Ipoque internet study 2007 abstract［EB/OL］.［2010-01-01］.http://www.ipoque.com/resources/internetstudies/internetstudy2007
[3]WANG RUI.[J].LIU YANG, YANG YUEXIANG,et al. Solving the applevel classification problem of P2P traffic via optimized support vector machines[C]// Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications. Washington, DC: IEEE Computer Society,2006,:-
[4]CONSTANTINOU F,MAVROMMATIS P.Identifying known and unknown peertopeer traffic［C］// Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications. Washington, DC: IEEE Computer Society,2006: 93-102
[5]KARAGIANNIS T.[J].BROIDO A, FALOUTSOS M.Transport layer identification of P2P traffic[C]// Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement. New York:ACM,2004,:-
[6]WIERZBICKI A.[J].LEIBOWITZ N ,RIPEANU M,et al. Cache replacement policies revisited: the case of P2P traffic [C]// Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid. Washington, DC: IEEE Computer Society,2004,:-
[7]SALEH O,HEFEEDA M.Modeling and caching of peertopeer traffic［C］// ICNP06: Proceedings of the 2006 14th IEEE International Conference. Washington, DC: IEEE Computer Society,2006: 249-258
[8]XIE HAIYONG,KRISHNAMURTHY A, SILBERSCHATZ A, et al.P4P: Explicit communications for cooperative control between P2P and network providers［EB/OL］. ［2010-01-01］. http://www.dcia.info/documents/P4P_Overview.pdf
[9]XIE HAIYONG, YANG Y R, KRISHNAMURTHY A, et al.P4P: Provider portal for (P2P) applications［EB/OL］.［2010-01-01］. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.143.5641&rep=rep1&type=pdf
[10]LI WEI.[J].CHEN SANZHI, YUTAO. UTAPS: An underlying topologyaware peer selection algorit hm in BitTorrent [C]//Proceedings of 22nd International Conference on Advanced Information Networking and Applications. Washington, DC: IEEE Computer Society,2008,:-
[11]eMule ［EB/OL］.［2010-01-01］. http://www.emuleproject.net/home/perl/general.cgi?l=1
[12]MAYMOUNKOV P, KADEMLIA M D.A peertopeer information system based on the XOR metric ［EB/OL］.［2010-01-01］. http://pdos.csail.mit.edu/~petar/papers/maymounkovkademlialncs.pdf
[13]SALAS J.[J].PEREZSORROSAL F, PATINOMARTINEZ M, et al. WSreplication: a framework for highly available Web services [C]// Proceedings of the 15th International Conference on World Wide Web (WWW). New York:ACM,2006,:-
[14]中华人民共和国行政区划分［EB/OL］.［2010-02-21］. http://www.gov.cn/test/2005-06/15/content_18253.htm
[15]中国ISP联盟:中国主要的ISP［EB/OL］.［2010-02-21］. http://www.isp.org.cn/show.aspx?id=99&cid=18
[16]TEWARSON R P.Sparse matrices［M］. New York: Academic Press,1973

P2P节点智能选择机制的研究与实现

Research and implementation of intelligent selection mechanism in P2P

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	王丹, 梁家敏, 刘金枝, 张友寿. 6G可重构智能表面的相移模型设计[J]. 计算机应用, 2021, 41(9): 2694-2698.
[2]	刘子辰, 李小娟, 韦伟. 基于循环神经网络的专利价格自动评估[J]. 计算机应用, 2021, 41(9): 2532-2538.
[3]	丁尹, 桑楠, 李晓瑜, 吴飞舟. 基于循环神经网络的电信行业容量数据预测方法[J]. 计算机应用, 2021, 41(8): 2373-2378.
[4]	申玉民, 王金龙, 胡殿凯, 刘星宇. 基于区块链的建筑信息模型图纸多人协同创作系统[J]. 计算机应用, 2021, 41(8): 2338-2345.
[5]	尚芳剑, 李信, 翟迪, 陆阳, 张东磊, 钱玉文. 智能电网中两阶段网络切片资源分配技术[J]. 计算机应用, 2021, 41(7): 2033-2038.
[6]	陈葳葳, 曹利, 顾翔. 基于区块链的车联网电子取证模型[J]. 计算机应用, 2021, 41(7): 1989-1995.
[7]	王云燕, 胡爱花. 网络攻击下双层结构多智能体系统一致性[J]. 计算机应用, 2021, 41(5): 1399-1405.
[8]	郭天晓, 胡庆锐, 李建伟, 沈燕飞. 基于人体骨架特征编码的健身动作识别方法[J]. 计算机应用, 2021, 41(5): 1458-1464.
[9]	刘紫燕, 马珊珊, 白鹤. 基于改进智能水滴的正交匹配追踪混合预编码算法[J]. 计算机应用, 2021, 41(5): 1419-1424.
[10]	包玉龙, 朱雪阳, 张文辉, 孙鹏飞, 赵颖琪. 物联网应用中访问控制智能合约的形式化验证[J]. 计算机应用, 2021, 41(4): 930-938.
[11]	李蓓, 张问银, 王九如, 赵伟, 王海峰. 基于区块链的密封式投标拍卖方案[J]. 计算机应用, 2021, 41(4): 999-1004.
[12]	张利华, 王欣怡, 胡方舟, 黄阳, 白甲义. 基于双联盟链的智能电网数据共享模型[J]. 计算机应用, 2021, 41(4): 963-969.
[13]	张国潮, 唐华云, 陈建海, 沈睿, 何钦铭, 黄步添. 基于区块链的数字音乐版权管理系统[J]. 计算机应用, 2021, 41(4): 945-955.
[14]	樊小毛, 熊红林, 赵淦森. 带约束的清洁排班问题模型及其求解[J]. 计算机应用, 2021, 41(2): 577-582.
[15]	庞晓琼, 杨婷, 陈文俊, 王云婷, 刘天野. 区块链环境下基于秘密共享的数字权限管理方案[J]. 《计算机应用》唯一官方网站, 2021, 41(11): 3257-3265.