Sciweavers

1080 search results - page 4 / 216
» Distributed Hash Tables
Sort
View
IPTPS
2003
Springer
15 years 4 months ago
Koorde: A Simple Degree-Optimal Distributed Hash Table
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
M. Frans Kaashoek, David R. Karger
ERCIMDL
2005
Springer
91views Education» more  ERCIMDL 2005»
15 years 5 months ago
LibraRing: An Architecture for Distributed Digital Libraries Based on DHTs
We present a digital library architecture based on distributed hash tables. We discuss the main components of this architecture and the protocols for offering information retrieva...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
DSOM
2006
Springer
15 years 3 months ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
KIVS
2005
Springer
15 years 5 months ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
IPTPS
2004
Springer
15 years 5 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...