Sciweavers

4438 search results - page 39 / 888
» On the Distribution of Keys by Hashing
Sort
View
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...
IPPS
2006
IEEE
15 years 5 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
IPPS
2006
IEEE
15 years 5 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
DBISP2P
2003
Springer
136views Database» more  DBISP2P 2003»
15 years 5 months ago
Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables
Abstract. Building distributed content–based publish/subscribe systems has remained a challenge. Existing solutions typically use a relatively small set of trusted computers as b...
David K. Tam, Reza Azimi, Hans-Arno Jacobsen
PODC
2004
ACM
15 years 5 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