TY - JOUR
T1 - Improving the Search Mechanism for Unstructured Peer-to-Peer Networks Using the Statistical Matrix Form
AU - Lin, Chia Hung
AU - Zseng, Jing Jia
AU - Hsieh, Sun Yuan
N1 - Publisher Copyright:
© 2015 IEEE.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2015
Y1 - 2015
N2 - In a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbors through an unstructured peer-to-peer (P2P) network until the time-to-live decreases to zero. A major disadvantage of flooding is that, in a large-scale network, this blind-choice strategy usually incurs an enormous traffic overhead. In this paper, we propose a method, called the statistical matrix form (SMF), which improves the flooding mechanism by selecting neighbors according to their capabilities. The SMF measures the following peer characteristics: 1) the number of shared files; 2) the content quality; 3) the query service; and 4) the transmission distance between neighbors. Based on these measurements, appropriate peers can be selected, thereby reducing the traffic overhead significantly. Our experimental results demonstrate that the SMF is effective and efficient. For example, compared with the flooding search mechanism in dynamic unstructured P2P networks, the SMF reduces the traffic overhead by more than 80%. Moreover, it achieves a good success rate and shorter response times.
AB - In a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbors through an unstructured peer-to-peer (P2P) network until the time-to-live decreases to zero. A major disadvantage of flooding is that, in a large-scale network, this blind-choice strategy usually incurs an enormous traffic overhead. In this paper, we propose a method, called the statistical matrix form (SMF), which improves the flooding mechanism by selecting neighbors according to their capabilities. The SMF measures the following peer characteristics: 1) the number of shared files; 2) the content quality; 3) the query service; and 4) the transmission distance between neighbors. Based on these measurements, appropriate peers can be selected, thereby reducing the traffic overhead significantly. Our experimental results demonstrate that the SMF is effective and efficient. For example, compared with the flooding search mechanism in dynamic unstructured P2P networks, the SMF reduces the traffic overhead by more than 80%. Moreover, it achieves a good success rate and shorter response times.
UR - http://www.scopus.com/inward/record.url?scp=84959853280&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959853280&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2015.2444872
DO - 10.1109/ACCESS.2015.2444872
M3 - Article
AN - SCOPUS:84959853280
VL - 3
SP - 926
EP - 941
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 7122855
ER -