首页> 外文期刊>Peer-to-peer networking and applications >The performance and locality tradeoff in bittorrent-like file sharing systems - Springer
【24h】

The performance and locality tradeoff in bittorrent-like file sharing systems - Springer

机译:类似bittorrent的文件共享系统中的性能和位置权衡-Springer

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

摘要

In recent years, the surge of large-scale peer-to-peer (P2P) applications has brought huge amounts of P2P traffic, which has significantly changed the Internet traffic pattern and increased the traffic-relay cost at the Internet Service Providers (ISPs). To alleviate the stress on networks, methods of localized peer selection have been proposed that advocate neighbor selection within the same network (AS or ISP) to reduce the cross-ISP traffic. Nevertheless, localized peer selection may potentially lead to the downgrade of download speed at the peers, rendering a non-negligible tradeoff between the download performance and traffic localization in the P2P system. Aiming at effective peer selection strategies that achieve any desired Pareto optimum in face of the tradeoff, our contributions in this paper are three-fold: (1) We characterize the performance and locality tradeoff as a multi-objective (b)-matching optimization problem. In particular, we first present a generic weighted (b)-matching model that characterizes the tit-for-tat in BitTorrent-like peer selection. We then introduce multiple optimization objectives into the model, which effectively characterize the performance and locality tradeoff using simultaneous objectives to optimize. (2) We design fully distributed peer selection algorithms that can effectively approximate any desired Pareto optimum of the global multi-objective optimization problem, which represents a desired tradeoff point between performance and locality in the entire system. (3) Taking network dynamics into consideration, we further propose practical protocols that allow each peer to dynamically adjust its peer selection preference on download performance or traffic locality, in order to adapt to the current quality of peering connections, while guaranteeing that the desired tradeoff is still achieved over its entire download process. To support our models and protocols, we have conducted rigorous analysis, extensive simulations, and prototype experiments under various practical settings extracted from real-world traces.
机译:近年来,大规模对等(P2P)应用程序的涌现带来了大量P2P流量,这极大地改变了Internet流量模式并增加了Internet服务提供商(ISP)的流量中继成本。为了减轻对网络的压力,已经提出了局部对等体选择的方法,该方法提倡在同一网络(AS或ISP)内进行邻居选择,以减少跨ISP流量。但是,本地化的对等方选择可能会导致对等方的下载速度降低,从而在P2P系统中的下载性能和流量本地化之间造成不可忽略的折衷。针对面对折衷可以实现任何期望的帕累托最优的有效对等选择策略,我们在本文中的贡献包括三个方面:(1)我们将性能和局部折衷描述为多目标(b)匹配优化问题。特别是,我们首先提出一个通用加权(b)匹配模型,该模型表征了类似BitTorrent的对等选择中的针锋相对。然后,我们将多个优化目标引入到模型中,这些模型使用同时进行的目标进行优化来有效地表征性能和位置折衷。 (2)我们设计了完全分布式的对等体选择算法,该算法可以有效地逼近全局多目标优化问题的任何期望的帕累托最优,这代表了整个系统性能和局部性之间的期望折衷点。 (3)考虑网络动态性,我们进一步提出了实用的协议,该协议允许每个对等方根据下载性能或流量局部性动态调整其对等方选择偏好,以适应当前的对等连接质量,同时保证所需的折衷在整个下载过程中仍然可以实现。为了支持我们的模型和协议,我们在从实际跟踪中提取的各种实际设置下进行了严格的分析,广泛的模拟和原型实验。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号