Routing Tradeoffs in Dynamic Peer-to-peer Networks

Routing Tradeoffs in Dynamic Peer-to-peer Networks (2005)

by Jinyang Li , Robert Morris

Citations:

1 - 0 self

Datum	Value	Source
TITLE	Routing Tradeoffs in Dynamic Peer-to-peer Networks	SVM HeaderParse 0.2
AUTHOR NAME	Jinyang Li	SVM HeaderParse 0.2
AUTHOR AFFIL	MASSACHUSETTS INSTITUTE OF TECHNOLOGY	SVM HeaderParse 0.2
AUTHOR NAME	Robert Morris	SVM HeaderParse 0.2
ABSTRACT	Distributed Hash Tables (DHTs) are useful tools for building large scale distributed systems. DHTs provide a hash-table-like interface to applications by routing a key to its responsible node among the current set of participating nodes. DHT deployments are characterized by churn, a continuous process of nodes joining and leaving the network. Lookup latency is important to applications that use DHTs to locate data. In order to achieve low latency lookups, each node needs to consume bandwidth to keep its routing tables up to date under churn. A robust DHT should use bandwidth sparingly and avoid overloading the network when the the deployment scenario deviates from design assumptions. Ultimately, DHT designers are interested in obtaining best latency lookups using a bounded amount of bandwidth across a wide range of operating environments. This thesis presents a new DHT protocol, Accordion, that achieves this goal. Accordion bounds its overhead traffic according to a user specified bandwidth	SVM HeaderParse 0.2
YEAR	2005	SVM HeaderParse 0.2
CITATIONS	88 found	ParsCit 1.0