The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2005 vol.6)
pp: 1
Xiuguo Bao , Harbin Institute of Technology
Binxing Fang , Harbin Institute of Technology
Mingzhen Hu , Harbin Institute of Technology
Binbin Xu , Beijing University of Technology
ABSTRACT
Distributed search has become a very important research area in light of the proliferation of peer-to-peer networks and grids, which heavily rely on the effectiveness of forwarding algorithms to propagate queries among peers. Most present search techniques apply homogeneous forwarding logic in each peer. None of these forwarding algorithms is perfect. This article introduces heterogeneous search, a promising approach for improving search performance through the use of multiple forwarding algorithms among peers in unstructured P2P networks. Simulation results demonstrate that this technique shows significant advantages over others.
INDEX TERMS
Search, unstructured P2P network, heterogeneity
CITATION
Xiuguo Bao, Binxing Fang, Mingzhen Hu, Binbin Xu, "Heterogeneous Search in Unstructured Peer-to-Peer Networks", IEEE Distributed Systems Online, vol.6, no. 2, pp. 1, February 2005, doi:10.1109/MDSO.2005.9
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool