An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems


The KIPS Transactions:PartA, Vol. 13, No. 1, pp. 11-18, Feb. 2006
10.3745/KIPSTA.2006.13.1.11,   PDF Download:

Abstract

In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the node with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS'' server selection method.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. Y. Song, S. Y. Han, S. Y. Park, "An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems," The KIPS Transactions:PartA, vol. 13, no. 1, pp. 11-18, 2006. DOI: 10.3745/KIPSTA.2006.13.1.11.

[ACM Style]
Ji Young Song, Sae Young Han, and Sung Yong Park. 2006. An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems. The KIPS Transactions:PartA, 13, 1, (2006), 11-18. DOI: 10.3745/KIPSTA.2006.13.1.11.