首页> 外文会议>IEEE International Conference on Communications Workshops >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直播流系统具有优异的处理闪存人群的能力:它可以从过大尺寸的闪存人群中恢复,并且启动对等的等待时间尺度对数对方的闪存人群的大小。我们的理论模型和仿真结果提供了一个有前途的框架,以了解P2P直播系统以处理闪存人群的能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号