By Topic

R×W: a scheduling approach for large-scale on-demand data broadcast

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

2 Author(s)
D. Aksoy ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; M. Franklin

Broadcast is becoming an increasingly attractive data-dissemination method for large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient on-line scheduling algorithms that can balance individual and overall performance and can scale in terms of data set sizes, client populations, and broadcast bandwidth. We propose an algorithm, called R×W, that provides good performance across all of these criteria and can be tuned to trade off average and worst-case waiting time. Unlike previous work on low overhead scheduling, the algorithm does not use estimates of the access probabilities of items, but rather, it makes scheduling decisions based on the current queue state, allowing it to easily adapt to changes in the intensity and distribution of the workload. We demonstrate the performance advantages of the algorithm under a range of scenarios using a simulation model and present analytical results that describe the intrinsic behavior of the algorithm

Published in:

IEEE/ACM Transactions on Networking  (Volume:7 ,  Issue: 6 )