Sciweavers

10 search results - page 1 / 2
» Stable High-Capacity One-Hop Distributed Hash Tables
Sort
View
ISCC
2006
IEEE
104views Communications» more  ISCC 2006»
13 years 11 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
IPPS
2006
IEEE
13 years 11 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
EDBT
2008
ACM
129views Database» more  EDBT 2008»
14 years 5 months ago
Continuous multi-way joins over distributed hash tables
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
Stratos Idreos, Erietta Liarou, Manolis Koubarakis
INFOCOM
2007
IEEE
13 years 11 months ago
On the Stability-Scalability Tradeoff of DHT Deployment
— Distributed hash tables (DHTs) provide efficient data naming and location with simple hash-table-like primitives, upon which sophisticated distributed applications can be buil...
Chih-Chiang Wang, Khaled Harfoush