loading...
T-DHT: Topology-based Distributed Hash Tables
Konstanz, Germany August 31-September 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2005.36Fifth IEEE International Conference o ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle, "T-DHT: Topology-based Distributed Hash Tables," Peer-to-Peer Computing, IEEE International Conference on, pp. 143-144, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/P2P.2005.36,
author = {Olaf Landsiedel and Katharina Anna Lehmann and Klaus Wehrle},
title = {T-DHT: Topology-based Distributed Hash Tables},
journal ={Peer-to-Peer Computing, IEEE International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2376-5},
pages = {143-144},
doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2005.36},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Peer-to-Peer Computing, IEEE International Conference on
TI - T-DHT: Topology-based Distributed Hash Tables
SN - 0-7695-2376-5
SP143
EP144
A1 - Olaf Landsiedel,
A1 - Katharina Anna Lehmann,
A1 - Klaus Wehrle,
PY - 2005
KW - null
VL - 0
JA - Peer-to-Peer Computing, IEEE International Conference on
ER -
 
Olaf Landsiedel, University of Tübingen
Katharina Anna Lehmann, University of Tübingen
Klaus Wehrle, University of Tübingen
In this paper, we introduce topology-based distributed hash tables (T-DHT) as an infrastructure for data-centric storage, information processing, and routing in ad hoc and sensor networks. T-DHTs do not rely on location information and work even in the presence of voids in the network. Using a virtual coordinate system, we construct a distributed hash table which is strongly oriented to the underlying network topology. Thus, adjacent areas in the hash table commonly have a direct link in the network. Routing in the T-DHT guarantees reachability and introduces low hop-overhead compared with the shortest path.
Citation:
Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle, "T-DHT: Topology-based Distributed Hash Tables," p2p, pp.143-144, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.