Sciweavers

84 search results - page 1 / 17
» D1HT: a distributed one hop hash table
Sort
View
IPPS
2006
IEEE
13 years 10 months ago
D1HT: a distributed one hop hash table
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...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
GLOBECOM
2009
IEEE
13 years 11 months ago
Peer-to-Peer Single Hop Distributed Hash Tables
Abstract—Efficiently locating information in large-scale distributed systems is a challenging problem to which Peer-to-Peer (P2P) Distributed Hash Tables (DHTs) can provide a hi...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
ISCC
2006
IEEE
104views Communications» more  ISCC 2006»
13 years 10 months ago
Stable High-Capacity One-Hop Distributed Hash Tables
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
John Risson, Aaron Harwood, Tim Moors
PODC
2004
ACM
13 years 10 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
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...
Gurmeet Singh Manku
BROADCOM
2008
IEEE
13 years 11 months ago
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....