首页> 外文会议>2nd 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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号