Sciweavers

84 search results - page 4 / 17
» D1HT: a distributed one hop hash table
Sort
View
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 29 days ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
P2P
2006
IEEE
130views Communications» more  P2P 2006»
14 years 1 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
P2P
2007
IEEE
153views Communications» more  P2P 2007»
14 years 1 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...
ACSAC
2004
IEEE
13 years 11 months ago
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement...
Mudhakar Srivatsa, Ling Liu
CVPR
2012
IEEE
11 years 9 months ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...