Routing Networks for Distributed Hash Tables (2003)
Cached
Download Links
| Citations: | 56 - 7 self |
BibTeX
@MISC{Manku03routingnetworks,
author = {Gurmeet Singh Manku},
title = { Routing Networks for Distributed Hash Tables},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted to handle the dynamic nature of participants in peer-to-peer networks. A unified picture of randomized routing topologies is also presented. Two new protocols are described which improve average latency as a function of out-degree. One of the protocols can be shown to be optimal with high probability. Finally, routing networks for distributed hashing are revisited from a systems perspective and several open design problems are listed.
Keyphrases
distributed hash table peer-to-peer network distributed hashing classical parallel interconnection network general technique several open design problem deterministic routing topology new protocol high probability unified picture randomized routing topology improve average latency dynamic nature system perspective
