| Random walk search in unstructured P2P |
| |
| 作者姓名： | Jia Zhaoqing ~ You Jinyuan ~ Rao Ruonan~ & Li Minglu ~ . Dept. of Computer Science and Engineering Shanghai Jiaotong Univ. Shanghai P. R. China . Dept. of Foundation Science the First Aeronautical Inst. of the Air Force Xinyang P. R. China |
| |
| 作者单位： | Jia Zhaoqing ~ 1，2，You Jinyuan ~1，Rao Ruonan~ 1 & Li Minglu ~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 |
| |
| 摘 要： | 1 .INTRODUCTIONIn the last few years , unstructured P2P applicationsare very popular ,such as Gnutella1], Kazaa2]. Theyare designed for sharing files among the peers in thenetworks .Thereis no precise control over the networktopology or file placement in these systems .In gener-al ,they employ flooding scheme for searching object ,and waste a lot of bandwidth1]. Today , bandwidthconsumption attributed to these applications amountsto a considerable fraction (upto 60 %) of the total In…
|
| 收稿时间： | 11 March 2005. |
Random walk search in unstructured P2P |
| |
| Jia Zhaoqing ,,You Jinyuan ,Rao Ruonan & Li Minglu . Dept. of Computer Science and Engineering,Shanghai Jiaotong Univ.,Shanghai ,P. R. China, . Dept. of Foundation Science,the First Aeronautical Inst. of the Air Force,Xinyang ,P. R. China.Random walk search in unstructured P2P[J].Journal of Systems Engineering and Electronics,2006,17(3):648-653. |
| |
| Authors: | Jia Zhaoqing You Jinyuan Rao Ruonan Li Minglu |
| |
| Institution: | 1. Dept. of Computer Science and Engineering, Shanghai Jiaotong Univ., Shanghai 200030, P. R. China;Dept. of Foundation Science, the First Aeronautical Inst. of the Air Force, Xinyang 464000, P. R. China
2. Dept. of Computer Science and Engineering, Shanghai Jiaotong Univ., Shanghai 200030, P. R. China |
| |
| 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. |
| |
| Keywords: | unstructured P2P search random walk search random walk spread power-law network |
| 本文献已被 CNKI 万方数据 ScienceDirect 等数据库收录！ |
