一种适用于P2P-SIP框架的自适应搜索算法  

An Adaptive Searching Algorithm Based on P2P-SIP Framework

作　　者：耿福泉[1] 高士坤[1] 赵林亮[1] 王光兴[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2007年第6期797-800,共4页Journal of Northeastern University(Natural Science)

基　　金：国家高技术研究发展计划项目(2003AA712032)

摘　　要：针对P2P-SIP框架中资源搜索路径过长的问题,提出了一种基于统计分析的自适应搜索算法.P2P-SIP系统对时延是敏感的,网络变化概率增大或者网络节点数目增多会令时延大幅度延长,该算法根据对收发消息的统计分析,决定是否对资源的路径信息进行发送,从而减少资源的搜索时延,同时通过线性平滑使算法具有一定的容错性.它可以应用于现有的P2P搜索算法中,从而提高现有的P2P搜索算法的效率.理论分析和仿真结果表明,在P2P-SIP环境下该算法具有更好的性能.Proposes an adaptive searching algorithm based on statistical analysis to solve the problem that the resource searching path is too long in P2P-SIP framework. The P2P-SIP system is sensitive to searching delay, and the increase in the probability of network change or the number of network nodes will lengthen greatly its searching delay. According to the statistic analysis of messages sent and received, the algorithm determines whether to send packages along the resource path to reduce searching delay and provide the algorithm with fault-tolerance via linear smoothing. It can be applied to present P2P searching algorithm to improve its searching efficiency. Theoretical analysis and simulation results show that the algorithm works better with P2P-SIP.

关 键 词：P2P 搜索 统计分析 SIP 自适应 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]