arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.8083cs.NIcs.ITmath.ITmath.OC
收藏

多用户多助手无线网络自适应视频流

Adaptive Video Streaming for Wireless Networks with Multiple Users and Helpers

Dilip Bethanabhotla, Giuseppe Caire, Michael J. Neely

摘要:

我们认为,在无线网络中形成的几个用户和助手的自适应视频流的调度策略的优化设计。这种网络的一个特征是,任何用户通常都在多个助手的范围内。因此,为了应对用户-助手关联、负载均衡和小区间干扰,高效的流传输策略应当允许用户动态地选择要从其下载的助手节点,并且自适应地确定下载的视频质量水平。为了获得易于处理的公式,我们遵循“分而治之”方法:i)假设每个视频分组(块)在其回放延迟内被递送(“平滑流传输机制”),问题被公式化为服从队列稳定性的网络效用最大化(NUM),其中网络效用函数是用户的视频质量测量的凹的且分量非减的函数。ii)我们通过使用李雅普诺夫漂移加惩罚方法来解决NUM问题,获得自然地分解为称为“拥塞控制“的两个子策略的方案。(自适应视频质量和辅助站选择)和“传输调度”(帮助用户物理层传输速率的动态分配)。我们的解决方案相对于所提出的NUM问题是可证明最优的,在强每样本路径意义上。iii)最后,提出了一种自适应估计最大排队时延的方法,使得每个用户都可以计算出自己的预缓冲和再缓冲时间,以应对排队时延的波动。通过仿真,我们评估所提出的算法的性能与密集部署的助手节点的网络的现实假设下,并证明每样本路径最优的建议的解决方案,考虑一个非平稳的非遍历的情况下,用户的移动性,VBR视频编码。

英文摘要:

We consider the optimal design of a scheduling policy for adaptive video streaming in a wireless network formed by several users and helpers. A feature of such networks is that any user is typically in the range of multiple helpers. Hence, in order to cope with user-helper association, load balancing and inter-cell interference, an efficient streaming policy should allow the users to dynamically select the helper node to download from, and determine adaptively the video quality level of the download. In order to obtain a tractable formulation, we follow a "divide and conquer" approach: i) Assuming that each video packet (chunk) is delivered within its playback delay ("smooth streaming regime"), the problem is formulated as a network utility maximization (NUM), subject to queue stability, where the network utility function is a concave and componentwise non-decreasing function of the users' video quality measure. ii) We solve the NUM problem by using a Lyapunov Drift Plus Penalty approach, obtaining a scheme that naturally decomposes into two sub-policies referred to as "congestion control" (adaptive video quality and helper station selection) and "transmission scheduling" (dynamic allocation of the helper-user physical layer transmission rates).Our solution is provably optimal with respect to the proposed NUM problem, in a strong per-sample path sense. iii) Finally, we propose a method to adaptively estimate the maximum queuing delays, such that each user can calculate its pre-buffering and re-buffering time in order to cope with the fluctuations of the queuing delays. Through simulations, we evaluate the performance of the proposed algorithm under realistic assumptions of a network with densely deployed helper nodes, and demonstrate the per-sample path optimality of the proposed solution by considering a non-stationary non-ergodic scenario with user mobility, VBR video coding.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑