Abstract
In designing structured P2P networks, scalability, resilience, and load balancing are features that are needed to be handled meticulously. The P2P overlay has to handle large scale of nodes while maintaining minimized path lengths in performing lookups. It has also to be resilient to nodes’ failure and be able to distribute the load uniformly over its participant. In this paper, we introduce SHAM: a Scalable, Homogenous, Addressing Mechanism for structured P2P networks. SHAM is a multi-dimensional overlay that places nodes in the network based on geometric addressing and maps keys onto values using consistent hashing.Our simulation results show that SHAM locates keys in the network efficiently, is highly resilient to major nodes’ failure, and has an effective load balancing property. Furthermore, unlike other DHTs and due to its distinguished naming scheme, SHAM deploys homogenous addressing which drastically reduces latency in the underlying network.
Highlights
Locating keys efficiently in structured P2P networks, commonly referred to as distributed hash tables (DHTs), is always associated with the variant of maintaining limited routing tables at nodes
Our motivation behind the work in this paper is to propose an addressing algorithm for Zghaibeh and Ul Hassan EURASIP Journal on Wireless Communications and Networking (2017) 2017:161 structured P2P networks that can balance between the latency and the size of a routing table
There are more recent DHT routing protocols that have been recently developed [28,29,30]. The majority of these systems adopt the paradigms of CAN or Chord or they do not fall into the class of systems that balance between the routing performance and the size of the routing table
Summary
Locating keys efficiently in structured P2P networks, commonly referred to as distributed hash tables (DHTs), is always associated with the variant of maintaining limited routing tables at nodes. The more routing information the node gathers, the less the lookup will take. From another angle to this argument, other research insisted on keeping the size of the routing tables as minimum as possible while sacrificing some of the lookup performance [3,4,5,6]. The point here is that maintaining large routing tables is not viable and, giving up few additional hops to reach the destination is more satisfying. Proposed DHTs differ in this regard and are classified based on the number of hops they require in order to land a lookup at its destination. We categorize the classes in this respect into single-hop overlays, constant degree overlays, multi-dimension overlays, and logarithmic overlays
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
