Switching White Papers
Bandwidth-Efficient Management of DHT Routing Tables
Overview 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 and O(log n) protocols. 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 high-churn 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.
| Publisher | Massachusetts Institute of Technology | File Format | |
|---|---|---|---|
| Date Published | April 2005 | ||
| Format | White Papers | ||
| Topics | |||



