Sciweavers

346 search results - page 13 / 70
» Routing networks for distributed hash tables
Sort
View
IPTPS
2003
Springer
14 years 20 days 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
NBIS
2007
Springer
14 years 1 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
NETWORK
2008
115views more  NETWORK 2008»
13 years 7 months ago
A distributed and scalable routing table manager for the next generation of IP routers
Kim Khoa Nguyen, Brigitte Jaumard, Anjali Agarwal
IPTPS
2003
Springer
14 years 20 days 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
GI
2004
Springer
14 years 26 days ago
On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics ...
Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon ...