Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Parallel Processor Scheduling with Limited Number of Preemptions
SIAM Journal on Computing
Scheduling Algorithms
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Joint Video Coding and Statistical Multiplexing for Broadcasting Over DVB-H Channels
IEEE Transactions on Multimedia
Overview of the H.264/AVC video coding standard
IEEE Transactions on Circuits and Systems for Video Technology
Rate-constrained coder control and comparison of video coding standards
IEEE Transactions on Circuits and Systems for Video Technology
Rate-distortion performance of H.264/AVC compared to state-of-the-art video codecs
IEEE Transactions on Circuits and Systems for Video Technology
Statistical multiplexing of variable-bit-rate videos streamed to mobile devices
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Broadcasting video streams encoded with arbitrary bit rates in energy-constrained mobile TV networks
IEEE/ACM Transactions on Networking (TON)
Adaptive transmission of variable-bit-rate video streams to mobile devices
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Design and evaluation of a testbed for mobile TV networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
GreenTube: power optimization for mobile videostreaming via dynamic cache management
Proceedings of the 20th ACM international conference on Multimedia
| Hi-index | 0.00 |
In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequency circuits till the next burst in order to save energy. To achieve this energy saving without scarifying streaming quality, the base station must carefully construct the burst schedule for all TV channels. This is called the burst scheduling problem. In this paper, we prove that the burst scheduling problem for TV channels with arbitrary bit rates is NP-complete.We then propose a practical simplification of the general problem, which allows TV channels to be classified into multiple classes, and the bit rates of the classes have power of two increments, e.g., 100, 200, and 400 kbps. Using this practical simplification, we propose an optimal and efficient burst scheduling algorithm. We present theoretical analysis, simulation, and actual implementation in a mobile TV testbed to demonstrate the optimality, practicality, and efficiency of the proposed algorithm.