Scheduling broadcasts with deadlines

We investigate the problem of scheduling broadcasts in data delivering systems via broadcast, where a number of requests from several clients can be simultaneously satisfied by one broadcast of a server. Most of prior work has focused on minimizing the total flow time of requests. It assumes that once a request arrives, it will be held until satisfied. In this paper, we are concerned with the situation that clients may leave the system if their requests are still unsatisfied after waiting for some time, that is, each request has a deadline. The problem of maximizing the throughput, for example, the total number of satisfied requests, is developed, and there are given online algorithms achieving constant competitive ratios.

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

[2]  H. Hoogeveen,et al.  Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine , 2000, ESA.

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

[4]  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.

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

[6]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

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

[8]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[9]  Samir Khuller,et al.  Broadcast scheduling , 2003 .

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

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

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

[13]  Thomas Erlebach,et al.  NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.

[14]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

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