Sciweavers

456 search results - page 13 / 92
» On Routing in Distributed Hash Tables
Sort
View
SAINT
2006
IEEE
14 years 2 months ago
PaxonDHT: Achieving Consensus in Distributed Hash Tables
Despite the scalability, availability and resiliency potential suggested by Distributed Hash Tables, their lack of support for replication of mutable data and for strong consisten...
Ben Temkow, Anne-Marie Bosneag, Xinjie Li, Monica ...
IPTPS
2003
Springer
14 years 1 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
EDBTW
2004
Springer
14 years 1 months ago
A Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems
The two main approaches to find data in peer-to-peer (P2P) systems are unstructured networks using flooding and structured networks using a distributed index. A distributed index i...
Fabius Klemm, Anwitaman Datta, Karl Aberer
TPDS
2010
126views more  TPDS 2010»
13 years 3 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
IPPS
2006
IEEE
14 years 2 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