Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks
- PDF / 2,138,742 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 82 Downloads / 153 Views
Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks Mahendra Singh1 · Chiranjeev Kumar1 · Prem Nath2
© Springer Science+Business Media, LLC, part of Springer Nature 2020
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. Keywords Finger forwarding · Chord · Successor · Predecessor · Lookup path
1 Introduction Peer-to-peer (P2P) systems provide a platform for users to share their resources. With the recent increase in Internet-based applications, P2P systems have attracted many users and the research community. P2P networks are distributed systems without any controlling server. Broadly the P2P networks can be categorized into two viz. centralized and * Mahendra Singh [email protected]; [email protected] Chiranjeev Kumar [email protected] Prem Nath [email protected] 1
Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad 826004, India
2
Department of Computer Science and Engineering, Mizoram University, Aizawl 796004, India
13
Vol.:(0123456789)
M. Singh et al.
distributed with the distributed network further divided into structured and unstructured. The distributed P2P networks do not operate based on any central server that maintains directory information of individual nodes instead they function in a decentralized manner. However, for structured P2P networks, there exists a certain network overlay (deterministic topology) over the participating nodes. The resource access procedure in the structured P2P networks is governed by distributed hash table (DHT) [5] or DHT-based protocols. Chord protocol is a DHT-based protocol and it is well accepted among the P2P networks community due to its simple notion and robust characteristics. The network topology in structured P2P networks is tightly controlled by DHT based protocols like chord [23, 24], pastry [22], tapestry [28], CAN [20], e
Data Loading...
