456 search results - page 3 / 92 » On Routing in Distributed Hash Tables |
PODC
2004
ACM
13 years 11 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
BROADCOM
2008
IEEE
14 years 2 days ago
2008
IEEE
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
NCA
2006
IEEE
13 years 11 months ago
2006
IEEE
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
SIGMETRICS
2003
ACM
13 years 11 months ago
2003
ACM
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...