Optimal packet scheduling and rate control for video streaming
Date
2007Source Title
Proceedings of SPIE - The International Society for Optical Engineering
Print ISSN
0277786X
Volume
6508
Issue
PART 2
Language
English
Type
Conference PaperItem Usage Stats
45
views
views
39
downloads
downloads
Metadata
Show full item recordAbstract
In this paper, we propose a new low-complexity retransmission based optimal video streaming and rate adaptation algorithm. The proposed OSRC (Optimal packet Scheduling and Rate Control) algorithm provides average reward optimal solution to the joint scheduling and rate control problem. The efficacy of the OSRC algorithm is demonstrated against optimal FEC based schemes and results are verified over TFRC (TCP Friendly Rate Control) transport with ns-2 simulations. © 2007 SPIE-IS&T.
Keywords
Average reward optimalityMarkov decision processes
Packet scheduling
Rate control
Rate-distortion optimization
Video streaming
Computational complexity
Image communication systems
Markov processes
Optimization
Packet networks
Problem solving
Scheduling
Average reward optimality
Markov decision processes
Packet scheduling
Rate control
Rate distortion optimization
Video streaming
Permalink
http://hdl.handle.net/11693/27088Published Version (Please cite this version)
https://doi.org/10.1117/12.704284Collections
Related items
Showing items related by title, author, creator and subject.
-
Levy walk evolution for global optimization
(2008)A novel evolutionary global optimization approach based on adaptive covariance estimation is proposed. The proposed method samples from a multivariate Levy Skew Alpha-Stable distribution with the estimated covariance matrix ... -
A parametric simplex algorithm for linear vector optimization problems
(Springer, 2017)In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ... -
Projections onto convex sets (POCS) based optimization by lifting
(2013)A new optimization technique based on the projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by ...
