Improved on-line broadcast scheduling with deadlines

Abstract We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the satisfied requests. For the case where all requested pages have the same length, we present an online deterministic algorithm named BAR and prove that it is 4.56-competitive. This improves the previous algorithm of (Kim, J.-H., Chwa, K.-Y. in Theor. Comput. Sci. 325(3):479–488, 2004) which is shown to be 5-competitive by (Chan, W.-T., et al. in Lecture Notes in Computer Science, vol. 3106, pp. 210–218, 2004). In the case that pages may have different lengths, we give a ( $\Delta+ 2\sqrt{\Delta}+2$ )-competitive algorithm where Δ is the ratio of maximum to minimum page lengths. This improves the (4Δ+3)-competitive algorithm of (Chan, W.-T., et al. in Lecture Notes in Computer Science, vol. 3106, pp. 210–218, 2004). We also prove an almost matching lower bound of Ω(Δ/log Δ). Furthermore, for small values of Δ we give better lower bounds.

[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]  Thomas Erlebach,et al.  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.

[4]  Yin-Feng Xu,et al.  A tight lower bound for job scheduling with cancellation , 2006, Inf. Process. Lett..

[5]  Nitin H. Vaidya,et al.  Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.

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

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

[8]  Bala Kalyanasundaram,et al.  Scheduling Broadcasts in Wireless Networks , 2000, ESA.

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

[10]  Rajiv Gandhi,et al.  Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, IPCO.

[11]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[12]  Thomas Erlebach,et al.  NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow , 2001 .

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

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

[15]  Francis Y. L. Chin,et al.  Laxity Helps in Broadcast Scheduling , 2005, ICTCS.