@inproceedings{Disterhft2017CapSearch,
  author = {Andreas Disterhöft and Kalman Graffi (Technology of Social Networks and Heinrich-Heine-Universität Düsseldorf and DFG-Grant GR4498/1-1 "OverlayMeter")},
  title = {CapSearch: Capacity-based Search in highly dynamic Peer-to-Peer Networks},
  year = {2017},
  booktitle = {IEEE Int. Conf. on Advanced Information Networking and Applications (AINA)},
  abstract = {Participants of P2P networks are highly heterogeneous - smart phones versus desktop PCs - and their capacities, modelled as a tuple of measures such as CPU cycles, memory, storage and up- and download bandwidth, also change over time, so a decentralised system needs both to find a given number of nodes that meet a required capacity level (for instance to promote replacement nodes for an overloaded peer) and to find all nodes in a capacity range. The paper proposes CapSearch, an indexing and search mechanism built on a static kd-tree whose nodes are logical nodes, i.e. DHT objects rather than p},
  note = {2016_Pub__IEEE.AINA.17_AD_Capacity-based-Search.pdf},
}
