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 Dec 1
EventIEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing - Seattle, WA, United States
Duration: 2009 Sep 92009 Sep 11

Publication series

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

Other

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

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Embedding network coordinates into the heart of distributed hash tables'. Together they form a unique fingerprint.

  • 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] (IEEE P2P'09 - 9th International Conference on Peer-to-Peer Computing). https://doi.org/10.1109/P2P.2009.5284517