计算机工程 ›› 2011, Vol. 37 ›› Issue (9): 135-137.doi: 10.3969/j.issn.1000-3428.2011.09.046

• 网络与通信 • 上一篇    下一篇

基于单元树结构的广度优先P2P搜索算法

鄢靖丰1,陶少华1,夏方玉2   

  1. (1. 许昌学院计算机科学与技术学院,河南 许昌 461000;2. 中国地质大学计算机学院,武汉 430074)
  • 出版日期:2011-05-05 发布日期:2011-05-12
  • 作者简介:鄢靖丰(1982-),男,讲师、硕士,主研方向:智能计算,网络通信;陶少华,讲师、硕士;夏方玉,工程师
  • 基金项目:
    河南省教育厅基金资助项目(2009A520023);许昌市科技计划基金资助项目(0804011)

Breadth First P2P Search Algorithm Based on Unit Tree Structure

YAN Jing-feng  1, TAO Shao-hua  1, XIA Fang-yu  2   

  1. (1. College of Computer Science and Technology, Xuchang University, Xuchang 461000, China; 2. College of Computer, China University of Geoscience, Wuhan 430074, China)
  • Online:2011-05-05 Published:2011-05-12

摘要: 提出基于单元树结构的广度优先搜索算法UTBFS。将单元树结构生成算法与广度优先算法相结合,阐述UTBFS的实现思路,对其时间复杂度、空间复杂度、可行性、优越性进行分析。实验仿真结果显示,相比于传统的广度优先搜索算法和随机广度优先搜索算法,UTBFS减少了需要转发消息的邻居节点个数和冗余消息,因此性能更优。

关键词: 点对点网络, 广度优先搜索, 单元树, 邻居节点, 随机广度优先搜索

Abstract: A novel Unit Tree-based Breadth First Search(UTBFS) algorithm is proposed. The characteristic of the algorithm are as follows: puting forward the idea of unit tree spanning algorithm, integrating unit tree spanning algorithm with breath first search, and making an analysis of its performance in terms of time complexity degree, space complexity degree, feasibility and superiority. Experimental results demonstrate that UTBFS reduces the number of neighbor nodes and redundant message and is of higher searching efficiency as compared with traditional breath first search algorithm and random breath first search algorithm.

Key words: P2P network, breadth first search, unit tree, neighbor node, random breadth first search

中图分类号: