Skip to main content
Erschienen in: Wireless Personal Communications 3/2020

17.05.2020

Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks

verfasst von: Mahendra Singh, Chiranjeev Kumar, Prem Nath

Erschienen in: Wireless Personal Communications | Ausgabe 3/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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.CrossRef 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.CrossRef
2.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Dabek, F. F. E. (2005). A distributed hash table (Doctoral dissertation, Massachusetts Institute of Technology). Cambridge, MA. Retrieved September 28, 2019. Dabek, F. F. E. (2005). A distributed hash table (Doctoral dissertation, Massachusetts Institute of Technology). Cambridge, MA. Retrieved September 28, 2019.
6.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
8.
Zurück zum Zitat 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.CrossRef 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.CrossRef
9.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
13.
Zurück zum Zitat 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.CrossRef 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.CrossRef
14.
Zurück zum Zitat 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.CrossRef 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.CrossRef
15.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Muthusamy, V., & Jacobsen, H. A. (2013). Infrastructure-free content-based publish/subscribe. IEEE/ACM Transactions on Networking, 22(5), 1516–1530.CrossRef Muthusamy, V., & Jacobsen, H. A. (2013). Infrastructure-free content-based publish/subscribe. IEEE/ACM Transactions on Networking, 22(5), 1516–1530.CrossRef
17.
Zurück zum Zitat 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.CrossRef 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.CrossRef
18.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
20.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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. 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.
Zurück zum Zitat 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.CrossRef 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.CrossRef
24.
Zurück zum Zitat 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.CrossRef 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.CrossRef
25.
Zurück zum Zitat 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.CrossRef 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.CrossRef
26.
Zurück zum Zitat 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. 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.
Zurück zum Zitat Yao, Z., & Loguinov, D. (2010). Understanding disconnection and stabilization of chord. IEEE Transactions on Parallel and Distributed Systems, 22(4), 650–661.CrossRef Yao, Z., & Loguinov, D. (2010). Understanding disconnection and stabilization of chord. IEEE Transactions on Parallel and Distributed Systems, 22(4), 650–661.CrossRef
28.
Zurück zum Zitat 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. 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.
Metadaten
Titel
Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks
verfasst von
Mahendra Singh
Chiranjeev Kumar
Prem Nath
Publikationsdatum
17.05.2020
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 3/2020
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-020-07475-z

Weitere Artikel der Ausgabe 3/2020

Wireless Personal Communications 3/2020 Zur Ausgabe

Neuer Inhalt