Scheduling time-critical requests for multiple data objects in on-demand broadcast
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 2124-2143 |
| Journal / Publication | Concurrency Computation Practice and Experience |
| Volume | 22 |
| Issue number | 15 |
| Publication status | Published - Oct 2010 |
Link(s)
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.
Research Area(s)
- On-demand broadcast, Real-time, Scheduling algorithm
Citation Format(s)
Scheduling time-critical requests for multiple data objects in on-demand broadcast. / Lee, Victor C. S.; Liu, Kai.
In: Concurrency Computation Practice and Experience, Vol. 22, No. 15, 10.2010, p. 2124-2143.
In: Concurrency Computation Practice and Experience, Vol. 22, No. 15, 10.2010, p. 2124-2143.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
