Embedding network coordinates into the heart of distributed hash tables

Toshinori Kojima, Masato Asahara, Kenji Kono, Ai Hayakawa

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

8 Citations (Scopus)

Abstract

Network coordinates (NCS) construct a logical space which enables efficient and accurate estimation of network latency. Although many researchers have proposed NC-based strategies to reduce the lookup latency of distributed hash tables (DHTs), these strategies are limited in the improvement of the lookup latency; the nearest node to which a query should be forwarded is not always included in the consideration scope of a node. This is because conventional DHTs assign node IDs independent of the underlying physical network. In this paper, we propose an NC-based method of constructing a topology-aware DHT by Proximity Identifier Selection strategy (PIS/NC). PIS/NC assigns an ID to each node based on NC of the node. This paper presents Canary, a PIS/NC-based CAN whose d-dimensional logical space corresponds to that of Vivaldi. Our simulation results suggest that PIS/NC has the possibility of dramatically improving the lookup latency of DHTs. Whereas DHash++ is only able to reduce the median lookup latency by 15% of the original Chord, Canary reduces it by 70% of the original CAN.

Original languageEnglish
Title of host publicationIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
Pages155-158
Number of pages4
DOIs
Publication statusPublished - 2009
EventIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing - Seattle, WA, United States
Duration: 2009 Sep 92009 Sep 11

Other

OtherIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing
CountryUnited States
CitySeattle, WA
Period09/9/909/9/11

Fingerprint

Topology

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this

Kojima, T., Asahara, M., Kono, K., & Hayakawa, A. (2009). Embedding network coordinates into the heart of distributed hash tables. In IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing (pp. 155-158). [5284517] https://doi.org/10.1109/P2P.2009.5284517

Embedding network coordinates into the heart of distributed hash tables. / Kojima, Toshinori; Asahara, Masato; Kono, Kenji; Hayakawa, Ai.

IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing. 2009. p. 155-158 5284517.

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

Kojima, T, Asahara, M, Kono, K & Hayakawa, A 2009, Embedding network coordinates into the heart of distributed hash tables. in IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing., 5284517, pp. 155-158, IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing, Seattle, WA, United States, 09/9/9. https://doi.org/10.1109/P2P.2009.5284517
Kojima T, Asahara M, Kono K, Hayakawa A. Embedding network coordinates into the heart of distributed hash tables. In IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing. 2009. p. 155-158. 5284517 https://doi.org/10.1109/P2P.2009.5284517
Kojima, Toshinori ; Asahara, Masato ; Kono, Kenji ; Hayakawa, Ai. / Embedding network coordinates into the heart of distributed hash tables. IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing. 2009. pp. 155-158
@inproceedings{d23dfc82f2ab4d4baac3d1e845089e96,
title = "Embedding network coordinates into the heart of distributed hash tables",
abstract = "Network coordinates (NCS) construct a logical space which enables efficient and accurate estimation of network latency. Although many researchers have proposed NC-based strategies to reduce the lookup latency of distributed hash tables (DHTs), these strategies are limited in the improvement of the lookup latency; the nearest node to which a query should be forwarded is not always included in the consideration scope of a node. This is because conventional DHTs assign node IDs independent of the underlying physical network. In this paper, we propose an NC-based method of constructing a topology-aware DHT by Proximity Identifier Selection strategy (PIS/NC). PIS/NC assigns an ID to each node based on NC of the node. This paper presents Canary, a PIS/NC-based CAN whose d-dimensional logical space corresponds to that of Vivaldi. Our simulation results suggest that PIS/NC has the possibility of dramatically improving the lookup latency of DHTs. Whereas DHash++ is only able to reduce the median lookup latency by 15{\%} of the original Chord, Canary reduces it by 70{\%} of the original CAN.",
author = "Toshinori Kojima and Masato Asahara and Kenji Kono and Ai Hayakawa",
year = "2009",
doi = "10.1109/P2P.2009.5284517",
language = "English",
isbn = "9781424450671",
pages = "155--158",
booktitle = "IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing",

}

TY - GEN

T1 - Embedding network coordinates into the heart of distributed hash tables

AU - Kojima, Toshinori

AU - Asahara, Masato

AU - Kono, Kenji

AU - Hayakawa, Ai

PY - 2009

Y1 - 2009

N2 - Network coordinates (NCS) construct a logical space which enables efficient and accurate estimation of network latency. Although many researchers have proposed NC-based strategies to reduce the lookup latency of distributed hash tables (DHTs), these strategies are limited in the improvement of the lookup latency; the nearest node to which a query should be forwarded is not always included in the consideration scope of a node. This is because conventional DHTs assign node IDs independent of the underlying physical network. In this paper, we propose an NC-based method of constructing a topology-aware DHT by Proximity Identifier Selection strategy (PIS/NC). PIS/NC assigns an ID to each node based on NC of the node. This paper presents Canary, a PIS/NC-based CAN whose d-dimensional logical space corresponds to that of Vivaldi. Our simulation results suggest that PIS/NC has the possibility of dramatically improving the lookup latency of DHTs. Whereas DHash++ is only able to reduce the median lookup latency by 15% of the original Chord, Canary reduces it by 70% of the original CAN.

AB - Network coordinates (NCS) construct a logical space which enables efficient and accurate estimation of network latency. Although many researchers have proposed NC-based strategies to reduce the lookup latency of distributed hash tables (DHTs), these strategies are limited in the improvement of the lookup latency; the nearest node to which a query should be forwarded is not always included in the consideration scope of a node. This is because conventional DHTs assign node IDs independent of the underlying physical network. In this paper, we propose an NC-based method of constructing a topology-aware DHT by Proximity Identifier Selection strategy (PIS/NC). PIS/NC assigns an ID to each node based on NC of the node. This paper presents Canary, a PIS/NC-based CAN whose d-dimensional logical space corresponds to that of Vivaldi. Our simulation results suggest that PIS/NC has the possibility of dramatically improving the lookup latency of DHTs. Whereas DHash++ is only able to reduce the median lookup latency by 15% of the original Chord, Canary reduces it by 70% of the original CAN.

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

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

U2 - 10.1109/P2P.2009.5284517

DO - 10.1109/P2P.2009.5284517

M3 - Conference contribution

AN - SCOPUS:73549122378

SN - 9781424450671

SP - 155

EP - 158

BT - IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing

ER -