计算机工程2011，Vol.37Issue(9)：135-137,3.DOI:10.3969/j.issn.1000-3428.2011.09.046
基于单元树结构的广度优先P2P搜索算法
Breadth First P2P Search Algorithm Based on Unit Tree Structure
摘要
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分类
信息技术与安全科学引用本文复制引用
鄢靖丰,陶少华,夏方玉..基于单元树结构的广度优先P2P搜索算法[J].计算机工程,2011,37(9):135-137,3.基金项目
河南省教育厅基金资助项目(2009A520023) （2009A520023）
许昌市科技计划基金资助项目(0804011) （0804011）
