抄録
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.
