Paper Info
Title
Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
Abstract
Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications.
Year
DOI
Venue
2013
10.1109/NetSys.2013.9
Networked Systems
Keywords
Field
DocType
well-evaluated overlay,various application,homogeneous node,overloaded peer,structured overlay,hash tables,attractive dht-based application,popular data,capacity-aware storage indirection,various content,practical use case,typical structured overlay,pastry,p2p,indexing,load balancing,routing,social network,chord,cryptography,protocols,kademlia
Peer-to-peer,Pastry,Computer science,Load balancing (computing),Distributed data store,Computer network,Chord (music),Overlay,Kademlia,Hash table,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-4950-7
4
0.41
References 
Authors
23
2
Name
Order
Citations
PageRank
Philip Wette1615.51
Kalman Graffi222828.17