首页> 外文期刊>Computer networks >Overlay live video streaming with heterogeneous bitrate requirements
【24h】

Overlay live video streaming with heterogeneous bitrate requirements

机译:具有不同比特率要求的实时视频流叠加

获取原文
获取原文并翻译 | 示例

摘要

We study a streaming cloud formed by distributed proxies providing live video service to diverse users (e.g., smart TVs, PCs, tablets, mobile phones, etc.). The proxies form a push-based overlay network, with each proxy serving a certain video bitrate for users to join. To form a proxy overlay serving heterogeneous bitrates, we consider that the video is encoded into multiple MDC (Multiple-Description Coding) streams with the serving bitrate of proxy i being k_i description streams. In order to effectively mitigate stream disruption due to node churns, proxy i also joins an additional r_i redundant MDC streams (r_i ≥ 0) in such a way that all the (k_i + r_i) streams are supplied by distinct parents. For live streaming, the critical issue is how to construct the parent-disjoint trees minimizing the assembly delay of the proxies. We present a realistic delay model capturing important system parameters and delay components, formulate the optimization problem and show that it is NP-hard. We propose a centralized algorithm which is useful for a centrally-managed network and serves as a benchmark for comparison (PADTrees-Centralized). For large network, we propose a simple and distributed algorithm which continuously reduces delay through overlay adaptation (PADTrees-Distributed). Through extensive simulation on real Internet topologies, we show that high stream continuity can be achieved with push-based trees in the presence of node churns. Our algorithms are simple and effective, achieving low loss and low delay.
机译:我们研究了由分布式代理形成的流云,该代理向不同的用户提供实时视频服务(例如,智能电视,PC,平板电脑,手机等)。代理形成基于推送的覆盖网络,每个代理为用户加入一定的视频比特率。为了形成服务于异构比特率的代理覆盖,我们考虑将视频编码为多个MDC(多描述编码)流,其中代理i的服务比特率为k_i描述流。为了有效地减轻由于节点搅动而引起的流中断,代理i还加入了额外的r_i冗余MDC流(r_i≥0),以使所有(k_i + r_i)流都由不同的父级提供。对于实时流,关键问题是如何构造父级不相交的树,以最大程度地减少代理的组装延迟。我们提出了一个现实的延迟模型,该模型捕获了重要的系统参数和延迟组件,提出了优化问题并表明它是NP难的。我们提出了一种集中式算法,该算法对于集中管理的网络很有用,并且可以作为比较的基准(PADTrees-Centralized)。对于大型网络,我们提出了一种简单的分布式算法,该算法可通过覆盖自适应(PADTrees-Distributed)连续减少延迟。通过对真实Internet拓扑的广泛仿真,我们表明在存在节点搅动的情况下,使用基于推送的树可以实现高流连续性。我们的算法简单有效,实现了低损耗和低延迟。

著录项

  • 来源
    《Computer networks》 |2014年第ptaa期|53-63|共11页
  • 作者单位

    Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;

    Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;

    Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Live streaming; Heterogeneous bitrate; Parent-disjoint trees;

    机译:即时串流;异构比特率;父不相交的树;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号