By Topic

A scheduling algorithm for interactive video streaming in UMTS 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
$33 $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)
R. Laraspata ; DEE-Politecnico di Bari, v. Orabona, 4 – 70125, Bari, Italy ; D. Striccoli ; P. Camarda

The importance of a Variable Bit Rate (VBR) video transmission on UMTS networks is increasing in time. The bursty nature of VBR traffic complicates the design of efficient mechanisms for video retrieval, transport, and provisioning to achieve a high bandwidth utilization and reduce the negative effects of bandwidth fluctuations in wireless channels. To this aim, several scheduling algorithms can be successfully implemented. They regulate data transmission to reduce the rate variability peculiar of VBR streams. At client side, scheduled data are temporarily stored in the client buffer before being decoded on the terminal. In this work, a novel scheduling algorithm, the Scheduling Algorithm for Interactive Video (SAIV) is presented and analyzed. It is an algorithm thought for VBR stream transmission in UMTS networks that takes into account the user interactivity. Scheduling is performed “online”, over relatively small video segments to reduce delays. SAIV dynamically varies the sampling frequency of the Real Time Control Protocol (RTCP) feedbacks that carry information on the client buffer status. The sampling frequency is modulated according to the difference between the calculated buffer fill level at server side and the real buffer fill level at client side. The latter is exploited to reschedule data with the updated information. Numerical results testify the SAIV effectiveness compared to the classical SLWIN online algorithm already known by literature, in some simulation scenarios of real interest.

Published in:

Computers and Communications (ISCC), 2010 IEEE Symposium on

Date of Conference:

22-25 June 2010