首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems
【24h】

An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

机译:P2P文件共享系统中的高效,自适应分散文件复制算法

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

摘要

In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two end points on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication in server side enhances replica hit rate, hence, lookup efficiency but produces overloaded nodes and cannot significantly reduce query path length. File replication in client side could greatly reduce query path length, but cannot guarantee high replica hit rate to fully utilize replicas. Though replication along query path solves these problems, it comes at a high cost of overhead due to more replicas and produces underutilized replicas. This paper presents an Efficient and Adaptive Decentralized (EAD) file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to nonuniform and time-varying file popularity and node interest. Unlike current methods, EAD creates and deletes replicas in a decentralized self-adaptive manner while guarantees high replica utilization. Theoretical analysis shows the high performance of EAD. Simulation results demonstrate the efficiency and effectiveness of EAD in comparison with other approaches in both static and dynamic environments. It dramatically reduces the overhead of file replication, and yields significant improvements on the efficiency and effectiveness of file replication in terms of query efficiency, replica hit rate, and overloaded nodes reduction.
机译:在对等文件共享系统中,文件复制技术被广泛用于减少热点并提高文件查询效率。当前最新的文件复制方法在客户端-服务器查询路径上的所有节点或两个端点中复制文件。然而,这些方法要么效率低下,要么以高昂的开销为代价。服务器端的文件复制可提高副本命中率,从而提高查找效率,但会产生过载的节点,并且无法显着减少查询路径的长度。客户端中的文件复制可以大大减少查询路径的长度,但是不能保证较高的副本命中率来充分利用副本。尽管沿查询路径进行的复制解决了这些问题,但是由于存在更多的副本并产生使用不足的副本,因此付出了高昂的开销。本文提出了一种高效且自适应的分散式(EAD)文件复制算法,该算法以极低的成本实现了高查询效率和高副本利用率。 EAD通过选择查询流量中心和频繁请求者作为副本节点,并动态适应非均匀且随时间变化的文件受欢迎程度和节点兴趣,来提高文件副本的利用率。与当前方法不同,EAD以分散的自适应方式创建和删除副本,同时确保高副本利用率。理论分析表明,EAD具有很高的性能。仿真结果证明了在静态和动态环境下,EAD与其他方法相比的效率和有效性。它极大地减少了文件复制的开销,并在查询效率,副本命中率和过载节点减少方面显着提高了文件复制的效率和有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号