Analytical studies and experimental examines for flooding-based search algorithms

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. © 2012 Springer-Verlag.