Quasi-Optimal Network Utility Maximization for Scalable Video Streaming

Computer Science – Multimedia

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 9 figures, 4 tables

Scientific paper

This paper addresses rate control for transmission of scalable video streams via Network Utility Maximization (NUM) formulation. Due to stringent QoS requirements of video streams and specific characterization of utility experienced by end-users, NUM formulation for these streams is nonconvex and even nonsmooth, hence making dual methods often incompetent to solve them. Convexity plays an important role in this work as it permits the use of existing dual methods to solve NUM problem iteratively and distributively. Hence, to tackle the nonsmoothness and nonconvexity, we aim at reformulating the NUM problem by employing a series of approximation and transformation of the ideal discretely adaptive utility functions for scalable video streams. The reformulated problem is shown to be smooth and strictly convex under certain conditions. To obtain a distributed rate control algorithm, we then solve the reformulated NUM using existing dual methods. Our experimental results show that the proposed rate control algorithm converges within a few iteration steps thereby admitting a low overhead.

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

Quasi-Optimal Network Utility Maximization for Scalable Video Streaming 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 Quasi-Optimal Network Utility Maximization for Scalable Video Streaming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-Optimal Network Utility Maximization for Scalable Video Streaming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-437

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