首页> 外文会议>International Conference on Information and Communications Security >A Trust-Based Robust and Efficient Searching Scheme for Peer-to-Peer Networks
【24h】

A Trust-Based Robust and Efficient Searching Scheme for Peer-to-Peer Networks

机译:用于对等网络的基于信任的鲁棒和高效的搜索方案

获取原文
获取外文期刊封面目录资料

摘要

Studies on the large scale peer-to-peer (P2P) network like Gnutella have shown the presence of large number of free riders. Moreover, the open and decentralized nature of P2P network is exploited by malicious users who distribute unauthentic or harmful contents. Despite the existence of a number of trust management schemes for combating against free riding and distribution of malicious files, these mechanisms are not scalable due to their high computational, communication and storage overhead. Moreover they do not consider the quality-of-service (QoS) of the search. This paper presents a trust management scheme for P2P networks that utilizes topology adaptation to minimize distribution of spurious files. It also reduces search time since most of the queries are resolved within the community of trustworthy peers. Simulation results demonstrate that the proposed scheme provides efficient searching to good peers while penalizing the malicious peers by increasing their search times as the network topology stabilizes. The mechanism is also found to be robust even in presence of a large percentage of malicious peers.
机译:关于GNUTELLA等大规模同伴(P2P)网络的研究表明存在大量的自由骑手。此外,P2P网络的开放和分散性质被分配未经认真或有害内容的恶意用户利用。尽管存在许多信任管理计划,用于打击可恶意文件的搭配和分发,但由于其高计算,通信和存储开销,这些机制不可扩展。此外,它们不考虑搜索的服务质量(QoS)。本文为P2P网络提供了一种信任管理方案,它利用拓扑适应来最大限度地减少虚假文件的分布。它还减少了搜索时间,因为大多数查询都在值得信赖的同行社区中得到解决。仿真结果表明,所提出的方案在惩罚其作为网络拓扑结构稳定时,通过增加他们的搜索时间来惩罚恶意同行的良好同行的效率。即使存在大量的恶意同伴,也发现该机制也是坚固的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号