首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Social-P2P: An Online Social Network Based P2P File Sharing System
【24h】

Social-P2P: An Online Social Network Based P2P File Sharing System

机译:Social-P2P:基于在线社交网络的P2P文件共享系统

获取原文
获取原文并翻译 | 示例

摘要

A peer-to-peer (P2P) file sharing system provides a platform that enables a tremendous number of nodes to share their files. Retrieving desired files efficiently and trustworthily is critical in such a large and jumbled system. However, the issues of efficient searching and trustworthy searching have only been studied separately. Simply combining the methods to achieve the two goals doubles system overhead. In this paper, we first study trace data from Facebook and BitTorrent. Guided by the observations, we propose a system that integrates a social network into a P2P network, named Social-P2P, for simultaneous efficient and trustworthy file sharing. It incorporates three mechanisms: (1) interest/trust-based structure, (2) interest/trust-based file searching, and (3) trust relationship adjustment. By exploiting the social interests and relationships in the social network, the interest/trust-based structure groups common-multi-interest nodes into a cluster and further connects socially close nodes within a cluster. The comparably stable nodes in each cluster form a Distributed Hash Table (DHT) for inter-cluster file searching. In the interest/trust-based file searching mechanism, a file query is forwarded to the cluster of the file by the DHT routing first. Then, it is forwarded along constructed connections within a cluster, which achieves high hit rate and reliable routing. Moreover, sharing files among socially close friends discourages nodes from providing faulty files because people are unlikely to risk their reputation in the real-world. In the trust relationship adjustment mechanism, each node in a routing path adaptively decreases its trust on the node that has forwarded a faulty file in order to avoid routing queries towards misbehaving nodes later on. We conducted extensive trace-driven simulations and implemented a prototype on PlanetLab. Experimental results show that Social-P2P achieves highly efficient and trustworthy file sharing compared to current fi- e sharing systems and trust management systems.
机译:对等(P2P)文件共享系统提供了一个平台,该平台使大量节点可以共享其文件。在如此庞大而混乱的系统中,有效且可靠地检索所需文件至关重要。但是,有效搜索和可信赖搜索的问题只是分开研究的。简单地组合实现两个目标的方法会使系统开销增加一倍。在本文中,我们首先研究了来自Facebook和BitTorrent的跟踪数据。在观察的指导下,我们提出了一种系统,该系统将社交网络集成到名为Social-P2P的P2P网络中,以实现同时高效和可信任的文件共享。它包含三种机制:(1)基于兴趣/信任的结构,(2)基于兴趣/信任的文件搜索,以及(3)信任关系调整。通过利用社交网络中的社交兴趣和关系,基于兴趣/信任的结构将公共-多兴趣节点分组为一个群集,并进一步将群集内社交紧密的节点连接起来。每个群集中相对稳定的节点形成一个分布式哈希表(DHT),用于群集间文件搜索。在基于兴趣/信任的文件搜索机制中,首先通过DHT路由将文件查询转发到文件的群集。然后,将其沿群集内的已构建连接转发,从而实现高命中率和可靠的路由。此外,在社交关系密切的朋友之间共享文件会阻止节点提供错误的文件,因为人们不太可能冒着在现实世界中的声誉冒险的风险。在信任关系调整机制中,路由路径中的每个节点都自适应地降低了对转发了故障文件的节点的信任,以避免以后向行为异常的节点路由查询。我们进行了广泛的跟踪驱动模拟,并在PlanetLab上实现了原型。实验结果表明,与当前的财务共享系统和信任管理系统相比,Social-P2P实现了高效且可信赖的文件共享。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号