Optimal Dynamic Rate Shaping for Compressed Video Streaming
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Providing Controlled Quality Assurance for Streaming Stored-Videos Across the Internet Using VPNs
Multimedia Tools and Applications
Rate adaptation for wireless video streaming based on error statistics
International Journal of Wireless and Mobile Computing
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Buffer management for aggregated streaming data with packet dependencies
INFOCOM'10 Proceedings of the 29th conference on Information communications
QoS-aware multipath-TCP extensions for mobile and multimedia applications
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
The design of single encoder and decoder for multi-view video
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Control of distributed servers for quality-fair delivery of multiple video streams
Proceedings of the 20th ACM international conference on Multimedia
Hi-index | 0.00 |
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained network, loss of frames may be unavoidable. Under such circumstances, it is desirable to find a server transmission schedule that can efficiently utilize the network resources while maximizing the perceived quality-of-service (QoS) at the client. To address this issue, in this paper we introduce the notion of selective frame discard at the server and formulate the optimal selective frame discard problem using a QoS-based cost function. Given network bandwidth and client buffer constraints, we develop an O (N log N) algorithm to find the minimum number of frames that must be discarded in order to meet these constraints. The correctness of the algorithm is also formally established. We present a dynamic programming based algorithm for solving the problem of optimal selective frame discard. Since the computational complexity of the optimal algorithm is prohibitively high in general, we also develop several efficient heuristic algorithms for selective frame discard. These algorithms are evaluated using JPEG and MPEG video traces.