中文摘要：

内容寻址网络（Content Addressable Network，CAN）是P2P的一种，它利用分布式散列（hash）表（DHT）实现了文件信息和存放位置的有效映射，具有完全自组织和分布式的结构，并且有良好的可扩展性和容错性。但对CAN在负载均衡方面存在的问题并未提出有效的解决方法。该文首先介绍了内容寻址网络的基本工作原理，然后提出了几种有效的负载均衡优化方法：空间均衡划分、文件密度划分。最后通过仿真验证了这些方法的有效性。

英文摘要：

The Content Addressable Network （CAN） is a sort of P2P overlay network. CAN realizes the efficient mapping of the file information and its storage location by using Distributed Hash Table（DHT）. CAN is scalable, fault-tolerant and completely self-organizing. In this paper an introduction to the basic architecture and the principle of CAN is given first. And then some methods of CAN＇s load balancing are proposed： such as largest area based uniform partitioning, uniform distributing of the keys. Finally, these methods are proved that they are effective by simulation.