Content-Aware Rate Control for Video Transmission with Buffer Constraints in Multipath Networks

Computer Science – Multimedia

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, conference submission

Scientific paper

Being an integral part of the network traffic, nowadays it's vital to design robust mechanisms to provide QoS for multimedia applications. The main goal of this paper is to provide an efficient solution to support content-aware video transmission mechanism with buffer underflow avoidance at the receiver in multipath networks. Towards this, we introduce a content-aware time-varying utility function, where the quality impacts of video content is incorporated into its definition. Using the proposed utility function, we formulate a multipath Dynamic Network Utility Maximization (DNUM) problem for the rate allocation of video streams, where it takes into account QoS demand of video streams in terms of buffer underflow avoidance. Finally, using primal-dual method, we propose a distributed solution that optimally allocates the shared bandwidth to video streams. The numerical examples demonstrate the efficacy of the proposed content-aware rate allocation algorithm for video sources in both single and multiple path network models.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Content-Aware Rate Control for Video Transmission with Buffer Constraints in Multipath Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Content-Aware Rate Control for Video Transmission with Buffer Constraints in Multipath Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Content-Aware Rate Control for Video Transmission with Buffer Constraints in Multipath Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-669588

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.