Abstract: A new fast distributed p-cycle pre-configuration searching algorithm is proposed in this paper. It can speed up the searching process convergence from two aspects. (1) The multi-p-cycle found by the algorithm within one searching wave should be completed configuration through multi searching waves in classical algorithm. This is the reason why this method faster than classical one. (2) Our algorithm has been changed over from the cycle-based searching to the path-based searching. Using this technique, searching information converged on one node in classical algorithm will be split to its multiple adjacent nodes so reduce the performance requirement of node equipment. The p-cycles searched by the distributed algorithm have been filtered within adjacent node hence the searching process be comes faster. The simulation result also shows that the penalty to spare capacity consumed is very small in our algorithm as well as the obvious benefit on the number of searching wave descent.