首页> 外文会议>Wireless Communications and Networking Conference >Multiple-Tree Topology Construction Scheme for P2P Live Streaming Systems Under Flash Crowds
【24h】

Multiple-Tree Topology Construction Scheme for P2P Live Streaming Systems Under Flash Crowds

机译:闪存人群下P2P直播系统的多树拓扑施工方案

获取原文

摘要

P2P live streaming systems have been widely adopted nowadays. In such systems, flash crowds still remains a big challenge, which often occur when an enormous number of users suddenly arrive to view a newly released program. In a flash crowd scenario, users often suffer from a long startup delay and a high failure rate. In this paper, we propose a topology-construction-based algorithm to alleviate the flash crowd. Specifically, first the tracker server constructs a multiple tree topology with total new peers. Then according to the topology, all new peers join the current P2P system in form of multiple trees. When constructing the topology, the tracker server puts new peers with higher bandwidth and longer waiting time more closer to the root in each tree, in order to reduce the average waiting time of new peers. Moreover, a new analytical model is also devised to evaluate our algorithm. Model analysis and simulation indicate that our method can enhance the joining process of new peers and improve their startup delay and failure rate.
机译:现在已经广泛采用了P2P直播流系统。在这样的系统中,闪存人群仍然是一个很大的挑战,这通常会发生在巨大的用户突然到达新发布的程序时。在闪存人群情景中,用户经常遭受长的启动延迟和高故障率。在本文中,我们提出了一种基于拓扑结构的算法来缓解闪存人群。具体来说,首先跟踪器服务器使用全新对等体构建多树拓扑。然后根据拓扑,所有新的同行都以多个树的形式加入当前的P2P系统。在构建拓扑时,跟踪器服务器将具有更高带宽和更长的等待时间更靠近每棵树中的root更近的新对等体,以减少新对等体的平均等待时间。此外,还设计了一种新的分析模型来评估我们的算法。模型分析和仿真表明,我们的方法可以增强新同行的加入过程,提高其启动延迟和故障率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号