Heterogeneous Search in Unstructured Peer-to-Peer Networks

Authors:
Xiuguo Bao;Binxing Fang;Mingzhen Hu;Binbin Xu
Affiliations:
Harbin Institute of Technology;Harbin Institute of Technology;Harbin Institute of Technology;Beijing University of Technology
Venue:
IEEE Distributed Systems Online
Year:
2005

Citing 8
Cited 1

A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Parsec: A Parallel Simulation Environment for Complex Systems

Computer
Scalable P2P Search

IEEE Internet Computing
Toward a Synergy Between P2P and Grids

IEEE Internet Computing
A brief history of NTP time: memoirs of an Internet timekeeper

ACM SIGCOMM Computer Communication Review
Cost-effective broadcast for fully decentralized peer-to-peer networks

Computer Communications
Flood search under the California Split rule

Operations Research Letters

Self-organized customized content delivery architecture for ambient assisted environments

UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks

Quantified Score

Hi-index	0.00

Visualization

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.