Paper Info
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.
Year
DOI
Venue
2009
10.1109/P2P.2009.5284517
Peer-to-Peer Computing
Keywords
Field
DocType
distributed processing,table lookup,topology,Canary,Chord,NC-based method,NC-based strategies,PIS/NC-based CAN,accurate estimation,d-dimensional logical space,distributed hash tables,efficient estimation,median lookup latency,network coordinates,network latency,physical network,proximity identifier selection,topology-aware DHT
Network coordinates,Embedding,Identifier,Latency (engineering),Computer science,Computer network,Network topology,Theoretical computer science,Chord (music),Hash table,The Internet,Distributed computing
Conference
ISSN
ISBN
Citations 
2161-3567
978-1-4244-5067-1
2
PageRank 
References 
Authors
0.39
11
4
Name
Order
Citations
PageRank
Toshinori Kojima1203.83
Masato Asahara252.46
kenji kono31488.43
Hayakawa, A.420.39