【作者】 彭俊杰； 卢正鼎； 李瑞轩；

【Author】 PENG Jun-jie, LU Zheng-ding, LI Rui-xuan (School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074 China)

【机构】 华中科技大学计算机科学与技术学院；

【摘要】 如何高效地搜索资源是P2P网络中最为关键的问题。非结构化的对等网络,一般以广播方式作为其搜索的基本策略,引发较大的网络流量,因此,提出改进的搜索策略,包括把节点划分为拥有丰富资源的桉心节点和稀疏资源的边缘节点,并为每个节点引入朋友节点,模拟测试表明改进算法稳定有效,降低了网络开销。更多还原

【Abstract】 How to search the resources efficiently is the key problem in peer-to-peer networks. Unstructured peer-to-peer networks usually use broadcasting as its basic search strategy and cause a larger network flows. This paper introduces some improved search approaches, including dividing nodes into two types: kernel-nodes with more resources and edge-nodes with less resources, and introducing friend-nodes to each peer. Simulation results show that improved methods enhance the search efficiency and reduce the network costs.更多还原