arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.2604cs.MMcs.NI
收藏

面向可扩展视频流的准最优网络效用最大化

Quasi-Optimal Network Utility Maximization for Scalable Video Streaming

Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad Hassan Hajiesmaili, Sina Jafarpour

AI总结:

本文针对可扩展视频流的非凸非光滑NUM速率控制问题,通过凸化将其重构为D.C.问题,结合SCP与对偶方法提出两种分布式迭代算法,可收敛到局部最优点且收敛行为可控。

摘要:

本文通过网络效用最大化(Network Utility Maximization,NUM)公式研究可扩展视频流传输的速率控制问题。由于视频流对服务质量(QoS)有严格要求,且终端用户体验到的效用具有特定表征,针对这类视频流需要求解非凸甚至非光滑的NUM公式,而对偶方法通常对此类问题无能为力。凸化在本研究中起到关键作用,它使得我们可以利用现有的对偶方法,以迭代、分布式的方式求解NUM问题的近似解。因此,为解决非光滑性与非凸性问题,我们通过对可扩展视频流的理想离散自适应效用函数进行近似与变换,重构NUM问题。重构后的问题被证明是一个D.C.(凸函数之差,Difference of Convex)问题。我们利用序列凸规划(Sequential Convex Programming,SCP)方法,用一系列凸问题来近似原始非凸D.C.问题,以此替代原非凸D.C.问题。随后,我们使用现有的对偶方法求解SCP方法生成的每个凸问题。这一流程是本文提出的两种分布式迭代速率控制算法的核心,可证明该算法能收敛到非凸D.C.问题的局部最优点,等价于收敛到原始非凸问题近似形式的局部最优点。我们的实验结果表明,所提出的速率控制算法能够收敛,且收敛行为易于处理。

英文摘要:

This paper addresses rate control for transmission of scalable video streams via Network Utility Maximization (NUM) formulation. Due to stringent QoS requirements of video streams and specific characterization of utility experienced by end-users, one has to solve nonconvex and even nonsmooth NUM formulation for such streams, where dual methods often prove incompetent. Convexification plays an important role in this work as it permits the use of existing dual methods to solve an approximate to the NUM problem iteratively and distributively. Hence, to tackle the nonsmoothness and nonconvexity, we aim at reformulating the NUM problem through approximation and transformation of the ideal discretely adaptive utility function for scalable video streams. The reformulated problem is shown to be a D.C. (Difference of Convex) problem. We leveraged Sequential Convex Programming (SCP) approach to replace the nonconvex D.C. problem by a sequence of convex problems that aim to approximate the original D.C. problem. We then solve each convex problem produced by SCP approach using existing dual methods. This procedure is the essence of two distributed iterative rate control algorithms proposed in this paper, for which one can show the convergence to a locally optimal point of the nonconvex D.C. problem and equivalently to a locally optimal point of an approximate to the original nonconvex problem. Our experimental results show that the proposed rate control algorithms converge with tractable convergence behavior.

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

↑