首页|HDNBS: An approach for search in decentralized and unstructured P2P
HDNBS: An approach for search in decentralized and unstructured P2P
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
Decentralized and unstructured peer-to-peer applications such as Gnutella are attractive because they require no centralized directories and no precise control over network topology or data placement. Search algorithm is the major component of the distributed system and its efficiency also does influence the systems performance. However the flooding-based query algorithm used in Gnutella produces huge traffic and does not scale well. Gnutella-like P2P topology has power-law characteristic, so a search algorithm was proposed based on high degree nodes of power-law network, High Degree Nodes-Based Search ( HDNBS). Extensive simulation results show that this algorithm performs on power-law networks very well, achieves almost 100% success rates, produces O(logN) messages per query and can locate target file within O(logN) hops.
NETL
NSTL
