| 基于DHT的P2P网络资源定位算法比较 |
| |
| 引用本文： | 杨艳红. 基于DHT的P2P网络资源定位算法比较[J]. 信息安全与技术, 2014, 0(7): 36-37 |
| |
| 作者姓名： | 杨艳红 |
| |
| 作者单位： | 昆山登云科技职业学院,江苏昆山 |
| |
| 摘 要： | P2P是一种分布式计算模式,具有较高的可扩展性,可以充分利用网络端主机的计算存储能力,P2P系统是目前网络领域的一个研究热点。目前主要研究结构化的P2P系统,它在可扩展性和资源的定位速度方面均优于以往的P2P系统结构。本文对几种常见的基于DHT的P2P网络资源定位算法进行比较。
|
| 关 键 词： | P2P Chord Tapestry CAN Pastry |
Compare with Algorithms of P2P Resource Location based on DHT |
| |
| Yang Yan-hong. Compare with Algorithms of P2P Resource Location based on DHT[J]. Information Security and Technology, 2014, 0(7): 36-37 |
| |
| Authors: | Yang Yan-hong |
| |
| Affiliation: | Yang Yan-hong (Kunshan Dengyun Technology Professional College JiangsuKunshan 215300) |
| |
| Abstract: | P2P, which not only has advantage in scalability, but also can utilize the computing and storage capacity of the end systems, is a distributed computing mode. P2P system is a hot topic in network computing field. Recently researchers mainly study structured P2P system, which is bet er than the former P2P structure in system scalability and resource location. This thesis compare with several algorithms of P2P resource location based on DHT. |
| |
| Keywords: | p2p chord tapestry can pastry |
| 本文献已被 CNKI 维普 等数据库收录！ |
