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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Meshkova, E., Riihijärvi, J., Petrova, M., Mähönen, P.: A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks 52(11), 2097–2128 (2008)
Alderman, J.: Sonic Boom: Napster, MP3 and the New Pioneers of Music. Basic Books (2000)
Guttman, E., Perkins, C., Veizades, J.: Service location protocol, version 2. Technical report, Sun Microsystems (1999)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. Performance Evaluation Review ACM USA 30, 258–259 (2002)
Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: pfusion: A p2p architecture for internet-scale content-based search and retrieval. IEEE Transactions on Parallel and Distributed Systems 18, 804–817 (2007)
Dimakopoulos, V.V., Pitoura, E.: On the performance of flooding-based resource discovery. IEEE Transactions on Parallel and Distributed Systems 17, 1242–1252 (2006)
Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: Information retrieval techniques for peer-to-peer networks. Computing in Science and Engineering 6, 20–26 (2004)
Yang, B., Garcia-Molina, H.: Designing a super-peer networks. In: Proceedings of the International Conference on Data Engineering, pp. 49–62. IEEE Computer Society Press, Los Alamitos (2003)
Aberer, M.H.: An overview on peer-to-peer information systems. In: WDAS- Proceedings, pp. 171–188. Carleton Scientific (2002)
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, 601–614 (2008)
Lin, T., Lin, P., Wang, H., Chen, C.: Dynamic search algorithm in unstructured peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 20, 654–666 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barjini, H., Othman, M., Ibrahim, H. (2010). An Efficient HybridFlood Searching Algorithm for Unstructured Peer-to-Peer Networks. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Lecture Notes in Computer Science, vol 6377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16167-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-16167-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16166-7
Online ISBN: 978-3-642-16167-4
eBook Packages: Computer ScienceComputer Science (R0)