Abstract | ||
---|---|---|
Structured P2P network must be able to handle churn effectively and be resilient to nodes failure. The network must also scale to large number of nodes while maintaining a minimum diameter. In this paper we introduce SAM: A Scalable Addressing Mechanism for structured P2P networks. SAM places nodes based on geometric addressing, maps keys onto values using Distributed Hash Table (DHT), and locates keys in the network efficiently. Lookups in SAM are bounded to O(N-1/d), where d is the number of dimensions. Moreover, each node in SAM only maintains 2(3d-1) routing entries. Finally, SAM adapts to nodes dynamics and recovers lost paths by deploying two maintenance algorithms. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-60834-1_13 | AECIA |
Keywords | DocType | Volume |
P2P,Structured,Performance,DHT,Overlay,Latency | Conference | 565 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Manaf Zghaibeh | 1 | 1 | 1.45 |
Najam Ul Hasan | 2 | 132 | 12.86 |