计算机工程 ›› 2011, Vol. 37 ›› Issue (8): 70-73.doi: 10.3969/j.issn.1000-3428.2011.08.024

• 网络与通信 • 上一篇    下一篇

一种基于节点交换的DHT优化方法

杨继萍 1,王 颢 2,高雪松 3   

  1. (1. 北京联合大学信息学院软件工程系,北京 100101;2. 北京邮电大学网络技术研究院,北京 100876;3. 华为技术有限公司,北京 100085)
  • 出版日期:2011-04-20 发布日期:2012-10-31
  • 作者简介:杨继萍(1969-),女,讲师,主研方向:网络路由技术,软件工程;王 颢,硕士;高雪松,博士

DHT Optimization Method Based on Node Exchange

YANG Ji-ping 1, WANG Hao 2, GAO Xue-song 3   

  1. (1. Department of Software Engineering, College of Information, Beijing Union University, Beijing 100101, China; 2. Institute of Networking Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 3. Huawei Technologies Co., Ltd., Beijing 100085, China)
  • Online:2011-04-20 Published:2012-10-31

摘要: 分布式哈希表(DHT)存在逻辑拓扑与实际网络拓扑不匹配的问题,造成查询操作时延过大。针对该问题,提出一种基于节点交换的DHT优化方法,通过对DHT节点逻辑位置的调整,改善DHT的查找性能。使用地标聚类方法对节点进行分类,物理位置相近的节点属于同一个地标聚类区,采用地理布局的思想,使DHT覆盖网络逻辑拓扑与底层物理拓扑尽量匹配,从而达到缩短DHT查询操作的时延、提高DHT路由性能的目的。

关键词: 分布式哈希表, 节点标号, 地标聚类, 地理布局

Abstract: Due to the problem of Distributed Hash Table(DHT), which is that the logical topology does not match the actual network topology, it results in the problem of excessive delay of lookup operation. Aiming at this problem, this paper proposes a DHT optimization method based on node exchange to solve this problem by adjusting the logical location of DHT node, and ultimately to improve the search performance of DHT. The nodes are classified by using the landmark method, the nodes whose physical location close to each other belongs to the same landmark district. It uses the idea of geographic layout, makes the DHT overlay network logical topology match the underlying physical topology as much as possible, and thus reduces the DHT query delay, which improves the performance of DHT routing.

Key words: Distributed Hash Table(DHT), node label, landmark, geographic layout

中图分类号: