Sciweavers

1080 search results - page 2 / 216
» Distributed Hash Tables
Sort
View
BROADCOM
2008
IEEE
13 years 12 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....
CISIS
2009
IEEE
14 years 8 days ago
Integration of Shareable Containers with Distributed Hash Tables for Storage of Structured and Dynamic Data
Structured, spatial-temporal data arises in many applications areas such as transportation, sensor networks or mobile services. Peer to peer networks are the natural choice for th...
eva Kühn, Richard Mordinyi, Hannu-D. Goiss, T...
NCA
2006
IEEE
13 years 11 months ago
Congestion Control for Distributed Hash Tables
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...
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
IPTPS
2003
Springer
13 years 10 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
P2P
2006
IEEE
101views Communications» more  P2P 2006»
13 years 11 months ago
Towards Scalable Mobility in Distributed Hash Tables
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
Olaf Landsiedel, Stefan Götz, Klaus Wehrle