内容寻址网络中几种负载均衡优化方法.pdfVIP

28 8 Vol.28No.8 2006 8 Journal of Electronics Information Technology Aug.2006 ( 230027) (Content Addressable NetworkCAN)P2P (hash)(DHT) CAN P2P TP393 A 1009-5896(2006)08-1488-04 A Few Optimized Load Balancing Methods of Content Addressable Network Xiong Ji-ping Qi Qing-hu Hong Pei-lin Li Jin-sheng (Dept. of Electronic Engineering and Information Science, USTC, Hefei 230027, China) Abstract 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. Key words Peer-to-Peer, Content addressable network, Distributed hash table, Load balancing, File density distribution 1 P2P / ( CAN C/S ) CAN