CHOP6

A DHT routing mechanism considering proximity

Shouta Morimoto, Fumio Teraoka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationSAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W
DOIs
Publication statusPublished - 2007
Event2007 International Symposium on Applications and the Internet - Workshops, SAINT-W - Hiroshima, Japan
Duration: 2007 Jan 152007 Jan 19

Other

Other2007 International Symposium on Applications and the Internet - Workshops, SAINT-W
CountryJapan
CityHiroshima
Period07/1/1507/1/19

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Morimoto, S., & Teraoka, F. (2007). CHOP6: A DHT routing mechanism considering proximity. In SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W [4090128] https://doi.org/10.1109/SAINT-W.2007.32

CHOP6 : A DHT routing mechanism considering proximity. / Morimoto, Shouta; Teraoka, Fumio.

SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W. 2007. 4090128.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Morimoto, S & Teraoka, F 2007, CHOP6: A DHT routing mechanism considering proximity. in SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W., 4090128, 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W, Hiroshima, Japan, 07/1/15. https://doi.org/10.1109/SAINT-W.2007.32
Morimoto S, Teraoka F. CHOP6: A DHT routing mechanism considering proximity. In SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W. 2007. 4090128 https://doi.org/10.1109/SAINT-W.2007.32
Morimoto, Shouta ; Teraoka, Fumio. / CHOP6 : A DHT routing mechanism considering proximity. SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W. 2007.
@inproceedings{70c45419b61a407f863bca55bb21a32d,
title = "CHOP6: A DHT routing mechanism considering proximity",
abstract = "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.",
author = "Shouta Morimoto and Fumio Teraoka",
year = "2007",
doi = "10.1109/SAINT-W.2007.32",
language = "English",
isbn = "0769527574",
booktitle = "SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W",

}

TY - GEN

T1 - CHOP6

T2 - A DHT routing mechanism considering proximity

AU - Morimoto, Shouta

AU - Teraoka, Fumio

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46649094189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46649094189&partnerID=8YFLogxK

U2 - 10.1109/SAINT-W.2007.32

DO - 10.1109/SAINT-W.2007.32

M3 - Conference contribution

SN - 0769527574

SN - 9780769527574

BT - SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W

ER -