首页> 外文期刊>Networking, IEEE/ACM Transactions on >Performance Modeling and Evaluation of Peer-to-Peer Live Streaming Systems Under Flash Crowds
【24h】

Performance Modeling and Evaluation of Peer-to-Peer Live Streaming Systems Under Flash Crowds

机译:闪存人群下点对点实时流系统的性能建模和评估

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

摘要

A peer-to-peer (P2P) live streaming system faces a big challenge under flash crowds. When a flash crowd occurs, the sudden arrival of numerous peers may starve the upload capacity of the system, hurt its quality of service, and even cause system collapse. This paper provides a comprehensive study on the performance of P2P live streaming systems under flash crowds. By modeling the systems using a fluid model, we study the system capacity, peer startup latency, and system recovery time of systems with and without admission control for flash crowds, respectively. Our study demonstrates that, without admission control, a P2P live streaming system has limited capacity to handle flash crowds. We quantify this capacity by the largest flash crowd (measured in shock level) that the system can handle, and further find this capacity is independent of system initial state while decreasing as departure rate of stable peer increases, in a power-law relationship. We also establish the mathematical relationship of flash crowd size to the worst-case peer startup latency and system recovery time. For a system with admission control, we prove that it can recover stability under flash crowds of any sizes. Moreover, its worst-case peer startup latency and system recovery time increase logarithmically with the flash crowd size. Based on the analytical results, we present detailed flash crowd handling strategies, which can be used to achieve satisfying peer startup performance while keeping system stability in the presence of flash crowds under different circumstances .
机译:对等(P2P)实时流媒体系统在闪存人群中面临着巨大挑战。当出现大量闪存时,众多对等点的突然到来可能会耗尽系统的上载容量,损害其服务质量,甚至导致系统崩溃。本文提供了有关Flash人群下P2P实时流系统性能的综合研究。通过使用流体模型对系统进行建模,我们分别研究了具有和不具有针对闪存人群的准入控制的系统的系统容量,同级启动延迟和系统恢复时间。我们的研究表明,在没有准入控制的情况下,P2P实时流系统处理闪存人群的能力有限。我们通过系统可以处理的最大闪存人群(以冲击水平衡量)来量化此容量,并进一步发现此容量独立于系统初始状态,同时随着幂律关系中稳定对等方的离开率增加而降低。我们还建立了闪存群大小与最坏情况下的对等启动延迟和系统恢复时间的数学关系。对于具有准入控制的系统,我们证明了它可以恢复任何大小的闪存人群下的稳定性。此外,其最坏情况下的对等启动延迟和系统恢复时间随闪存群的大小呈对数增加。根据分析结果,我们提出了详细的闪存群处理策略,这些策略可用于实现满意的同级启动性能,同时在不同情况下在存在闪存群的情况下保持系统稳定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号