An efficient hybridflood searching algorithm for unstructured peer-to-peer networks

Authors:
Hassan Barjini;Mohamed Othman;Hamidah Ibrahim
Affiliations:
Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia and Lab of Computational Science and Informatics, Institute of Mathematical Research ...;Department of Communication Technology and Network, Universiti Putra Malaysia, Serdang, Selangor D.E., Malaysia
Venue:
ICICA'10 Proceedings of the First international conference on Information computing and applications
Year:
2010

Citing 8
Cited 0

Search and replication in unstructured peer-to-peer networks

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Sonic Boom: Napster, MP3 and the New Pioneers of Music

Sonic Boom: Napster, MP3 and the New Pioneers of Music
Information Retrieval Techniques for Peer-to-Peer Networks

Computing in Science and Engineering
On the Performance of Flooding-Based Resource Discovery

IEEE Transactions on Parallel and Distributed Systems
pFusion: A P2P Architecture for Internet-Scale Content-Based Search and Retrieval

IEEE Transactions on Parallel and Distributed Systems
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks

Computer Networks: The International Journal of Computer and Telecommunications Networking
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search

IEEE Transactions on Parallel and Distributed Systems
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Searching in peer-to-peer is started by flooding technique. This technique produces huge redundant messages in each hop. These Redundant messages limit system scalability and cause unnecessary traffic in a network. To improve this searching technique and reduce redundant messages, this paper proposes a novel algorithm called HybridFlood. In HybridFlood algorithm, flooding scheme divided into two phases. At the first phase the algorithm follows flooding by limited number of hops. In the second phase, it chooses nosey nodes in each searching horizon. The nosey nodes are nodes, which have the most links to others. These nodes maintain the data index of all clients. The proposed algorithm extends the search efficiency by reducing redundant messages in each hop. Simulation results show that the proposed algorithm decreases 60% of redundant messages and saves up to 70% of searching traffic.