.png){kind=icon}
返回
Optimal video stream multiplexing through linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2008.02.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new optimal multiplexing scheme for compressed video streams based on their individual e-PCRTT transmission schedules. A linear programming algorithm is proffered, which takes into account the different constraints of each client. The algorithm simultaneously finds the optimum total multiplexed and individual stream schedules that minimize the peak transmission rate. Since the problem is formulated as a linear program it is bounded in polynomial time. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. Simulation results using 10 real MPEG-1 video sequences are presented. The optimal multiplexing linear programming results are compared to the e-PCRTT and Join-the-Shortest-Queue (JSQ) procedures in terms of peak transmission bandwidth, P-loss performance and standard deviation. For several client buffer sizes, the rate obtained by our LP solution when compared to a previous e-PCRTT and JSQ methods resulted in reductions of 47% and 56%, respectively. This implies for a fixed rate problem that the proposed scheme can allow an increase in the number of simultaneously served video streams. (c) 2008 Elsevier B.V. All rights reserved.
Keyword:
video rate smoothing
optimal multiplexing
statistical multiplexing gain
network utilization
linear programming
p-loss
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
2.7
论文数:
2.8K
被引数:
4.2K
机构
引用论文
Single Image Low-Light Enhancement via a Dual-Path Generative Adversarial Network基于双路径生成对抗网络的单一图像低光照增强
.png){kind=icon}
PREAI
分享收藏
分享收藏
Multi-baseline based texture adaptive belief propagation stereo matching technique for dense depth-map acquisition基于多基线纹理自适应置信传播的立体匹配技术用于密集深度图获取
PREAI
分享收藏
查看更多内容