Analytical studies and experimental examines for flooding-based search algorithms

Authors:
Hassan Barjini;Mohamed Othman;Hamidah Ibrahim;Nur Izura Udzir
Affiliations:
Department of Communication Technology and Networks, Universiti Putra Malaysia, Selangor D.E., Malaysia;Department of Communication Technology and Networks, Universiti Putra Malaysia, Selangor D.E., Malaysia;Department of Communication Technology and Networks, Universiti Putra Malaysia, Selangor D.E., Malaysia;Department of Communication Technology and Networks, Universiti Putra Malaysia, Selangor D.E., Malaysia
Venue:
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Year:
2012

Citing 7
Cited 0

Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks

Proceedings of the eleventh international conference on Information and knowledge management
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
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flooding search has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although flooding can achieve high coverage but it produces exponentially redundant messages in each hop. To improve this searching scheme and reduce redundant messages, there are many flooding-based search algorithms in literature. This paper provided analytical study for flooding and flooding-based algorithms. The analytical results provided the best hop threshold point for the optimum growth rate coverage and redundant messages from flooding and flooding-based algorithms. The simulation experiments validated analytical results.