具有逻辑路由跳数O(1)的可扩展的分散式查找算法

对等网络中的一个基本问题就是如何高效地进行数据查找．分散式查找是解决这类问题的一种新思路．现有的分散式查找方法在查找时所需的逻辑路由跳数都与网络中的节点数相关(一般为O(logn)，少数为O(n^1/c)．Sifter是一种可扩展、自组织、高容错和高效率的分散式查找算法．在该算法中，单个节点只需维护O(n1／c)个其他节点的链接信息，就能够在O(1)个逻辑路由跳内找到目的数据．该算法适用于网络动态性不大，但是对查找的实时性要求较高的应用．

A Decentralized Location Algorithm with Logic Routing Hops O(1)

A fundamental problem in peer-to-peer networks is how to efficiently locate data. Decentralized data location is a novel approach to resolving this problem. However, the logic routing hops of all known decentralized data location algorithms are related to the number of nodes in networks, generally O(logn) or O(n 1/c). Sifter is a scalable, fault-tolerant, self-organizing, efficient, and decentralized data location algorithm, in which each node maintains the linkage messages of other nodes of O(n 1/c) in networks so that it can locate any data identifiers within O(1) logic routing hops. This algorithm is particularly suitable for the network systems in which real-time of location is very important but dynamic property is negligible.