Skip to Main Content
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.