Sciweavers

346 search results - page 17 / 70
» Routing networks for distributed hash tables
Sort
View
AIMS
2009
Springer
14 years 4 days ago
Evaluation of Sybil Attacks Protection Schemes in KAD
In this paper, we assess the protection mechanisms entered into recent clients to fight against the Sybil attack in KAD, a widely deployed Distributed Hash Table. We study three m...
Thibault Cholez, Isabelle Chrisment, Olivier Festo...
LCN
2008
IEEE
14 years 1 months ago
Supporting geographical queries onto DHTs
Location-based services (LBS) are currently receiving world-wide attention as a consequence of the massive usage of mobile devices, but such location services require scalable dis...
Jordi Pujol Ahulló, Pedro García L&o...
ISPAN
2005
IEEE
14 years 1 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
INFOCOM
2003
IEEE
14 years 23 days ago
Turning Heterogeneity into an Advantage in Overlay Routing
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...
Zhichen Xu, Mallik Mahalingam, Magnus Karlsson
NOMS
2008
IEEE
115views Communications» more  NOMS 2008»
14 years 1 months ago
A scheme for dynamic monitoring and logging of topology information in Wireless Mesh Networks
—We propose a distributed monitoring scheme for an ad-hoc/MESH network topology, and design a Distributed Hash Table based Peer-to-Peer system to log the topology information. A ...
Cristian Popi, Olivier Festor