一种HDHT的层次式网络资源定位模型研究  

HDHT:A Hierarchical Resources Locating Model Based on the Improvement of DHT

作　　者：徐坚[1] 

机构地区：[1]曲靖师范学院计算机科学与工程学院,云南曲靖655011

出　　处：《曲靖师范学院学报》2009年第6期52-54,共3页Journal of Qujing Normal University

摘　　要：提出了基于层次式的DHT来解决P2P的逻辑上相邻的节点物理距离可能很远的问题,以层次式的思想,把节点按物理距离划分成环,形成层次式的环.并提出了HDHT的路由算法,待查询的消息从最底层环开始查询,如果查询不成功,查询过程继续往上层推进,消息到达目标节点后,路由过程完成.该算法能保证逻辑上相邻的节点物理距离也相邻.The paper proposes a hierarchical DHT mode to solve the problems that logical neighbor nodes are far away from each other. In our mode, physically adjacent nodes are divided into rings, forming a hierarchical architecture. The paper also proposes a algorithm of HDHT. In the algorithm, a query will start from the bottom ring to next ring in turn until hit the first target node. In the mode, the nodes which are logically adjacent also have close physical distance.

关 键 词：资源定位 层次式 DHT 

分 类 号：TP302.2[自动化与计算机技术—计算机系统结构]