基于Content-Addressable Network的对等网络研究

Research on content-addressable network for peer-to-peer network

CAN(Content-Addressable Network)是基于分布式哈希表(Distributed Hash Table,DHT)的结构化对等网络.CAN系统通过分布式哈希表(DHT)在d维虚拟空间中搜索、共享资源,具有良好的可扩展性,容错性和完全自适应性.本文从网络架构,系统性能等方面综合介绍了CAN系统并对2种基于子空间策略CAN资源搜索算法进行了介绍和分析.

CAN(Content-Addressable Network) which is a structured Peer-to-Peer Network based on Distributed Hash Table(DHT).Peers in CAN lookup resource in a virtual d-dimensional Cartesian coordinate space by DHT,so CAN is scalable,fault-tolerant and completely self-organizing.In this paper,we introduce the network structure,lookup efficiency of CAN and the optimal routing algorithm based on CAN.