LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
A Framework for Self-Optimizing Grids Using P2P Components
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
The design of a robust peer-to-peer system
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Comparing the performance of distributed hash tables under churn
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
When multi-hop peer-to-peer lookup matters
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Exploiting parallelism in the design of peer-to-peer overlays
Computer Communications
Management of peer-to-peer overlays
International Journal of Internet Protocol Technology
Efficient query routing by improved peer description in P2P networks
Proceedings of the 3rd international conference on Scalable information systems
P2P Networking and Applications
P2P Networking and Applications
Chameleon: an adaptable 2-tier variable hop overlay
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Performance evaluation of a reliable content mediation platform in the emerging future internet
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Peer-to-peer single hop distributed hash tables
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DHT performance for peer-to-peer SIP - a mobile phone perspective
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Multimedia Tools and Applications
Performance evaluation of EpiChord under high churn
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for huge and dynamic peer-to-peer (P2P) systems. We formally define the algorithm we propose to detect and notify any membership change in the system, prove its correctness and performance properties, and present a Quarantine-like mechanism to reduce the overhead caused by volatile peers. Our analyses show that D1HT has reasonable maintenance bandwidth requirements even for very large systems, while presenting at least twice less bandwidth overhead than previous single hop DHT.