摘要：针对非结构化系统搜索效率过低的问题，提出一种基于聚类分布的DHT算法，基本做法是将一个环状覆盖网络划分为两层，下层负责数据管理，上层负责节点路由，每层在局部节点上以聚类方式组织信息。该算法初步解决了已有非结构化算法的数据组织无序性和搜索盲目性。为了进一步减小搜索路径长度，改进算法利用small-world的研究成果，在HUB层中加入指向远距离节点的远程连接，使得严格聚类转为带有随机性的概率化聚类，从而将搜索路径长度控制在 数量级。
关键词：Peer-to-Peer；搜索；聚类分布；small-world；DHT
Abstract To address the inefficiency of existing unstructured algorithms, the paper presents a DHT algorithm based on clustering distribution of indices. The algorithm divides a ring-like key space into two layers. The lower layer is responsible for indices management, and upper layer is responsible for routing nodes. On both layers, indices are clustered within each peer. The algorithm solves the problems of present unstructured algorithms in a certain degree, in which the datum is organized in a confused situation and routing is proceed in a disordered manner. Further, enhanced algorithm uses outcome of small-world to cut down latency of routing hops. With enhanced algorithm, a few connections to remote peers are introduced into routing table with a suitable probability. In another word, the criterion of clustering is not of determination, but of probability. Thus, it is possible to route overlay with average latency of hops.
Keywords Peer-to-Peer, route, clustering distribution, small-world, DHT
