内容寻址网络中几种负载均衡优化方法
A Few Optimized Load Balancing Methods of Content Addressable Network
-
摘要: 内容寻址网络(Content Addressable Network,CAN)是P2P的一种,它利用分布式散列(hash)表(DHT)实现了文件信息和存放位置的有效映射,具有完全自组织和分布式的结构,并且有良好的可扩展性和容错性。但对CAN在负载均衡方面存在的问题并未提出有效的解决方法。该文首先介绍了内容寻址网络的基本工作原理,然后提出了几种有效的负载均衡优化方法:空间均衡划分、文件密度划分。最后通过仿真验证了这些方法的有效性。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 CANs 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.
-
Rathasamy S, Francis P, Handley M, et al.. A scalable content-addressable network[J].In ACM SIGCOMM01, San Diego, CA.2001, 31(4):161-[2]Rathasamy S. A scalable content-addressable network. A dissertation submitted in partial satisfaction of the requirements. for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California at Berkeley, Fall 2002.[3]Rathasamy S, Francis P, Handley M, et al.. A scalable content-addressable network. In ICSI Technical Report, Jan 2001.Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference onDistributed System Platforms, 2001: 329.350.[4]Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications[J].In ACM SIGCOMM01, San Diego, CA.2001, 31(4):149-[5]Tang Chunqiang.[J].Xu Zhichen, Dwarkadas S. Peer-to-Peer information retrieval using self-organizing semantic overlay networks. In ACM SIGCOMM03, Karlsruhe, Germany.2003,:-
计量
- 文章访问数: 2458
- HTML全文浏览量: 77
- PDF下载量: 1072
- 被引次数: 0