Skip to main content
SpringerLink
Log in

Recommend top-k most downloaded files in the chord-based P2P file-sharing system

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Peer-to-peer (P2P) file sharing system provides a platform that enables users to share their files over network and provides a rapid and scalable content distribution mechanism to access an explosive volume of shared files on the system. The search mechanism in these systems is mainly keyword-based, so, users may have to try different keywords to find the desired file, where increase the network traffic. Therefore, the existence of a tool in these clients that guide users towards the top-k most downloaded files is very beneficial in terms of user convenience and traffic reduction. We have proposed our algorithms by adding a new data structure to chord protocol. Chord has been widely used as a routing protocol in structured P2P networks. We validated our proposed algorithms through simulation by using PlanetSim simulator and studied the effect of several parameters on the performance of our algorithms. The results show very good performance, in terms of communication cost and response time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Felber P, Kropf P, Schiller E, Serbu S (2014) Survey on load balancing in peer-to-peer distributed hash tables. IEEE Commun Surv Tutorials 16(1):473–492

    Article  Google Scholar 

  2. R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, M. Sereno. A measurement study supporting P2P file-sharing community models. Comput Netw, vol. 53, Issue 4, pp. 485–500, 2009.

  3. Li C, Yu B, Sycara K (2009) An incentive mechanism for message relaying in unstructured peer-to-peer systems. Electron Commer Res Appl 8:315–326

    Article  Google Scholar 

  4. Xu Z, He X, Bhuyan L (2006) Efficient file sharing strategy in DHT based P2P systems. Comput Commun 29:1243–1259

    Article  Google Scholar 

  5. Zhan Su, Anthony K. H. Tung, Zhenjie Zhang. Supporting top-K item exchange recommendations in large online communities, EDBT 2012, March 26–30, 2012, Berlin, Germany.

  6. Rostami H, Habibi J, Livani E (2008) Semantic routing of search queries in p2p networks. J Parallel Distrib Comput 68(12):1590–1602

    Article  Google Scholar 

  7. Ekstrand MD, Riedl JT, Konstan JA (2010) Collaborative filtering recommender systems. Foundations and Trends in Human-Computer Interaction 4(2):81–173

    Article  Google Scholar 

  8. B. Sanyal, P. Gupta, S. Majumder. Top-K range-aggregate queries on categorical data, in Emerging Trends and Applications in Computer Science (NCETACS), 2012.

  9. Ilyas IF, Beskales G, Soliman MA (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv 40

  10. R. Fagin. Combining fuzzy information from multiple systems, in Proceedings of the 15th ACM Symposium on Principles of Database Systems (PODS), pp. 83–99 1999.

  11. Fagin R, Lotem J, Naor M (2003) Optimal aggregation algorithms for middleware. J Comput Syst Sci 66(4):614–656

    Article  MATH  MathSciNet  Google Scholar 

  12. Pei Cao, Zhe Wang. Efficient top-K Query Calculation in Distributed Networks, in Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing, pp. 206–215, Canada, 2004.

  13. Demetrios Zeinalipour-Yazti et. al. Finding the K highest-ranked answers in a distributed network. Comput Netw, vol. 53, pp. 1431–1449, 2009.

  14. Akbarinia R, Pacitti E, Valduriez P (2011) Best position algorithms for efficient top-k query processing. Inf Syst 36:973–989

    Article  Google Scholar 

  15. Xin Cao, Gao Cong, Christian S. Jensen. Retrieving Top-k Prestige-Based Relevant Spatial Web Objects, Proceedings of the VLDB Endowment, Vol. 3, No. 1,, September 13–17, 2010, Singapore.

  16. Xin Cao, Lisi Chen, Gao Cong, Christian S. Jensen, Qiang Qu, Anders Skovsgaard, Dingming Wu, Man Lung Yiu. Spatial keyword querying, LNCS 7532, pp. 16–29, Springer-Verlag Berlin Heidelberg 2012.

  17. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-topeer lookup service for internet applications, in SIGCOMM, 2001.

  18. FIPS 180–1. Secure hash standard, in Technical report, US Department of Commerce/NIST, http://www.itl.nist.gov/fipspubs/fip180-1.htm, April 1995.

  19. El-Ansary S, Alima LO, Brand P, Haridi S (2003) Efficient broadcast in structured P2P networks. IPTPS:304–314

  20. P. Garcia, et al. Planetsim: A new overlay network simulation framework, in In. Proc. of ASE, 2004.

Download references

Author information

Authors and Affiliations

  1. Department of IT, Payame Noor University (PNU), Tehran, Iran

    Sina Keshvadi

  2. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

    Amir Masoud Rahmani

  3. Computer Engineering Department, School of Engineering, Persian Gulf University, Bushehr, Iran

    Habib Rostami

Authors
  1. Sina Keshvadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amir Masoud Rahmani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Habib Rostami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sina Keshvadi.

Ethics declarations

Ethical statement

“If you do not have integrity, you have nothing. You cannot buy it. You can have all the money in the world, but if you are not a moral or ethical person, you really have nothing.” I agree with this view. As a researcher, I abide by some basic personal ethics that help me become a better person everywhere and every day. I have immense respect for my professors, for other researchers, and for readers. Integrity and honesty are two values which I promise to abide by in every situation. I will never engage in plagiarism, cheat, or break any rules, which might result in someone else getting hurt. I promise to stand up against all that is wrong, and will always support nothing but the truth.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Keshvadi, S., Rahmani, A.M. & Rostami, H. Recommend top-k most downloaded files in the chord-based P2P file-sharing system. Peer-to-Peer Netw. Appl. 10, 208–215 (2017). https://doi.org/10.1007/s12083-015-0420-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-015-0420-5

Keywords

Search

Navigation