Advanced Search
Volume 28 Issue 8
Sep.  2010
Turn off MathJax
Article Contents
Xiong Ji-ping, Qi Qing-hu, Hong Pei-lin, Li Jin-sheng. A Few Optimized Load Balancing Methods of Content Addressable Network[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1488-1491.
Citation: Xiong Ji-ping, Qi Qing-hu, Hong Pei-lin, Li Jin-sheng. A Few Optimized Load Balancing Methods of Content Addressable Network[J]. Journal of Electronics & Information Technology, 2006, 28(8): 1488-1491.

A Few Optimized Load Balancing Methods of Content Addressable Network

  • Received Date: 2004-12-20
  • Rev Recd Date: 2005-04-18
  • Publish Date: 2006-08-19
  • 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.
  • loading
  • 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,:-
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2450) PDF downloads(1071) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return