首页> 外文会议>2011 IEEE International Conference on Communications >Modeling and Performance Analysis of P2P Live Streaming Systems under Flash Crowds
【24h】

Modeling and Performance Analysis of P2P Live Streaming Systems under Flash Crowds

机译:闪存人群下P2P直播系统的建模与性能分析。

获取原文

摘要

A fundamental problem that a peer-to-peer (P2P) live streaming system faces is how to support flash crowds effectively. A flash crowd occurs when a burst of join requests arrive at a system. When a flash crowd occurs, the sudden arrival of numerous peers may starve the upload capacity of a P2P system, and degrade the quality of service. By theoretical analysis and simulations, we find that a system has limited capacity to handle a flash crowd: It can recover to a new stable state when the size of flash crowd is small or moderate, but collapse when the flash crowd is excessively large. The capacity of a system is independent of initial state of the system while relevant to stable peers' departure rate, which suggests this capacity is an essential property of a P2P live streaming system. In addition, we prove that a P2P live streaming system with admission control has excellent capacity to handle flash crowds: It can recover from flash crowds of excessively large size and a startup peer's waiting time scales logarithmically with the size of flash crowds. Our theoretical model and simulation results provide a promising framework to understand the capacity of a P2P live streaming system for handling flash crowds.
机译:对等(P2P)实时流媒体系统面临的一个基本问题是如何有效地支持闪存人群。当大量加入请求到达系统时,就会出现闪存拥挤的情况。当出现闪存拥挤时,众多对等点的突然到来可能会饿死P2P系统的上载容量,并降低服务质量。通过理论分析和仿真,我们发现系统处理闪光人群的能力有限:当闪光人群的大小较小或适中时,它可以恢复到新的稳定状态,但是当闪光人群过大时,它会崩溃。系统的容量与系统的初始状态无关,而与稳定的对等方的离开率有关,这表明该容量是P2P实时流式传输系统的基本属性。此外,我们证明了具有准入控制的P2P实时流系统具有出色的处理Flash人群的能力:它可以从过大的Flash人群中恢复,并且启动对等对象的等待时间与Flash人群的数量成对数关系。我们的理论模型和仿真结果提供了一个有前途的框架,以了解P2P实时流系统处理闪存人群的能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号