Sharable file searching in unstructured Peer-to-peer systems
Sharable file searching in unstructured Peer-to-peer systems
复制标题
DOI：
10.1007/s11227-009-0282-9
复制
发表时间：
2010-02
期刊：
影响因子：
--
通讯作者：
W. Qu;Wanlei Zhou;M. Kitsuregawa
中科院分区：
文献类型：
--
作者：
W. Qu;Wanlei Zhou;M. Kitsuregawa
现有的可共享文件搜索方法至少具有以下缺点之一：（1）它们仅适用于某些拓扑模式，（2）遭受单点故障，或（3）产生高昂的维护成本。尽管在传统的点对点系统中共享文件搜索取得了相当大的成功，但这些缺点阻碍了它们在非结构化点对点（P2P）系统（由于节点频繁进入和离开系统而导致系统拓扑不时变化）中的有效应用。受此启发，我们开发了几种完全动态的算法，用于在非结构化对等系统中搜索共享文件。我们的解决方案可以处理任何拓扑模式，搜索时间和计算开销都很小。我们还提供了深入的分析，为替代有效搜索策略的特征提供了有价值的见解，并带来了精确保证。大量的实验验证了我们的理论发现，并证明了我们的技术在实践中的效率。
The existing sharable file searching methods have at least one of the following disadvantages: (1) they are applicable only to certain topology patterns, (2) suffer single point failure, or (3) incur prohibitive maintenance cost. These drawbacks prevent their effective application in unstructured Peer-to-peer (P2P) systems (where the system topologies are changed time to time due to peers’ frequently entering and leaving the systems), despite the considerable success of sharing file search in conventional peer-to-peer systems. Motivated by this, we develop several fully dynamic algorithms for searching sharing files in unstructured peer to peer systems. Our solutions can handle any topology pattern with small search time and computational overhead. We also present an in-depth analysis that provides valuable insight into the characteristics of alternative effective search strategies and leads to precision guarantees. Extensive experiments validate our theoretical findings and demonstrate the efficiency of our techniques in practice.