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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barjini, H., Othman, M., Ibrahim, H., Udzir, N.: Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured p2p networks. Peer-to-Peer Networking and Applications 5(1), 1–13 (2012)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM (2002)
Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: pfusion: A peer-to-peer architecture for internet-scale content-based search and retrieval. IEEE Transactions on Parallel and Distributed Systems 18(6), 804–817 (2007)
Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: Nicholas, C., Grossman, D., Kalpakis, K., Qureshi, S., van Dissel, H., Seligman, L. (eds.) CIKM 2002, pp. 300–307. Association for Computing Machinery (2002)
Dimakopoulos, V., Pitoura, E.: On the performance of flooding-based resource discovery. IEEE Transactions on Parallel and Distributed Systems 17(11), 1242–1252 (2006)
Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: Information retrieval techniques for peer-to-peer networks. Computing in Science and Engineering, 20–26 (2004)
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering, pp. 49–60 (2003)
Gnutella2 (2003), http://www.gnutella2.com (January 2006)
KaZaa, http://www.kazaa.com/
Aberer, K., Hauswirth, M.: An overview on peer-to-peer information systems. In: Workshop on Distributed Data and Structures, WDAS 2002, pp. 1–14 (2002)
Zhu, Z., Kalnis, P., Bakiras, S.: Dcmp: A distributed cycle minimization protocol for peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 19(3), 363–377 (2007)
Jiang, S., Guo, L., Zhang, X., Wang, H.: Lightflood: Minimizing redundant messages and maximizing scope of peer-to-peer search. IEEE Transactions on Parallel and Distributed Systems 19(5), 601–614 (2007)
Clip2: Distributed search solutions, http://public.yahoo.com/~lguo/download/gnutella-trace/xmlfiles.tar.gz , http://public.yahoo.com/~lguo/download/gnutella-trace/sample-query.dat (last visited January 19, 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barjini, H., Othman, M., Ibrahim, H., Udzir, N.I. (2012). Analytical Studies and Experimental Examines for Flooding-Based Search Algorithms. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-34062-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34061-1
Online ISBN: 978-3-642-34062-8
eBook Packages: Computer ScienceComputer Science (R0)