Handling churn in a dht Export

@misc{citeulike:600462, abstract = {This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as...}, author = {Rhea, S. and Geels, D. and Roscoe, T. and Kubiatowicz, J.}, citeulike-article-id = {600462}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9928}, keywords = {churn, dht, p2p}, posted-at = {2007-10-29 04:21:05}, priority = {0}, title = {Handling churn in a dht}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9928}, year = {2004} }

TY - GEN ID - citeulike:600462 L3 - citeulike-article-id:600462 N2 - This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as... TI - Handling churn in a dht KW - churn KW - dht KW - p2p AU - Rhea, S AU - Geels, D AU - Roscoe, T AU - Kubiatowicz, J PY - 2004/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9928 ER -