• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Modeling Flash Crowd Performance in Peer-to-Peer File Distribution
【24h】

Modeling Flash Crowd Performance in Peer-to-Peer File Distribution

机译：点对点文件分发中的Flash人群性能建模

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

摘要

Given the growing popularity of peer-to-peer file distribution in commercial applications, it is important to understand the challenges of using p2p file-sharing protocols for file distribution, and how extreme conditions such as flash crowds affect the efficiency of file distribution. In this light, there is a need to understand the impact of the utilization of available bandwidth on the performance of peer-assisted file distribution systems. With a simple measurement study on PlanetLab, we identified distinct phases in peer bandwidth utilization over the download duration. Based on the evolution of the utilization of available peer bandwidth over time, we formulated an analytical model for flash crowds in homogeneous and heterogeneous bandwidth swarms. The model estimates the instantaneous download rate and the average file download time with 10 percent error for swarms up to 160 peers. Our model can be used to predict the scalability of the system when the number of peers increases, and to provision for flash crowds by estimating the server bandwidth to achieve a minimum quality of service. Lastly, we demonstrate how our model is applied to new p2p protocols to understand their design and performance problems.
机译：鉴于点对点文件分发在商业应用中的日益普及，了解使用p2p文件共享协议进行文件分发的挑战以及诸如闪存拥挤之类的极端条件如何影响文件分发效率非常重要。有鉴于此，有必要了解可用带宽的利用对对等辅助文件分发系统的性能的影响。通过对PlanetLab的简单测量研究，我们确定了下载持续时间内对等带宽利用率的不同阶段。基于可用对等带宽利用率随时间的演变，我们为同构和异构带宽群中的闪存人群制定了一个解析模型。该模型估计了最多160个对等方的群集的瞬时下载速率和平均文件下载时间（错误率为10％）。我们的模型可用于预测对等体数目增加时的系统可伸缩性，并通过估计服务器带宽以实现最低服务质量来提供闪存。最后，我们演示了如何将模型应用于新的p2p协议，以了解其设计和性能问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号