首页> 外文会议>International Workshop on Education Technology and Computer Science;ETCS 2009 >IBFS: A Search Algorithm Based on Index Scheme in Unstructured P2P Network
【24h】

IBFS: A Search Algorithm Based on Index Scheme in Unstructured P2P Network

机译:IBFS:一种基于索引方案的非结构化P2P网络搜索算法

获取原文

摘要

In unstructured P2P file sharing systems, the ununiform distribution of file popularity causes damage to the usability of the system. The search for rare files has more chance to fail. Flooding algorithm with indices which are exchanged randomly based on gossip protocol provides a success guarantee in a probability sense. However, the problem of low success rate and large numbers of messages still exist for queries of rare files. In this paper, we propose an index scheme and IBFS, a search algorithm based on nodepsilas information capacity. In contrast to the former, our method reduces 50%bandwidth consumption on average and performs efficient object discovery, making the system more stable and available.
机译:在非结构化的P2P文件共享系统中,文件受欢迎程度的不均匀分布会导致系统可用性受到损害。搜索稀有文件更有可能失败。基于八卦协议随机交换索引的泛洪算法在概率意义上提供了成功的保证。但是,对于稀有文件的查询仍然存在成功率低和消息量大的问题。在本文中,我们提出了一种索引方案和IBFS,这是一种基于节点规范信息容量的搜索算法。与前者相比,我们的方法平均减少了50%的带宽消耗,并执行了有效的对象发现,使系统更加稳定和可用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号