Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (16): 102-104.DOI: 10.3778/j.issn.1002-8331.2010.16.029

• 网络、通信、安全 • Previous Articles     Next Articles

P2P routing algorithm using clustering and cache

LI Zhao-kui,WANG Yan,SHI Xiang-bin   

  1. Shenyang Institute of Aeronautical Engineering,Shenyang 110136,China
  • Received:2009-03-02 Revised:2009-04-20 Online:2010-06-01 Published:2010-06-01
  • Contact: LI Zhao-kui

利用分群与缓存的P2P路由

李照奎,王 岩,石祥滨   

  1. 沈阳航空工业学院 计算机学院,沈阳 110136
  • 通讯作者: 李照奎

Abstract:

To the question of low resource searching efficiency for dynamic in structured P2P system,an advanced routing algorithm using clustering and cache is presented.The algorithm mainly considers the clustering of position information and the strategy of adaptive content caching and route caching is adopted.The simulation experiments show that the algorithm improves routing performance and gains high route success rate and adapts dynamic P2P network.

摘要: 针对结构化P2P系统中由于动态性带来的路由性能低的问题,提出一种利用分群和缓存的路由改进算法,该算法重点考虑了位置信息的分群,同时采用了自适应内容缓存机制和自适应路径缓存机制。最后的实验表明,改进后的路由算法路由性能明显改善,查找成功率高,较好地适应了P2P网络的动态性。

CLC Number: