.png){kind=icon}
返回
Low-Complexity Packet Scheduling Algorithms for Streaming Scalable Media Based on Time Utility Function
.png){kind=icon}
PRE
AI
DOI：10.1109/TMM.2014.2359335.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a time-utility function (TUF)-based packet scheduling algorithm for streaming scalable media. In the proposed system, the scalable media is partitioned into data units of different quality layers, which are then prioritized and transmitted according to their TUFs that capture both their quality contributions to the decoded media and urgencies with respect to their playback schedule. For optimal streaming quality while maintaining a reasonable computational complexity, packet transmissions are scheduled using a low-complexity algorithm based on utility accrual maximization. The computational complexity can be further reduced by considering the look-ahead window and a modified utility function. Simulation results show that the proposed scheduling algorithms achieve near-optimal performance when compared with the operational rate distortion bound of the stream source at any given bandwidth budget.
Keyword:
Media streaming
packet scheduling
scalable media
time utility function
utility maximization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.7
论文数:
4.5K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容