Server Allocation Approach for P2P Networks and its Heuristic Algorithm
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    An optimal allocation approach of servers for improving the performance of P2P networks is proposed in this paper. The approach is to allocate a limited number of servers over the P2P networks to satisfy as many peers as possible, by using a constrained optimization algorithm. In considering that the polar space is more suitable to express length-related constraints, such as those in this approach, a heuristic algorithm based on the polar coordinator mapping is proposed to deal with the optimization problem of the server allocation. Compared with the existing heuristic algorithms that are based on penalty functions, this algorithm can effectively reduce the search space, and the performance is better especially in a high dimensional search space. The experiment results show that our server allocation approach can satisfy more peers' requirement and effectively improve the performance of P2P networks.

    Reference
    Related
    Cited by
Get Citation

曾明霏,余顺争. P2P网络服务器部署方案及其启发式优化算法.软件学报,2013,24(9):2226-2237

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 27,2012
  • Revised:October 19,2012
  • Adopted:
  • Online: September 07,2013
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063