Exploiting network proximity in distributed hash tables Export

@misc{citeulike:774181, abstract = {Self-organizing peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry (also called distributed hash tables or DHTs) offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying Internet.}, author = {Castro, M. and Druschel, P. and Hu, Y. and Rowstron, A.}, citeulike-article-id = {774181}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7919}, keywords = {dht, network, proximity}, posted-at = {2006-07-26 06:01:28}, priority = {0}, title = {Exploiting network proximity in distributed hash tables}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7919}, year = {2002} }

TY - GEN ID - citeulike:774181 L3 - citeulike-article-id:774181 N2 - Self-organizing peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry (also called distributed hash tables or DHTs) offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying Internet. TI - Exploiting network proximity in distributed hash tables KW - dht KW - network KW - proximity AU - Castro, M AU - Druschel, P AU - Hu, Y AU - Rowstron, A PY - 2002/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7919 ER -