Abstract
On-demand broadcast is an effective data dissemination approach in mobile computing environments. Most of the recent studies on on-demand data broadcast assume that clients request only a singledata-object at a time. This assumption may not be practical for the increasingly sophisticated mobile applications. In this paper, we investigate the scheduling problem of time-critical requests for multiple data objects in on-demand broadcast environments and observe that existing scheduling algorithms designed for single-data-object requests perform unsatisfactorily in this new setting. Based on our analysis, we propose new algorithms to improve the system performance. Copyright © 2010 John Wiley & Sons, Ltd.
| Original language | English |
|---|---|
| Pages (from-to) | 2124-2143 |
| Journal | Concurrency Computation Practice and Experience |
| Volume | 22 |
| Issue number | 15 |
| DOIs | |
| Publication status | Published - Oct 2010 |
Research Keywords
- On-demand broadcast
- Real-time
- Scheduling algorithm
Fingerprint
Dive into the research topics of 'Scheduling time-critical requests for multiple data objects in on-demand broadcast'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver