Skip to main content
SpringerLink
Log in

Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Peer-to-peer (P2P) networks are distributed systems where each user shares his resources and cooperates with other users. These networks are designed over IP-based infrastructure. The resources of each user in these networks are shared in a distributed way on a trust based mechanism. P2P networks have some unique characteristics like scalability and cost efficiency, which separate these networks from other distributed networks. These networks are mainly used for resource sharing. However, resource searching in this type of networks is not centrally controlled in nature. Further poor search scalability is another limitation of these networks. Chord like or chord-based protocols used in the search operations in P2P networks utilize a finger table to shorten the query search length. We exploit the finger forwarding mechanism in our proposed scheme which further reduces the resource’s search path length. We propose a last finger search table in addition to finger table to enhance the file lookup performance in the structured P2P networks. The proposed scheme reduces the lookup path and increases search efficiency as compared to the existing chord and binary search routing equivalent schemes.

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

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Chen, D., Tan, Z., Chang, G., & Wang, X. (2009). An improvement to the chord-based P2P routing algorithm. In 2009 Fifth international conference on semantics, knowledge and grid (pp. 266–269). IEEE.

  3. Cooper, B. F. (2005). An optimal overlay topology for routing peer-to-peer searches. In Proceedings of the ACM/IFIP/USENIX 2005 international conference on middleware (pp. 82–101). New York: Springer.

  4. Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001). Wide-area cooperative storage with CFS. In ACM SIGOPS operating systems review (Vol. 35, No. 5, pp. 202–215). ACM.

  5. Dabek, F. F. E. (2005). A distributed hash table (Doctoral dissertation, Massachusetts Institute of Technology). Cambridge, MA. Retrieved September 28, 2019.

  6. Flocchini, P., Nayak, A., & Xie, M. (2004). Hybrid-chord: A peer-to-peer system based on chord. In International conference on distributed computing and internet technology (pp. 194–203). Berlin: Springer.

  7. 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 

  8. 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 (TON), 18(5), 1651–1664.

    Article  Google Scholar 

  9. Gopalakrishnan, V., Silaghi, B., Bhattacharjee, B., & Keleher, P. (2004). Adaptive replication in peer-to-peer systems. In 24th International conference on distributed computing systems, 2004. Proceedings (pp. 360–369). IEEE.

  10. Hong, F., Li, M., Lu, X., Wang, Y., Yu, J., & Li, Y. (2004). VChord: Constructing peer-to-peer overlay network by exploiting heterogeneity. In International conference on embedded and ubiquitous computing (pp. 1096–1106). Berlin: Springer.

  11. Hong, F., Li, M., Lu, X., Yu, J., Wang, Y., & Li, Y. (2004). HP-chord: A peer-to-peer overlay to achieve better routing efficiency by exploiting heterogeneity and proximity. In International conference on grid and cooperative computing (pp. 626–633). Berlin: Springer.

  12. Kim, E., Kim, J., & Lee, C. (2019). Efficient neighbor selection through connection switching for P2P live streaming. Journal of Ambient Intelligence and Humanized Computing, 10(4), 1413–1423.

    Article  Google Scholar 

  13. 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, 16(4), 814–825.

    Article  Google Scholar 

  14. 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 

  15. Lv, Q., Cao, P., Cohen, E., Li, K., & Shenker, S. (2002). Search and replication in unstructured peer-to-peer networks. In Proceedings of ACM SIGMETRICS (pp. 84–95). ACM.

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

    Article  Google Scholar 

  17. Naghizadeh, A., & Shahbahrami, A. (2017). Binary search routing equivalent (BSRE): A circular design for structured P2P networks. Transactions on Emerging Telecommunications Technologies, 28(4), e3012.

    Article  Google Scholar 

  18. 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 the sixteenth ACM conference on conference on information and knowledge management (pp. 663–672). ACM.

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

    Google Scholar 

  20. Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001). A scalable content-addressable network. In SIGCOMM’01, August 27–31, 2001, San Diego, California, USA (Vol. 31, No. 4, pp. 161–172). ACM.

  21. Ratnasamy, S., Stoica, I., & Shenker, S. (2002). Routing algorithms for DHTs: Some open questions. In International workshop on peer-to-peer systems (pp. 45–52). Berlin: Springer.

  22. Rowstron, A., & Druschel, P. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM ICF on distributed systems platforms and open distributed processing (pp. 329–350). Berlin: Springer.

  23. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review, 31(4), 149–160.

    Article  Google Scholar 

  24. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., et al. (2003). Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON), 11(1), 17–32.

    Article  Google Scholar 

  25. Xu, J., Kumar, A., & Yu, X. (2004). On the fundamental tradeoffs 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 

  26. Yan, H., Jiang, Y., & Zhou, X. (2008). A bidirectional chord system based on base-k finger table. In 2008 International symposium on computer science and computational technology (Vol. 1, pp. 384–388). IEEE.

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

    Article  Google Scholar 

  28. Zhao, B. Y., Kubiatowicz, J. D., Joseph, A. D., & Bartlett, P. (2001) Tapestry: An infra-structure for fault-resilient wide-area location and routing. Computer Science Division, University of California, Berkeley, CA, Technical Report UCBI/CSD-01-1141. Retrieved September 28, 2019 from http://discus.anu.edu.au/ml/index.html.

  29. Zuo, J., & Cui, D. (2017). Critical link-aware P2P search for internet videos in semantic overlay network. Journal of Ambient Intelligence and Humanized Computing. https://doi.org/10.1007/s12652-017-0554-9.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Mahendra Singh & Chiranjeev Kumar

  2. Department of Computer Science and Engineering, Mizoram University, Aizawl, 796004, India

    Prem Nath

Authors
  1. Mahendra 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 Mahendra Singh.

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, M., Kumar, C. & Nath, P. Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks. Wireless Pers Commun 114, 2263–2281 (2020). https://doi.org/10.1007/s11277-020-07475-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07475-z

Keywords

Search

Navigation