A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
SWIM: Scalable Weakly-consistent Infection-style Process Group Membership Protocol
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
DNS Meets DHT: Treating Massive ID Resolution Using DNS Over DHT
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems
IEEE Transactions on Parallel and Distributed Systems
The design of a robust peer-to-peer system
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Reliable VoIP Services Using a Peer-to-Peer Intranet
ISM '06 Proceedings of the Eighth IEEE International Symposium on Multimedia
Efficient routing for peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
On scalability of DHT-DNS hybrid naming system
AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks
| Hi-index | 0.00 |
DHT (Distributed Hash Table) algorithms are very efficient for distributed data storage and retrieval. As one kind of P2P overlay, DHT overlay also has the advantages of high reliability, high scalability and low cost. DHT has not only been applied to form user nodes' overlays, but also been proposed to form DHT-based server farms, such as DHT-based SIP server farm, HSS server farm, DNS server farm, CDN server farm, etc. However, seldom DHT algorithms consider server farm's stringent requirement on system capacity, and only a handful of DHT algorithms take server into consideration. This paper presents our DHT algorithm called SFDHT for high throughput DHT server farm. Compared with existing DHTs, SFDHT considers the characters and requirements of DHT server farm and maximizes system capacity. SFDHT is a one-hop DHT with novel built-in load balancing solution. The proposed load balancing solution produces much less overhead that existing solutions do. Both theoretical analysis and simulation results show that SFDHT can reduce overhead, balance load and improve system capacity.