Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
On-demand Bounded Broadcast Scheduling with Tight Deadlines
Poon, C.K., Zheng, F. and Xu, Y.
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.
Cite as: Poon, C.K., Zheng, F. and Xu, Y. (2006). On-demand Bounded Broadcast Scheduling with Tight Deadlines. In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51. Gudmundsson, J. and Jay, B., Eds. ACS. 139-143.
(from crpit.com)
(local if available)
