摘要
对等系统是由一些地位相等的节点组成的。如何在对等系统中快速准确以查找到目标资源已经成为当前研究的热点。由于非结构化的对等系统的资源搜索面临搜索的准确性和可扩展性等问题,大量的研究集中在如何构造一个结构化的对等系统。该文对结构化对等系统中典型资源搜索算法进行了分析和比较,并指出了这些算法的一些不足。
Peer-to-peer system is comprised of nodes which have same status. How to locate the target resources quickly and accurately in has become a hotspot of current research. As unstructured peer-to-peer system faced the accuracy of search and scalability and other issues, a large number of studies focus on how to construct a structured peer-to-peer system. In this paper, the typical resource-search algorithms for structured peer-to-peer systems are analyzed and compared, and some shortcomings of these algorithms are pointed out.
作者
曹海峰
吴捷
CAO Hai-feng, WU Jie (Jiangnan Institute of Computing Technology, Wuxi 214083, China)
出处
《电脑知识与技术》
2009年第8期6108-6110,共3页
Computer Knowledge and Technology