Abstract: 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.