SHAM: Scalable Homogeneous Addressing Mechanism for structured P2P networks

Abstract

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.

Keywords

• P2P
• Structured
• Performance
• DHT
• Overlay
• Latency