Bootstrap Node-Centered Proximity Identifier Selection for Structured Overlays in Private Networks

Masashi YOSHIDA
Koichi YAGISHITA
Yusuke DOHI
Kumiko KOBAYASHI
Yutaka SAKAI
Shigeyuki ASAMI

Publication
IEICE TRANSACTIONS on Communications   Vol.E94-B    No.3    pp.813-817
Publication Date: 2011/03/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.813
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
Keyword: 
overlay network,  DHT,  latency stretch,  node proximity,  

Full Text: PDF(512.6KB)>>
Buy this Article


Summary: 
Distributed hash tables (DHTs) enable companies or campuses to use voice over IP (VoIP) systems in private networks at low cost. However, DHTs incur latency stretch caused by a topology mismatch between the application layer and the physical layer. Reducing this latency stretch is critical when implementing real-time applications that use DHTs, such as VoIP systems. This letter proposes a new method for reducing the latency stretch by creating node IDs, which form structured overlays that consider node proximity. Simulation results show that the proposed method is superior to Chord in terms of the distance between nodes, look-up path length, network burden, and look-up latency.