首页> 外文期刊>Mobile Computing, IEEE Transactions on >Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP
【24h】

Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP

机译:基于非合作博弈论的速率自适应用于HTTP动态视频流

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

摘要

Dynamic Adaptive Streaming over HTTP (DASH) has demonstrated to be an emerging and promising multimedia streaming technique, owing to its capability of dealing with the variability of networks. Rate adaptation mechanism, a challenging and open issue, plays an important role in DASH based systems since it affects Quality of Experience (nQoEn) of users, network utilization, etc. In this paper, based on non-cooperative game theory, we propose a novel algorithm to optimally allocate the limited export bandwidth of the server to multi-users to maximize theirnQoEnwith fairness guaranteed. The proposed algorithm is proxy-free. Specifically, a novel usernQoEnmodel is derived by taking a variety of factors into account, like the received video quality, the reference buffer length, and user accumulated buffer lengths, etc. Then, the bandwidth competing problem is formulated as a non-cooperation game with the existence of Nash Equilibrium that is theoretically proven. Finally, a distributed iterative algorithm with stability analysis is proposed to find the Nash Equilibrium. Compared with state-of-the-art methods, extensive experimental results in terms of both simulated and realistic networking scenarios demonstrate that the proposed algorithm can produce highernQoEn, and the actual buffer lengths of all users keep nearly optimal states, i.e., moving around the reference buffer all the time. Besides, the proposed algorithm produces no playback interruption.
机译:由于HTTP动态自适应流(DASH)具有处理网络可变性的能力,因此已被证明是一种新兴且有前途的多媒体流技术。速率适应机制是一个具有挑战性和开放性的问题,它在基于DASH的系统中起着重要作用,因为它会影响体验质量(n QoE n),网络利用率等。在本文中,我们基于非合作博弈论提出了一种新颖的方法最佳地将服务器的有限出口带宽分配给多用户的算法,以最大化他们的n QoEn保证公平。所提出的算法是无代理的。具体而言,一种新颖的usern QoE < / italic> nmodel是通过考虑多种因素得出的,例如接收的视频质量,参考缓冲区长度和用户累积的缓冲区长度等。然后,将带宽竞争问题表述为与在理论上证明了纳什均衡的存在。最后,提出了一种具有稳定性分析的分布式迭代算法,以找到纳什均衡。与最先进的方法相比,无论在模拟还是现实的网络场景下,大量的实验结果表明,所提出的算法可以产生更高的n QoE n,并且所有用户的实际缓冲区长度都保持最佳状态,即在参考周围移动一直缓冲。此外,提出的算法不会产生播放中断。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号