Subscribe
Issue No.01 - January (2006 vol.17)
pp: 3-14
ABSTRACT
<p><b>Abstract</b>—On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called <tmath>{\rm{SIN}}{\hbox{-}}\alpha</tmath> that takes the urgency and number of outstanding requests into consideration. An efficient implementation of <tmath>{\rm{SIN}}{\hbox{-}}\alpha</tmath> is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises toward infinity. Trace-driven experiments show that <tmath>{\rm{SIN}}{\hbox{-}}\alpha</tmath> significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.</p>
INDEX TERMS
Mobile computing, on-demand data broadcast, scheduling, content delivery, time constraint.
CITATION
Xueyan Tang, Jianliang Xu, "Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation", IEEE Transactions on Parallel & Distributed Systems, vol.17, no. 1, pp. 3-14, January 2006, doi:10.1109/TPDS.2006.14