loading...
CHOP6: A DHT Routing Mechanism Considering Proximity
Hiroshima, Japan January 15-January 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.322007 International Symposium on Appli ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
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 
 
Shouta Morimoto, Fumio Teraoka, "CHOP6: A DHT Routing Mechanism Considering Proximity," Applications and the Internet Workshops, IEEE/IPSJ International Symposium on, pp. 59, 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SAINT-W.2007.32,
author = {Shouta Morimoto and Fumio Teraoka},
title = {CHOP6: A DHT Routing Mechanism Considering Proximity},
journal ={Applications and the Internet Workshops, IEEE/IPSJ International Symposium on},
volume = {0},
year = {2007},
isbn = {0-7695-2757-4},
pages = {59},
doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT-W.2007.32},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Applications and the Internet Workshops, IEEE/IPSJ International Symposium on
TI - CHOP6: A DHT Routing Mechanism Considering Proximity
SN - 0-7695-2757-4
SP
EP
A1 - Shouta Morimoto,
A1 - Fumio Teraoka,
PY - 2007
KW - null
VL - 0
JA - Applications and the Internet Workshops, IEEE/IPSJ International Symposium on
ER -
 
Shouta Morimoto, Keio University, Japan
Fumio Teraoka, Keio University, Japan
This paper proposes a DHT routing mechanism called CHOP6. CHOP6 takes proximity into account by using the properties of the IPv6 address format. CHOP6 introduces the 64-bit node ID, in which the lower part is the IPv6 global routing prefix. By examining the node ID, it is possible to roughly estimate the proximity to the node. Similar to Chord, CHOP6 uses the finger table. In CHOP6, the finger table entry holds more than one candidate nodes. When sending a query, the source node estimates the proximity to the candidate nodes by examining the node IDs if the RTT to the nodes is unknown. CHOP6 was implemented in Java on FreeBSD. The measured results showed that the time to get data in CHOP6 is less than that in Chord and the number of the messages necessary to maintain routing information in CHOP6 is also less than that in Chord.
Citation:
Shouta Morimoto, Fumio Teraoka, "CHOP6: A DHT Routing Mechanism Considering Proximity," saint-w, pp.59, 2007 International Symposium on Applications and the Internet Workshops (SAINTW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.