Scheduling broadcasts with deadlines

Theoretical Computer Science

Volumn 325, Issue 3, 2004, Pages 479-488

  Kim, Jae Hoon ^a   Chwa, Kyung Yong ^b  

^a Pusan University of Foreign Studies   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Broadcast scheduling; On line algorithms

Indexed keywords

ALGORITHMS; BANDWIDTH; BROADCASTING; CABLE TELEVISION SYSTEMS; DATA TRANSFER; ONLINE SYSTEMS; SATELLITE COMMUNICATION SYSTEMS; SERVERS; WIRELESS TELECOMMUNICATION SYSTEMS;

BROADCAST SCHEDULING; COMPETITIVE RATIO; DATA ITEMS; ON-LINE ALGORITHMS;

SCHEDULING;

EID: 4544231084     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.047     Document Type: Conference Paper

References (14)

1. S. Aacharya, S. Muthukrishnan, Scheduling on-demand broadcasts: new metrics and algorithms, in: ACM/IEEE Int. Conf. on Mobile Computing and Networking, 1998, pp. 43-54.
2. D. Aksoy, M. Franklin, Scheduling for large scale on-demand data broadcast, in: Proc. of IEEE INFOCOM,1998, pp. 651-659.
3. Y. Bartal, S. Muthukrishnan, Minimizing maximum response time in scheduling broadcasts, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms,2000, pp. 558-559.
4. DirecPC Home Page, http://www.direcpc.com/.
5. J. Edmonds, K. Pruhs, Broadcast scheduling: when fairness is fine, in: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms,2002, pp. 421-430.
6. T. Erlebach, A. Hall, NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow, in: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms,2002, pp. 194-202.
7. A. Fiat, G.J. Woeginger (Eds.), Online scheduling, online algorithms: the state of the art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998.
8. R. Gandhi, S. Khuller, Y.A. Kim, Y.C. Wan, Algorithms for minimizing response time in broadcast scheduling, in: Proc. 9th Int. Integer Programming and Combinatorial Optimization (IPCO) Conf.,2002, pp. 425-438.
9. S. Jiang, N. Vaidya, Scheduling data broadcasts to "impatient" users, in: Proc. ACM Int. Workshop on Data Engineering for Wireless and Mobile Access,1999, pp. 52-59.
10. B. Kalyanasundaram, K. Pruhs, M. Velauthapillai, Scheduling broadcasts in wireless networks, in: Proc. 8th European Symp. on Algorithms (ESA),2000, pp. 290-301.
11. B. Kalyanasundaram, M. Velauthapillai, Broadcast scheduling under deadline, in: Proc. 11th European Symp. on Algorithms (ESA),2003, pp. 313-324.
12. R. Lipton, A. Tomkins, Online interval scheduling, in: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302-311.
13. M. van den Akker, H. Hoogeven, N. Vakhania, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, in: Proc. 8th European Symp. on Algorithms (ESA),2000, pp. 427-436.
14. G.J. Woeginger, On-line scheduling of jobs with fixed start and end times, Theoret. Comput. Sci. 130 (1994) 5-16.