Computer Science Colloquium
Robust DHT Lookups with Accordion
Friday, April 8, 2005 11:30 A.M.
Room 1302 Warren Weaver Hall
251 Mercer Street
New York, NY 10012-1185
Colloquium Information: http://cs.nyu.edu/csweb/Calendar/colloquium/index.html
Richard Cole email@example.com, (212) 998-3119
Lookup protocols allow Distributed Hash Tables (DHTs) to find the
data associated with a given key. The ideal lookup protocol would
have robust performance over a range of environments: low lookup
latency with a small number of stable nodes, and low bandwidth
overhead if there are many nodes or the nodes are unstable. Each
existing lookup protocol is designed to achieve a good latency/overhead
tradeoff in a specific environment, but doesn't typically achieve
good efficiency across a range of environments. We present a new
lookup protocol, Accordion, that automatically adapts itself to the
current environment to achieve competetive latency given a user
specified bandwidth budget.
Jinyang Li is a Ph.D. candidate at MIT. Her research interests
are in distributed systems and networks. She has worked on
peer-to-peer lookup algorithms, wireless ad-hoc routing protocols
and distributed information retrieval systems.
| contact firstname.lastname@example.org