基于DHT的几种P2P算法研究
Research of P2P Algorithms Based on DHT
P2P网络相对于CS模式网络具有去中心化，可扩展性，健壮性，高性能，负载均衡等优点。本文介绍了4种基于DHT的P2P算法：Chord, Can, Pastry, Tapestry。详细分析了各算法的组织结构，查找方法，结点插入退出，路由方法及性能，并对它们的算法效率进行了比较研究。
P2P network has the advantages of entire distribution, high scalability, robust, high performance and load balance. In this paper, we describe four P2P algorithms based on DHT (Distributed Hash Table): Chord, Can, Pastry, and Tapestry. We analyze the overlay construction, routing method, node joining/departure, net maintenance, and performance of each kind of the networks. And we also research on the efficiency of these algorithms.
周巍
通信
P2P DHT 路由
P2P DHT Routing
周巍.基于DHT的几种P2P算法研究[EB/OL].(2008-03-04)[2025-07-09].http://www.paper.edu.cn/releasepaper/content/200803-62.点此复制
评论