Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation
Authors:
- Xueyan TangXTXueyan Tang
- Wang-Chien LeeWLWang-Chien Lee
- 5 December 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 17 (1) , 3-14
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 SIN-/spl alpha/ that takes the urgency and number of outstanding requests into consideration. An efficient implementation of SIN-/spl 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 SIN-/spl alpha/ significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.Keywords
This publication has 25 references indexed in Scilit:
- QoS-aware replica placement for content distributionIEEE Transactions on Parallel and Distributed Systems, 2005
- Maintaining temporal consistency in broadcast environments2004
- Multicast scheduling for list requests2003
- Multiversion data broadcastIEEE Transactions on Computers, 2002
- QoS issues in Web servicesIEEE Internet Computing, 2002
- A workload characterization study of the 1998 World Cup Web siteIEEE Network, 2000
- R×W: a scheduling approach for large-scale on-demand data broadcastIEEE/ACM Transactions on Networking, 1999
- Scheduling on-demand broadcasts1998
- Broadcast deliveryProceedings of the IEEE, 1988
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973