Journal of Systems Engineering and Electronics ›› 2006, Vol. 17 ›› Issue (3): 648-653.doi: 10.1016/S1004-4132(06)60111-4

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Random walk search in unstructured P2P

Jza Zhaoqing 1§2, Ybw Jinyuan *, ifao Ruonan1 & Li Minglu 1
  

  1. 1. Dept. of Computer Science and Engineering, Shanghai Jiaotong Univ. , Shanghai 200030, P. R. China;
    2. Dept of Foundation Science, the First Aeronautical Inst. of the Air Force, Xinyang 464000, P. R China
  • Online:2006-09-25 Published:2006-09-25

Abstract:

Unstructured P2P has power-law link distribution, and the random walk in power-law networks is analyzed. The analysis results show that the probability that a random walker walks through the high degree nodes is high in the power-law network, and the information on the high degree nodes can be easily found through random walk. Random walk spread and random walk search method (RWSS) is proposed based on the analysis result. Simulation results show that RWSS achieves high success rates at low cost and is robust to high degree node failure.

Key words: