Designing a DHT for low latency and high throughput

@misc{citeulike:162868, abstract = {Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including iterative routing, recursive routing, proximity routing and neighbor selection, erasure coding, replication, and server selection.}, author = {Dabek, F. and Li, J. and Sit, E. and Robertson, J. and Kaashoek, M. and Morris, R. }, citeulike-article-id = {162868}, keywords = {dht, locality}, posted-at = {2008-05-01 10:29:31}, priority = {2}, title = {Designing a DHT for low latency and high throughput}, url = {http://citeseer.ist.psu.edu/dabek04designing.html}, year = {2004} }

TY - GEN ID - citeulike:162868 L3 - citeulike-article-id:162868 TI - Designing a DHT for low latency and high throughput N2 - Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solutions, including iterative routing, recursive routing, proximity routing and neighbor selection, erasure coding, replication, and server selection. KW - dht KW - locality AU - Dabek, F AU - Li, J AU - Sit, E AU - Robertson, J AU - Kaashoek, M AU - Morris, R PY - 2004/// UR - http://citeseer.ist.psu.edu/dabek04designing.html ER -