Tambour: A Scalable and Robust DHT Protocol
Xiao Shu, Xining Li · 2009
Distributed Hash Tables (DHTs) organize the peer-to-peer network in a structured manner and provide a simple lookup interface which is similar to a hash table. 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 probes its neighbours, but selects multiple nodes with high probability of availability and low latency to forward lookup messages in a parallel manner. In simulation evaluations, Tambour shows good lookup performance and robustness against high level of churn.