基于内容寻址网络的结构化P2P系统的研究

本文介绍了内容寻址网络(ContentAddressableNetwork:CAN)的概念。CAN利用分布式哈希表(DistributedHashTable:DHT)实现了文件信息和存放位置的有效映射,具有完全自组织和分布式的结构(不需要任何形式的中心控制、协调或配置),并且有良好的可扩展性(节点只维护少量的控制状态,与系统中的节点数无关)和容错性(节点失效后仍可通过别的路由路径寻路)。

There are two key pieces to a P2P system： the lookup mechanism used to locate the desired files and the actual files download. The decentralized storage in P2P systems makes the file transfer process scalable, but the trouble is how to find the peer which has the desired files. The concept of CAN（Content Addressable Network） is given in this paper. CAN maps ＂keys ＂ onto ＂values＂ through the DHT（Distributed Hash Table）. CAN is completely distributed（requiting no form of centralized control,coordination or configuration）, scalable（nodes maintain only a small amount of control state that is independent of the number of nodes in the system）, and fault-tolerant（nodes can route around failures）.