Skip to main content
SpringerLink
Log in

Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

A P2P (peer-to-peer) network is a distributed system dependent on the IP-based networks, where independent nodes join and leave the network at their drive. The files (resource) are shared in distributed manner and each participating node ought to share its resources. Some files in P2P networks are accessed frequently by many users and such files are called popular files. Replication of popular files at different nodes in structured P2P networks provides significant reduction in resource lookup cost. Most of the schemes for resource access in the structured P2P networks are governed by DHT (Distributed Hash Table) or DHT-based protocols like Chord. Chord protocol is well accepted protocol among structured P2P networks due to its simple notion and robust characteristics. But Chord or other resource access protocols in structured P2P networks do not consider the cardinality of replicated files to enhance the lookup performance of replicated files. In this paper, we have exploited the cardinality of the replicated files and proposed a resource cardinality-based scheme to enhance the resource lookup performance in the structured P2P networks. We have also proposed the notion of trustworthiness factor to judge the reliability of a donor node. The analytical modelling and simulation analysis indicate that the proposed scheme performs better than the existing Chord and PCache protocols.

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
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Data availability

The details of data and material has been given in manuscript itself.

References

  1. Liu, C.-M., & Lai, C.-C. (2017). A group-based data-driven approach for data synchronization in unstructured mobile P2P systems. Wireless Networks. https://doi.org/10.1007/s11276-017-1481-6

    Article  Google Scholar 

  2. Bok, K., Kim, J., & Yoo, J. (2017). Cooperative caching for efficient data search in mobile P2P networks. Wireless Personal Communications, 97, 4087–4109.

    Article  Google Scholar 

  3. Dabek, F. (2005) “A distributed hash table,” Ph.D. dissertation, Massachusetts Institute of Technology (MIT), Cambridge, MA, USA.

  4. Stoica, I., Morris, R., Lben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003). Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1), 17–32.

    Article  Google Scholar 

  5. Stoica, I., Morris, R., Karger, D., Frans Kaashoek, M., Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceeding. ACM SIGCOMM 2001, San Diego, CA, pp. 149–160.

  6. Rowstron, A., Druschel, P. (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceeding 18th IFIP/ACM Conference Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp. 329–350.

  7. Zhao, B. Y., Kubiatowicz, J. D., Joseph, A. D., Bartlett, P. (2001). Tapestry: an infra-structure for fault-resilient wide-area location and routing. In Comput. Sci. Div., Univ. California, Berkeley, CA, Tech. Rep. UCBI/CSD-01-1141.

  8. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S. (2001). A scalable content-addressable network. In Proc. ACM SIGCOMM’01, San Diego, CA, pp. 161–172.

  9. Naghizadeh, A., & Shahbahrami, A. (2017). Binary search routing equivalent (BSRE): a circular design for structured P2P networks. Transactions on Emerging Telecommunication Technologies. https://doi.org/10.1002/ett.3012

    Article  Google Scholar 

  10. Rao, W., Chen, L., Fu, A. W., & Wang, G. (2010). Optimal resource placement in structured peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 21(7), 1011–1026.

    Article  Google Scholar 

  11. Dabek, F., Kaashoek, M. F., Karger, D.R., Morris, R., Stoica, I. (2001) Wide area cooperative storage with CFS. In Proceedings of ACM Symp. Operating Systems Principles (SOSP).

  12. Rao, W., Chen, L., Fu, A.W.-C., Bu, Y. (2007). Optimal proactive caching in peer-to-peer network: Analysis and application. In Proceedings of ACM Conf. Information and Knowledge Management (CIKM).

  13. Gopalakrishnan, V., Silaghi, B.D., Bhattacharjee, B., Keleher, P.J. (2004). Adaptive replication in peer-to-peer systems. In Proceedings of IEEE International Conf. Distributed Computing Systems (ICDCS), pp. 360–369.

  14. Ratnasamy, S., Shenker, S., Stoica, I. (2001) Routing algorithms for DHTs: Some open questions. In Proceeding 1st Workshop Peer-to-Peer Systems (IPTPS’01), Cambridge, MA, pp. 45–52.

  15. Balakrishnan, H., Frans Kaasoek, M., Karger, D., Morris, R., & Stoica, I. (2003). Looking up data in P2P systems. Communications of the ACM, 46(2), 43–48.

    Article  Google Scholar 

  16. Krishnamurthy, S., El-Ansary, S., Aurell, E., & Haridi, S. (2008). An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Transactions on Networking, 8(4), 814–825.

    Article  Google Scholar 

  17. Jun, Xu., Kumar, A., & Xingxing, Yu. (2004). On the fundamental trade-offs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 22(1), 151–163.

    Article  Google Scholar 

  18. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S. (2002) Search and replication in unstructured peer-to-peer networks. In Proceeding ACM SIGMETRICS.

  19. Cooper, B.F. (2005) An optimal overlay topology for routing peer-to-peer searches. In Proceeding International Conf. Middleware.

  20. Muthusamy, V., & Jakobsen, H.-A. (2014). Infrastructure-free content-based publish/subscribe. IEEE/ACM Transactions on Networking, 22(5), 1516–1530.

    Article  Google Scholar 

  21. Xu, K., et al. (2018). Modeling, analysis, and implementation of universal acceleration platform across online video sharing sites. IEEE Transactions on Services Computing, 11(3), 534–548. https://doi.org/10.1109/TSC.2016.2565470

    Article  Google Scholar 

  22. Mohammadi, B., & Navimipour, N. J. (2019). Data replication mechanisms in the peer-to-peer networks. International Journal of Communication System. https://doi.org/10.1002/dac.3996

    Article  Google Scholar 

  23. Hassanzadeh-Nazarabadi, Y., Küpçü, A., & Ozkasap, O. (2020). Decentralized utility- and locality-aware replication for heterogeneous DHT-based P2P cloud storage systems. IEEE Transactions on Parallel and Distributed Systems, 31(5), 1183–1193. https://doi.org/10.1109/TPDS.2019.2960018

    Article  Google Scholar 

  24. Forestiero, A., Leonardi, E., Mastroianni, C., & Meo, M. (2010). Self-chord: A bio-inspired P2P framework for self-organizing distributed systems. IEEE/ACM Transactions on Networking, 18(5), 1651–1664.

    Article  Google Scholar 

  25. Yan, H. Y., Jiang, Y. L., Zhou, X. M. (2008). A bidirectional chord system based on base-k finger table. In International Symposium on Computer Science and Computational Technology, Shanghai, China, Dec. 20–22, Vol.1, pp.384–388.

  26. Chen, D., Tan, Z., Chang, G., Wang, X. (2009). An improvement to the chord-based P2P routing algorithm. In Fifth International Conference on Semantics, Knowledge and Grid, pp. 266–269.

  27. Flocchini, P., Nayak, A., & Xie, M. (2007). Enhancing peer-to-peer systems through redundancy. IEEE Journal on Selected Areas in Communications, 25(1), 15–24.

    Article  Google Scholar 

  28. Yao, Z., & Loguinov, D. (2011). Understanding disconnection and stabilization of chord. IEEE Transactions on Parallel and Distributed Systems, 22(4), 650–661.

    Article  Google Scholar 

  29. Li, Z., Xie, G., Hwang, K., & Li, Z. (2011). Churn-resilient protocol for massive data dissemination in P2P networks. IEEE Transactions on Parallel and Distributed Systems, 22(8), 1342–1349.

    Article  Google Scholar 

Download references

Funding

There is no funding for this research work. This has been done for my ongoing Ph. D. work.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad, 826004, India

    Sanjeev Kumar Singh & Chiranjeev Kumar

  2. Department of Computer Science and Engineering, H N B Garhwal University, Srinagar, 246174, India

    Prem Nath

Authors
  1. Sanjeev Kumar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chiranjeev Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prem Nath
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjeev Kumar Singh.

Ethics declarations

Conflict of interest

There is no Conflicts of interest/Competing interests among the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, S.K., Kumar, C. & Nath, P. Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks. Wireless Pers Commun 125, 3351–3377 (2022). https://doi.org/10.1007/s11277-022-09714-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-022-09714-x

Keywords

Search

Navigation