SOLD: Self-Organizing Lookups in DHTs for better Performance over Unstable P2P Overlay Links
Andreas Berl, Ivan Dedinski, Amine M. Houyou, Hermann de Meer · 2007
The quality of service (QoS) of a distributed hash ta-ble (DHT) lookup is gaining importance with the growing number of services adopting the P2P paradigm. Examples of applications that could largely benefit from an improved timeliness and reliability of message exchange in DHTs are Domain Name System (DNS), or even newer types of dis-tributed location-based services in a mobile environment. The bursty effects of Internet traffic on latency, congestion, and loss can change the short term state of the overlay links in the DHT. The quick changes to overlay link/node states cannot be taken into account while structuring long term P2P routes. This paper proposes self-organizing mecha-nisms to improve the QoS for DHT lookups, without chang-ing the structure of the DHT network. Different kinds of lookup replication techniques are implemented on top of the DHT to restrict the influence of the heterogeneous capabil-ities of the overlay routes while offering self-adaptive and robust high performance lookups. 1