An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems
An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems
复制标题
基于DHT的点对点系统中的自适应邻近路由选择方案
DOI：
10.1007/978-3-540-30501-9_152
复制
发表时间：
2004
影响因子：
0.7
通讯作者：
Jihoon Yang
中科院分区：
文献类型：
--
作者：
Jiyoung Song;Sungyong Park;Jihoon Yang
本文提出了一种邻近路由选择方案，这是自适应的底层网络条件。所提出的方案重复估计和更新的总查找延迟的基础上的信息从邻居。更新后的信息用于动态地选择下一个对等体来路由查询，这导致减少了整体查找延迟。我们使用Chord，最流行的基于DHT的对等系统之一，实现了该方案，并与原来的Chord和CFS的服务器选择方案的性能进行了比较。所提出的方案显示性能优于其他方案。
This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup latency based on the information from the neighborhoods. The updated information is used to select the next peer dynamically to route the query, which results in reducing the overall lookup latency. We implemented the scheme using the Chord, one of the most popular DHT-based peer to peer systems, and compared the performance with those of original Chord and the CFS’ server selection scheme. The proposed scheme shows performance improvement over other schemes.