| Distributed Hash Table (DHT) is a new branch in the distributed system studies. Unlike majority of current file sharing peer-to-peer systems, DHT networks organize the peer-to-peer network in a structured manner and provide a simple lookup interface which is similar to a hash table.In simulation evaluations, Tambour shows good lookup performance and robustness against unexpectedly high level of churn. We believe some techniques of Tambour can also be applied to many other DHTs to improve their performances.In this paper, we present a new DHT protocol, Tambour, which bounds its communication overhead automatically and controls the lookup latency with high probability across a wide range of operating scenarios. Unlike many popular DHTs which employ a fixed routing table size, Tambour maintains a flexible routing table and tunes its size dynamically to improve lookup performance. It does not periodically probe its neighbours, but selects multiple nodes with high probability of availability and low latency to forward lookup messages to in a parallel manner. |
