An effective simulation method for search strategy in unstructured P2P network |
| |
Authors: | Yuhua Liu Naixue Xiong Longquan Zhu Jong Hyuk Park Jingju Gao |
| |
Affiliation: | 1. Department of Computer Science and Engineering, JIS University, Kolkata, India;2. Department of Informatics, University of Leicester, Leicester LE1 7RH, UK;3. Department of Electronics and Instrumentation Engineering, St. Joseph''s College of Engineering, Chennai- 600 119 Tamilnadu, India;4. Department of Computer Science and Engineering, St. Joseph''s College of Engineering, Chennai- 600 119 Tamilnadu, India;1. Department of Computer Science and Engineering, Jaypee University of Information Technology, Waknaghat, Solan, HP, 173 234, India;2. School of Engineering and Sciences, Tecnologico de Monterrey, Av. E. Garza Sada 2501, Monterrey, N.L, 64,489, Mexico |
| |
Abstract: | Modeling and Simulation Techniques focus on simulation modeling and analysis challenges to develop principles or gain in existing networking technologies, including simulation methodology or application in unstructured P2P network. In this paper, we focus on the simulation in the random unstructured P2P network.The correlation between topology and search algorithm is less paid attention to in unstructured P2P network, current techniques used in existing unstructured P2P system are often very inefficient because of the existence of large number of redundant messages. In this paper, we analyze the reason of engendering redundant data packet and focus on designing better search algorithm to adapt to the current network rather than to design the universal algorithm to adapt to a variety of network. Analyzing the characteristics that the flooding algorithm showing in different search stages in different network, we put forward the segment search algorithm. Furthermore, we present an effective simulation method in the random unstructured P2P network. Through simulation analysis, we find that our algorithm is better than the original flooding algorithm. In addition, we design our algorithm to be simple as a module, which can be easily applied to existing unstructured P2P systems for immediate impact. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|