Sciweavers

456 search results - page 11 / 92
» On Routing in Distributed Hash Tables
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Geographic Routing Using Hyperbolic Space
Abstract— We propose a scalable and reliable point-topoint routing algorithm for ad hoc wireless networks and sensornets. Our algorithm assigns to each node of the network a virt...
Robert Kleinberg
GLOBECOM
2007
IEEE
14 years 2 months ago
Bridging Distributed Hash Tables in Wireless Ad-Hoc Networks
—The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers...
Lawrence Cheng
ICDCSW
2007
IEEE
14 years 2 months ago
Survey of Six Myths and Oversights about Distributed Hash Tables' Security
Distributed Hash Tables (DHT) was not designed to be secure against malicious users. But some secure systems like trust and reputation management algorithms trust DHT with their d...
Sylvain Dahan, Mitsuhisa Sato
GIR
2006
ACM
14 years 2 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
P2P
2006
IEEE
101views Communications» more  P2P 2006»
14 years 2 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