Abstract
The term “Peer-to-Peer” (P2P) refers to a computer network model whose elements (nodes or “peers”) are both clients and servers during exchanges. With the evolution of P2P, users express the need of exchanging resources in the shortest possible time, which encouraged the development and optimization of many of resource (data) search mechanisms in order to offer a good quality of research. In this field, we find lookup mechanisms based on data popularity. However, the routing of P2P requests and the methods used for estimating popularity of shared files can generate communication redundancy and unnecessary network traffic. Therefore, the objective of this work is to develop a P2P lookup mechanism that estimates popularity of shared data and uses it in order to increase the search success rate and reduce the lookup path without generating excessive traffic or increasing the storage spaces. The implementation results show the effect of the proposed approach in reducing the lookup path and the nodes storage space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Comput. J. 6(1), 40–49 (2002)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-topeer lookup protocol for internet applications. In: Proceedings of SIGCOMM, pp. 149–160. ACM Press (2001)
Nwebonyi, F.N., Martins, R., Correia, M.E.: Reputation based approach for improved fairness and robustness in P2P protocols. Peer-to-Peer Netw. Appl. 12, 951 (2019)
Ahmad, S., Bouras, C., Buyukkaya, E., et al.: Peer-to-peer live video streaming with rateless codes for massively multiplayer online games. Peer-to-Peer Netw. Appl. 11, 44 (2018)
Chen, F., Li, H., Liu, J., et al.: Migrating big video data to cloud: a peer-assisted approach for VoD. Peer-to-Peer Netw. Appl. 11, 1060 (2018)
Cherbal, S., Boukerram, A., Boubetra, A.: RepMChord: a novel replication approach for mobile chord with reduced traffic overhead. Int. J. Commun Syst 30, e3285 (2017)
Soltani, N., Khaneghah, E.M., Sharifi, M., Mirtaheri, S.L.: A dynamic popularity-aware load balancing algorithm for structured P2P systems. In: Park, J.J., Zomaya, A., Yeo, S.S., Sahni, S. (eds.) Network and Parallel Computing, NPC 2012. Lecture Notes in Computer Science, vol. 7513. Springer, Heidelberg (2012)
Seddiki, M., Benchaïba, M.: 2P-lookup: popularity and proximity based P2P lookup mechanism over MANETs. J. Netw. Comput. Appl. 71, 181–193 (2016)
Das, S.K., Naor, Z., Raj, M.: Popularity-based caching for IPTV services over P2P networks. Peer-to-Peer Netw. Appl. 10, 156–169 (2017)
Ganapathi, S., Varadharajan, V.: Popularity based hierarchical prefetching technique for P2P video-on-demand. Multimed Tools Appl. 77, 15913–15928 (2018)
Gnutella 0.4. [En ligne] (2001). http://rfcgnutella.sourceforge.net/developer/stable
Gnutella 0.6. [En ligne] (2002). http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P systems scalable. In: Proceedings of ACM SIGCOMM (2003)
Vishnumurthy, V., Francis, P.: On heterogeneous overlay construction and random node selection in unstructured P2P networks. In: Proceedings of IEEE INFOCOM (2006)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured P2P networks. In: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM (2002)
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM 2004. Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1 (2004)
Otto, F., Ouyang, S.: Improving search in unstructured P2P systems: intelligent walks (i-walks). In: IDEAL 2006, pp. 1312–1319. Springer (2006)
Hamdeni, C., Hamrouni, T., Ben Charrada, F.: Data popularity measurements in distributed systems: survey and design directions. J. Netw. Comput. Appl. 72, 150–161 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Cherbal, S., Lamraoui, B. (2020). Peer-to-Peer Lookup Process Based on Data Popularity. In: Jain, L., Peng, SL., Alhadidi, B., Pal, S. (eds) Intelligent Computing Paradigm and Cutting-edge Technologies. ICICCT 2019. Learning and Analytics in Intelligent Systems, vol 9. Springer, Cham. https://doi.org/10.1007/978-3-030-38501-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-38501-9_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38500-2
Online ISBN: 978-3-030-38501-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)