应用移动代理的自组织P2P网络模型

doi:1000-436X(2008)05-0034-09

通信学报 ›› 2008, Vol. 29 ›› Issue (5): 34-42.doi: 1000-436X(2008)05-0034-09

应用移动代理的自组织P2P网络模型

王杨^1,²,王汝传^2,³,徐小龙²

¹ 苏州大学计算机学院,江苏苏州 215006
² 南京邮电大学计算机学院,江苏南京 210003
³ 南京大学计算机软件新技术国家重点实验室,江苏南京 210093

出版日期:2008-05-25 发布日期:2017-06-12
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;江苏省高技术研究计划资助项目;江苏省高技术研究计划资助项目;江苏省高技术研究计划资助项目;江苏省高技术研究计划资助项目;江苏省计算机信息处理技术重点实验室基金资助项目;江苏省高等教育机构研究计划项目

Novel model on self-organized P2P network using mobile agent

Yang WANG^1,²,Ru-chuan WANG^2,³,Xiao-long XU²

¹ College of Computer Science,Soochow University,Suzhou 215006,China
² College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
³ State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093,China

Online:2008-05-25 Published:2017-06-12
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The High Technology Research Programme of Jiangsu Province;The High Technology Research Programme of Jiangsu Province;The High Technology Research Programme of Jiangsu Province;The High Technology Research Programme of Jiangsu Province;The Key Laboratory of Information Technology Processing of Jiangsu Province;The Research Scheme of Natural Science for Higher Education Institutions of Jiangsu Province

摘要/Abstract

摘要：

针对非结构化P2P网络因拓扑误配(topology mismatching)而产生的冗余流量问题，提出了应用移动代理的新型自组织P2P网络模型。对于不同的自治域，提升一些P2P节点作为主代理服务节点和候选代理服务节点；自治域内的普通节点按平衡K+查询树形式自组织成ad hoc网络；智能移动代理用于网络拓扑结构的划分及协助用户完成目标资源的查询任务。理论分析与仿真实验的结果表明，该P2P自组织模型可以在一定程度上能够减少因拓扑误配而产生的网络冗余流量,提高自治域内的资源查询效率，从而增强了P2P系统的可靠性。

关键词: 对等网络, 移动代理, K+查询树, 拓扑误配

Abstract:

In order to reduce large of redundant P2P traffic due to mismatched topology,a self-organized P2P network model with Multi-Mobile agents was proposed.At first,constructed different AS,then promoted some peers as master server agent and candidate server agent,common peers were self-organized into ad hoc network in the AS.Additionally,mobile agent infrastructures were deployed on peers,which were used to partition subnet topology and help user achieve search task.Theoretical analysis and simulation result indicate that the P2P model can reduce redundant P2P traffic to some degree and search efficiency in AS which reinforce P2P system’s robustness furtherly.

Key words: P2P network, mobile agent, K+ search tree, topology mismatching

王杨,王汝传,徐小龙. 应用移动代理的自组织P2P网络模型[J]. 通信学报, 2008, 29(5): 34-42.

Yang WANG,Ru-chuan WANG,Xiao-long XU. Novel model on self-organized P2P network using mobile agent[J]. Journal on Communications, 2008, 29(5): 34-42.

图/表 8

图1

图2

图3

图4

图5

图6

图7

图8

参考文献 11

[12]	LIU Y H , XIAO L , NI L M . Building a scalable bipartite P2P overlay network[J]. IEEE Transactions on Parallel and Distributed Systems, 2007,18(9): 1296-1306.
[13]	王汝传, 徐小龙, 黄海平 . 智能Agent及其在信息网络中的应用[M]. 北京: 北京邮电大学出版社, 2005. WANG R C , XU X L , HUANG H P . Intelligent Agent and Its Application in the Information Network[M]. Beijing: Publishing House of BUPTPress, 2005.
[14]	王汝传, 李映, 徐小龙 ,等. 基于移动代理的动态路由算法的研究[J]. 计算机学报, 2005,28(3), 420-426. WANG R C , LI Y , XU X L ,et al. The research on dynamic routing algorithm based on mobile agent[J]. Chinese Journal of Computer, 2005,28(3): 420-426.
[15]	陈宏伟, 王汝传 . P2P 计算中一种新的自组织任务调度拓扑结构——K+树[J]. 通信学报, 2005,26(6): 24-30. CHEN H W , WANG R C . A New self-organized task scheduling topology structure in P2P computing—K+ tree[J]. Journal on Communications, 2005,26(6): 24-30.
[16]	DINH T T A , LEES M , THEODOROPOULOS G M R . Large scale distributed simulation of P2P networks[A]. Parallel,Proc of 2008.16th Euromicro Conference on Distributed and Network-Based Processing[C]. 2008. 499-507.
[17]	XU Z Y , HU Y M . SBARC:A supernode based peer-to-peer file sharing system[A]. Proc of 2003 the IEEE Eighth International Symposium on Computers and Communication (ISCC 2003)[C]. 2003. 1053-1058.
[1]	BANERJEE A , FALOUTSOS M , BHUYAN L N . P2P:is big brother watching you?[EB/OL].
[2]	HAMADA T , CHUJO K , CHUJO T ,et al. Peer-to-peer traffic in metro networks:analysis,modeling,and policies[A]. IEEE International Conference on NOMS[C]. Seoul, 2004. 425-438.
[3]	LIU Y . A two-hop solution to solving topology mismatch[J]. IEEE Transactions on Parallel and Distributed Systems, 2003,99: 1-27.
[4]	YANG B , GARCIA-MOLINA H . Efficient search in peer-to-peer networks[A]. IEEE Proc of the 2002 International Conference on Distributed Computing Systems(ICDCS'02)[C]. 2002. 1-32
[5]	PATRO S , HU Y C . Transparent query caching in peer-to-peer overlay networks[A]. IEEE Proc of 2003 the 17th International Parallel and Distributed Processing Symposium(IPDPS)[C]. 2003. 10-19.
[6]	CHEN S P , ZHANG Z . Efficient file search in non-DHT P2P networks[J]. Computer Communications, 2008,31(2): 304-317.
[7]	LIU Y H , XIAO L , LIU X M ,et al. Location awareness in unstructured peer-to-peer systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2005,16(2): 163-174.
[8]	ZHANG X Y , ZHANG Q , ZHANG Z ,et al. A construction of locality-aware overlay networks:moverlay and its performance[J]. Selected Areas in Communications, 2004,22(1): 18-28.
[9]	ZHANG G Q , ZHANG G Q . Networking,agent selection and P2P overlay construction using global locality knowledge[A]. IEEE Proc of 2007 International Conference on Sensing and Control[C]. 2007. 519-524.
[10]	XIAO L , LIU Y H . Improving unstructured peer-to-peer systems by adaptive connection establishment computers[J]. IEEE Transactions on Computers, 2005,54(9): 1091-1103
[11]	FUMINORI M , TAKAFUMI M , TATSUHIRO T ,et al. Constructing overlay networks with low link costs and short paths[A]. IEEE Proc of 2007 Sixth IEEE International Symposium on Network Computing and Applications,NCA 2007[C]. 2007. 299-304.

应用移动代理的自组织P2P网络模型

Novel model on self-organized P2P network using mobile agent

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 8

参考文献 11

相关文章 15

Metrics

推荐阅读 0

[1]	刘洲洲,李士宁. 基于网络覆盖和多目标离散群集蜘蛛算法的多移动agent规划[J]. 通信学报, 2017, 38(6): 1-9.
[2]	史霄波,张引,赵杉,肖登明. 基于离散多目标优化粒子群算法的多移动代理协作规划[J]. 通信学报, 2016, 37(6): 29-37.
[3]	朱敬华,王桐,钟颖莉. 无线传感器网络能源高效的移动数据采集协议[J]. 通信学报, 2011, 32(9A): 70-76.
[4]	吴国政,秦志光. 大规模对等网络蠕虫仿真技术研究[J]. 通信学报, 2011, 32(8): 128-135.
[5]	陈善雄,李莉,张林. 对等网的快速路由模型[J]. 通信学报, 2011, 32(7): 22-28.
[6]	胡建理,周斌,吴泉源. P2P网络中具有激励机制的信任管理研究[J]. 通信学报, 2011, 32(5): 22-32.
[7]	李致远,王汝传. P2P电子商务环境下的动态安全信任管理模型[J]. 通信学报, 2011, 32(3): 50-59.
[8]	石志国,刘冀伟,王志良. 基于时间窗反馈机制的动态P2P信任模型[J]. 通信学报, 2010, 31(2): 120-129.
[9]	李致远,王汝传. 移动P2P网络安全拓扑构造协议[J]. 通信学报, 2010, 31(10): 146-157.
[10]	苗光胜,冯登国,苏璞睿. P2P信任模型中基于行为相似度的共谋团体识别模型[J]. 通信学报, 2009, 30(8): 9-20.
[11]	孙知信,张震伟,宫婧. P2P安全重叠网络模型研究[J]. 通信学报, 2009, 30(5): 99-104.
[12]	刘勇,罗绪成,秦志光. 基于带偏随机游动的复制与搜索[J]. 通信学报, 2009, 30(12): 93-98.
[13]	许长桥,吴志美,李凯慧,张源海. 支持随机访问的协作式P2P流媒体分发策略[J]. 通信学报, 2008, 29(8): 23-30.
[14]	欧阳竟成,林亚平,周四望,张建明,易叶青. P2P环境下的全局信任值分级计算方法[J]. 通信学报, 2008, 29(8): 39-46.
[15]	郑彦,陈宏伟,王汝传,王杨. 新型分布式散列表——BChord[J]. 通信学报, 2008, 29(2): 22-28.