A new search mechanism for unstructured peer-to-peer networks

Authors:
Chia-Hung Lin;Sun-Yuan Hsieh
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City, Taiwan, ROC
Venue:
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Year:
2011

Citing 11
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

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
Mapping the Gnutella Network

IEEE Internet Computing
Free Riding on Gnutella Revisited: The Bell Tolls?

IEEE Distributed Systems Online
Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment

IEEE Transactions on Computers
An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity

IEEE Transactions on Parallel and Distributed Systems
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest

IEEE Transactions on Parallel and Distributed Systems
A Tree-Based Peer-to-Peer Network with Quality Guarantees

IEEE Transactions on Parallel and Distributed Systems
An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks

IEICE - Transactions on Information and Systems
Rapid and brief communication: Color edge detection using the minimal spanning tree

Pattern Recognition
Optimal search performance in unstructured peer-to-peer networks with clustered demands

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a traditional file search mechanism, such as "flooding," a peer broadcasts a query to its neighbors through an unstructured Peer-to-Peer (P2P) network until the Time-To-Live (TTL) decreases to zero. A major disadvantage of flooding is that, in a large-scale network, this blind-choice strategy usually incurs an enormous traffic overhead. In this paper, we propose a method, called the Statistical Matrix Form (SMF), which improves the flooding mechanism by selecting neighbors according to their capabilities. The SMF measures the following peer characteristics: the number of shared files, the content quality, the query service, and the transmission distance between neighbors. Based on these measurements, appropriate peers can be selected and thereby reduce the traffic overhead significantly. Our experimental results demonstrate that the SMF is effective and efficient. For example, compared with the flooding search mechanism in dynamic unstructured P2P networks, the SMF reduces the traffic overhead by more than 80 percent. Moreover, it achieves a good success rate and shorter response times.