• DocumentCode
    479588
  • Title

    Ant colony optimization algorithm based P2P system replica optimal location strategy

  • Author

    Wang, Yu ; Zhao, Yuelong ; Hou, Fang

  • Author_Institution
    Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou
  • Volume
    1
  • fYear
    2008
  • fDate
    12-15 Oct. 2008
  • Firstpage
    494
  • Lastpage
    497
  • Abstract
    This paper presents a new replica optimal location strategy based on ant colony optimization algorithm. Through the improvement of ant algorithm, it can effectively choose the optimal replica node from a great number of nodes in peer-to-peer (P2P) system, which will help to realize the global optimization. The strategy fully considers that P2P nodes are heterogeneous, so the replica of a high degree of popularity will be placed in the high-performance nodes. It increases the high availability of the popular files. At the same time, owing to the increase of the high popular replica, it reduces the number of inquiring nodes when searching a file and decreasing the network traffic. This strategy also takes full consideration of the deferent factors that affect replica location, like path load, delay and so on. The simulation by using P2P tool PeerSim show that this strategy can effectively reduce request response time. Therefore, it improves performance of overall system.
  • Keywords
    optimisation; peer-to-peer computing; PeerSim; ant colony optimization algorithm; global optimization; network traffic; peer-to-peer system; replica optimal location strategy; Ant colony optimization; Computer science; Costs; Counting circuits; Delay; Feedback; Heuristic algorithms; Large-scale systems; Paper technology; Peer to peer computing; ant colony algorithm; peer-to-peer; placed strategy; replica;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-2012-4
  • Electronic_ISBN
    978-1-4244-2013-1
  • Type

    conf

  • DOI
    10.1109/SOLI.2008.4686445
  • Filename
    4686445