• DocumentCode
    1679180
  • Title

    SFDHT: A DHT Designed for Server Farm

  • Author

    Li, Lichun ; Zhang, Chunhong ; Mi, Wei ; Zhang, Yonghui ; Ma, Tao ; Ji, Yang ; Qiu, Xiaofeng

  • Author_Institution
    Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2009
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    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.
  • Keywords
    file organisation; resource allocation; DHT server farm; P2P overlay; SFDHT; built-in load balancing solution; distributed data storage; distributed hash table algorithm; one hop DHT; server farm; system capacity maximization; Algorithm design and analysis; Costs; Information retrieval; Intrusion detection; Load management; Memory; Partitioning algorithms; Routing; Scalability; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
  • Conference_Location
    Honolulu, HI
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-4148-8
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2009.5425339
  • Filename
    5425339