@inproceedings{Group2013Addingx,
  author = {Philip Wette (Computer Networks Group and Universität Paderborn) and Kalman Graffi (Technology of Social Networks Group and HHU Düsseldorf)},
  title = {Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables},
  year = {2013},
  booktitle = {IEEE Int. Conf. on Networked Systems (IEEE NetSys)},
  abstract = {Typical structured overlays such as Chord, Pastry and Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality, and in practical use cases nodes get overloaded by storing popular data. This paper presents a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays by separating the indexing of data from its storage, so that the responsible peer keeps the index entry while a supplier peer explicitly chosen for its free upload capacity hosts and delivers the file; randomised caching and virtual peers were},
  note = {2013_Pub__Kalman.Graffi_IEEE.NetSys_Adaptive.Chord.pdf},
}
