On statistical multiplexing of variable-bit-rate video streams in mobile systems
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Statistical multiplexing of variable-bit-rate videos streamed to mobile devices
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
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
Rate-smoothed schedule with tolerable data dropping for video coding stream
Multimedia Tools and Applications
Online smoothness with dropping partial data based on advanced video coding stream
Multimedia Tools and Applications
| Hi-index | 0.00 |
Traffic smoothing is an efficient means to reduce the bandwidth requirement for transmitting a variable-bit-rate video stream. Several traffic-smoothing algorithms have been presented to offline compute the transmission schedule for a prerecorded video. For live video applications, Sen present a sliding-window algorithm, referred to as SLWIN(k), to online compute the transmission schedule on the fly. SLWIN(k) looks ahead W video frames to compute the transmission schedule for the next k frametimes, where klesw. Note that W is upper bounded by the initial delay of the transmission. The time complexity of SLWIN(k) is O(W*N/k) for an N frame live video. In this paper, we present an O(N) online traffic-smoothing algorithm and two variants, denoted as FOS, FOS1 and FOS2, respectively. Note that O(N) is a trivial lower bound of the time complexity of the traffic-smoothing problem. Thus, the proposed algorithm is optimal. We compare the performance of our algorithms with SLWIN(k) based on several benchmark video clips. Experiment results show that FOS2, which adopts the aggressive workahead heuristic, further reduces the bandwidth requirement and better utilizes the client buffer for real-time interactive applications in which the initial delays are small