首页> 外文会议>Cluster Computing and the Grid, 2009. CCGRID '09 >PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System
【24h】

PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System

机译:PAIS:一种基于兴趣的兴趣聚集的P2P文件共享系统

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

摘要

Efficient file query is important to the overall performance of peer-to-peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. On the other hand, clustering peers by their physical proximity can also improve file query performance. Few current works are able to cluster peers based on both peer interest and physical proximity. It is even harder to realize it in structured P2Ps due to their strictly defined topologies, although they provide higher file query efficiency than unstructured P2Ps. In this paper, we introduce a proximity-aware and interest-clustered P2P file sharing system (PAIS) based on a structured P2P. It groups peers based on both interest and proximity. PAIS supports sophisticated routing and clustering strategies based on a hierarchical topology. Theoretical analysis and simulation results demonstrate that PAIS dramatically reduces the overhead and enhances efficiency in file sharing.
机译:高效的文件查询对于点对点(P2P)文件共享系统的整体性能很重要。通过对等点的共同兴趣来聚类可以显着提高文件查询的效率。另一方面,通过对等体之间的物理邻近度来聚类也可以提高文件查询性能。当前很少有能够基于对等体兴趣和物理接近度将对等体聚类的工作。尽管结构化P2P提供了比非结构化P2P更高的文件查询效率,但是由于它们严格定义的拓扑结构,在结构化P2P中更难实现。在本文中,我们介绍了一种基于结构化P2P的邻近感知和兴趣集中的P2P文件共享系统(PAIS)。它基于兴趣和接近度将同级分组。 PAIS支持基于分层拓扑的复杂路由和群集策略。理论分析和仿真结果表明,PAIS大大减少了开销并提高了文件共享的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号