Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation

  • Authors:
  • Jianliang Xu;Xueyan Tang;Wang-Chien Lee

  • Affiliations:
  • IEEE;IEEE;IEEE

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 {\rm{SIN}}{\hbox{-}}\alpha that takes the urgency and number of outstanding requests into consideration. An efficient implementation of {\rm{SIN}}{\hbox{-}}\alpha 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 {\rm{SIN}}{\hbox{-}}\alpha significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.