Bandwidth-efficient management of DHT routing tables

DMCA

Bandwidth-efficient management of DHT routing tables (2005)

Cached

Download Links

by Jinyang Li , Jeremy Stribling , Robert Morris , M. Frans Kaashoek

Citations:

64 - 3 self

BibTeX

@MISC{Li05bandwidth-efficientmanagement,
    author = {Jinyang Li and Jeremy Stribling and Robert Morris and M. Frans Kaashoek},
    title = { Bandwidth-efficient management of DHT routing tables},
    year = {2005}
}

OpenURL

Abstract

Today an application developer using a distributed hash table (DHT) with n nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols [9, 18] and O(log n) protocols [20–23,25,26]. O(1) protocols achieve low latency lookups on small or low-churn networks because lookups take only a few hops, but incur high maintenance traffic on large or high-churn networks. O(log n) protocols incur less maintenance traffic on large or highchurn networks but require more lookup hops in small networks. Accordion is a new routing protocol that does not force the developer to make this choice: Accordion adjusts itself to provide the best performance across a range of network sizes and churn rates while staying within a bounded bandwidth budget. The key challenges in the design of Accordion are the algorithms that choose the routing table’s size and content. Each Accordion node learns of new neighbors opportunistically, in a way that causes the density of its neighbors to be inversely proportional to their distance in ID space from the node. This distribution allows Accordion to vary the table size along a continuum while still guaranteeing at most O(log n) lookup hops. The user-specified bandwidth budget controls the rate at which a node learns about new neighbors. Each node limits its routing table size by evicting neighbors that it judges likely to have failed. High churn (i.e., short node lifetimes) leads to a high eviction rate. The equilibrium between the learning and eviction processes determines the table size. Simulations show that Accordion maintains an efficient lookup latency versus bandwidth tradeoff over a wider range of operating conditions than existing DHTs.

Keyphrases

bandwidth-efficient management table size new neighbor lookup hop high-churn network network size efficient lookup latency low-churn network highchurn network application developer high churn distributed hash table user-specified bandwidth budget maintenance traffic accordion node learns eviction process lookup protocol bounded bandwidth budget high eviction rate bandwidth tradeoff key challenge id space dht protocol operating condition high maintenance traffic short node lifetime small network wider range routing table size low latency lookup

DMCA