TY - JOUR
T1 - An effective simulation method for search strategy in unstructured P2P network
AU - Liu, Yuhua
AU - Xiong, Naixue
AU - Zhu, Longquan
AU - Park, Jong Hyuk
AU - Gao, Jingju
PY - 2010/4
Y1 - 2010/4
N2 - 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.
AB - 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.
KW - Redundant data packet
KW - Segment search algorithm
KW - Simulation
KW - Unstructured P2P network
UR - https://www.scopus.com/pages/publications/76949105777
U2 - 10.1016/j.simpat.2009.09.001
DO - 10.1016/j.simpat.2009.09.001
M3 - Article
AN - SCOPUS:76949105777
SN - 1569-190X
VL - 18
SP - 456
EP - 469
JO - Simulation Modelling Practice and Theory
JF - Simulation Modelling Practice and Theory
IS - 4
ER -