KIT | KIT-Bibliothek | Impressum
DOI: 10.1109/HPCSim.2014.6903714

Self-Optimization of DHT Lookups through Run-Time Performance Analysis

Jünemann, K.; Hartenstein, H.

Distributed Hash Tables (DHTs) provide information lookup within a Peer-to-Peer (P2P) network. A multitude of distributed applications leverages DHTs for offering more advanced services such as distributed file systems, web caches or distributed DNS. For such DHT-based applications, lookup performance is highly important. However, lookup performance is severely affected by network characteristics, i.e., churn and connectivity issues due to NAT routers. As those characteristics are heavily influenced by user behavior, changes are not only likely but also hard to predict. Although DHTs are known for their self-organization, current implementations often do not adapt optimally to variation in network characteristics. In this paper, we propose to dynamically optimize the client through tuning its parameters at run-time. For doing so, different configurations are tested and compared automatically. To reduce overhead, requests sent to other peers are recorded and replayed by a simulation engine, if the same peer is queried again using the same parameter. We evaluated our approach at two exemplary scenarios of the future state of the BitTo ... mehr

Zugehörige Institution(en) am KIT Institut für Telematik (TM)
Steinbuch Centre for Computing (SCC)
Publikationstyp Proceedingsbeitrag
Jahr 2014
Sprache Englisch
Identifikator ISBN: 978-1-4799-5312-7
KITopen ID: 1000041129
Erschienen in Proceedings of the 2014 International Conference on High Performance Computing and Simulation, HPCS 2014; Bologna; Italy; 21 July 2014 through 25 July 2014
Verlag IEEE, Piscataway (NJ)
Seiten 407-415
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page