首页> 外文会议>IEEE Consumer Communications and Networking Conference >A packet-loss resilient push scheduling for mesh overlays
【24h】

A packet-loss resilient push scheduling for mesh overlays

机译:网状覆盖的分组损耗弹性推送调度

获取原文

摘要

Recently, some push-pull scheduling strategies have been proposed to replace the pull mechanism in mesh based P2P streaming systems. A push-pull mechanism is more efficient in terms of the overheads and leads to a much better playback delay performance since the pull part is mainly used either at startup or to recover lost content. In this work we combine the low scheduling delays of push scheduling with the resiliency and multi-parent ability of mesh overlays. We propose a pure push scheduling strategy, PurePush, where we replace the pull mechanism by a probabilistic push: Parents of a node push a packet with a relaying probability in order to reduce redundancy. Through simulations, we show that PurePush outperforms, with respect to playback delays, a typical push-pull strategy in the realistic situation where we consider packet loss.
机译:最近,已经提出了一些推挽调度策略来取代基于网格的P2P流系统中的拉动机制。推挽机构在开销方面更有效,并且导致更好的播放延迟性能,因为拉动部分主要用于启动或恢复丢失的内容。在这项工作中,我们将推动调度的低调度延迟与网格覆盖的弹性和多父能力相结合。我们提出了一种纯粹的推送调度策略,purepush,在那里我们通过概率推动替换拉动机制:节点的父母用中继概率推出数据包以减少冗余。通过模拟,我们表明Purepush优于播放延迟,这是我们考虑数据包丢失的典型推挽策略。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号