@misc{Group2013Adding,
  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},
  howpublished = {IEEE Int. Conf. on Networked Systems (IEEE NetSys)},
  abstract = {These are the 25 slides (including a backup slide) of the NetSys 2013 presentation by Philip Wette (Computer Networks Group, University of Paderborn) and Kalman Graffi (Technology of Social Networks Group, HHU Düsseldorf) of the paper on making homogeneous distributed hash tables capacity aware. The motivation section recalls peer-to-peer and DHT basics with Chord as the prototype and argues that load becomes unbalanced even when keys and peers are evenly distributed in the identifier space, because file sizes and file popularities are heterogeneous, a small group of files is responsible for t},
  note = {2013_Pub__Kalman.Graffi_IEEE.NetSys_Adaptive.Chord-Talk.pdf},
}
