• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Understanding and Improving Piece-Related Algorithms in the BitTorrent Protocol
【24h】

Understanding and Improving Piece-Related Algorithms in the BitTorrent Protocol

机译：了解和改进BitTorrent协议中与片段相关的算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Piece-related algorithms, including piece revelation, selection, and queuing, play a crucial role in the BitTorrent (BT) protocol, because the BT system can be viewed as a market where peers trade their pieces with one another. During the piece exchanging, a peer selects some pieces revealed by neighbors, and queues them up for downloading. In this paper, we provide a deep understanding of these algorithms, and also propose some improvements to them. Previous study has shown that the piece revelation strategy is vulnerable to under-reporting. We provide a game-theoretic analysis for this selfish gaming, and propose a distributed credit method to prevent it. Existing piece selection strategies, though long believed to be good enough, may fail to balance piece supply and demand. We propose a unified strategy to shorten the download time of peers by applying utility theory. The design of the piece queuing algorithm has a conflict with that of piece selection strategy, because it is not possible to assume that the queued requests for a selected piece can always be available on multiple neighbors. We give a possible fix to address the conflict by allowing peers to dynamically manage their unfulfilled requests. To evaluate the performance of the proposed algorithms, we run several experiments in a live swarm. Our primary results show that they can achieve fast individual and system-wide download time.
机译：与件相关的算法，包括件展示，选择和排队，在BitTorrent（BT）协议中起着至关重要的作用，因为BT系统可以看作是同行之间相互交易件的市场。在片段交换期间，对等方选择邻居发现的一些片段，并将它们排队等待下载。在本文中，我们提供了对这些算法的深刻理解，并提出了对它们的一些改进。先前的研究表明，件展示策略容易受到漏报的影响。我们提供了针对这种自私游戏的博弈论分析，并提出了一种防止这种情况的分布式信用方法。尽管长期以来认为现有的样片选择策略足够好，但可能无法平衡样片的供需。我们提出一种统一的策略，通过应用效用理论来缩短对等节点的下载时间。片段排队算法的设计与片段选择策略的设计存在冲突，因为不可能假设对选定片段的排队请求始终可以在多个邻居上获得。通过允许对等方动态管理其未满足的请求，我们提供了一种可能的解决冲突的方法。为了评估所提出算法的性能，我们在现场进行了多个实验。我们的主要结果表明，它们可以实现快速的个人和系统范围的下载时间。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号