On-demand Bounded Broadcast Scheduling with Tight Deadlines

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.

[1]  Jae-Hoon Kim,et al.  Scheduling Broadcasts with Deadlines , 2003, COCOON.

[2]  Michael J. Franklin,et al.  Scheduling for large-scale on-demand data broadcasting , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[3]  S. Muthukrishnan,et al.  Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.

[4]  Thomas Erlebach,et al.  An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem , 2004, J. Sched..

[5]  Bala Kalyanasundaram,et al.  On-Demand Broadcasting Under Deadline , 2003, ESA.

[6]  Prudence W. H. Wong,et al.  New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation , 2004, COCOON.

[7]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

[8]  Kirk Pruhs,et al.  Broadcast scheduling: when fairness is fine , 2002, SODA '02.

[9]  Nitin H. Vaidya,et al.  Scheduling Algorithms for a Data Broadcast System: Minimizing Variance of the Response Time , 1998 .

[10]  Feifeng Zheng,et al.  Improved on-line broadcast scheduling with deadlines , 2008, J. Sched..

[11]  S. Muthukrishnan,et al.  Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.

[12]  Jae-Hoon Kim,et al.  Scheduling broadcasts with deadlines , 2004, Theor. Comput. Sci..