By Topic

A fair scheduling algorithm for video transmission over wireless packet networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hassan, M. ; American Univ. of Sharjah, Sharjah ; Landolsi, T. ; Tarhuni, M.

In this paper we propose a fair-scheduling algorithm for the transmission of video frames over wireless links. The scheme is based on the occupancy of the video decoder buffer. When the occupancy of the decoder buffer of a given video client becomes increasingly small and approaches a starvation threshold, it gets treated with a higher priority and gets serviced more frequently than other clients who may not be approaching the starvation point. When compared to other commonly-used scheduling algorithms, ours shows a better performance in terms of the end-to-end delay experienced by the video frames.

Published in:

Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on

Date of Conference:

March 31 2008-April 4 2008