An Overview of P2P Search Algorithms

Abstract:

Article Preview

since the nodes of P2P network always join or exit dynamically, web-based P2P search technology is much more complicated than the traditional search technologies. P2P-based resource search algorithm is currently a research focus. This paper finds the advantages and disadvantages and range of application of each algorithm through an analysis and comparison of methods such as flooding search, breadth-first search (BFS), iterative depth method, directed breadth-first search (DBFS), random breadth-first search (RBFS) and other forwarding mechanism-based search. And the research findings of this paper aims to lay a technically necessary foundation for future high-performance P2P search algorithm.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

393-397

DOI:

10.4028/www.scientific.net/AMR.267.393

Citation:

J. F. Yan and S. H. Tao, "An Overview of P2P Search Algorithms", Advanced Materials Research, Vol. 267, pp. 393-397, 2011

Online since:

June 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.