對等式內容網路之搜尋與傳遞演算法及安全議題研究

Recently Peer-to-Peer networks (P2P) have gained great attention
and popularity. One key challenge aspect in a P2P resource sharing
environment is an efficient searching algorithm. This is especially
important for Gnutella-like decentralized and unstructured
networks since they have power-law degree distributions. In this
paper, we propose a dynamic search algorithm that decides the
number of running walkers dynamically with respect to peers’
topological information and search time state. The dynamic search
is able to control the extent of messages generating temporally by
the simulated annealing mechanism, thus being a scalable search.
Furthermore, we present a unified quantitative search performance
measurement, Search Efficiency, to objectively capture dynamic
behavior of various search algorithms in terms of scalability,
reliability and responsiveness. We quantitatively characterize,
through simulations in dynamic P2P environments, the
performance of various existing searching algorithms. The
proposed dynamic search outperforms other search algorithms in
terms of Search Efficiency in both the local and global search
spaces.
Categories and Subject Descriptors
H.3.3 [Information Storage and Retrieval]: Information Search
and Retrieval – Search Process.
General Terms
Algorithms, Measurement, Performance, Design, Reliability