SFDHT: A DHT Designed for Server Farm

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.

[1]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[2]  Brighten Godfrey,et al.  Heterogeneity and load balance in distributed hash tables , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  David R. Karger,et al.  New Algorithms for Load Balancing in Peer-to-Peer Systems , 2003 .

[4]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[5]  Liuba Shrira,et al.  The design of a robust peer-to-peer system , 2002, EW 10.

[6]  Miguel A. Garcia-Martin,et al.  A Distributed IP Multimedia Subsystem (IMS) , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[7]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[9]  Thomas Magedanz,et al.  Reliable VoIP Services Using a Peer-to-Peer Intranet , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).

[10]  Yusuke Doi.  DNS meets DHT: treating massive ID resolution using DNS over DHT , 2005, The 2005 Symposium on Applications and the Internet.

[11]  Gang Wang,et al.  One-Hop DHT Lookup based on Grouped Random Broadcast Messages , 2007, 2007 IEEE International Conference on Integration Technology.

[12]  Stefan Savage,et al.  Structured superpeers: leveraging heterogeneity to provide constant-time lookup , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[13]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[15]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[16]  Yiming Hu,et al.  Efficient, proximity-aware load balancing for DHT-based P2P systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[17]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2004, SPAA '04.

[18]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[19]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[20]  Yusuke Doi,et al.  On Scalability of DHT-DNS Hybrid Naming System , 2006, AINTEC.

[21]  David Mazières,et al.  Democratizing Content Publication with Coral , 2004, NSDI.

[22]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[23]  Abhinandan Das,et al.  SWIM: scalable weakly-consistent infection-style process group membership protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.

[24]  Yao Wang,et al.  Reliable and Scalable DHT-Based SIP Server Farm , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[25]  Ji Li,et al.  Achieving one-hop DHT lookup and strong stabilization by passing tokens , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[26]  Daniel Massey,et al.  A Comparative Study of the DNS Design with DHT-Based Alternatives , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[27]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.