Improved on-line broadcast scheduling with deadlines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4112 LNCS, Issue , 2006, Pages 320-329

  Zheng, Feifeng ^a   Fung, Stanley P Y ^b   Chan, Wun Tat ^c   Chin, Francis Y L ^c   Poon, Chung Keung ^d   Wong, Prudence W H ^e  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^e UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; PROBLEM SOLVING; THEOREM PROVING;

BROADCAST SCHEDULING; DETERMINISTIC ALGORITHMS;

ONLINE SYSTEMS;

EID: 33749579482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_34     Document Type: Conference Paper

References (14)

1. D. Aksoy and M. Franklin. Scheduling for large scale on-demand data broadcast. In Proc. of IEEE INFOCOM, pages 651-659, 1998.
2. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proc. 11th SODA, pages 558-559, 2000.
3. A. Borodin and R. El-yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
4. Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, and Prudence W.H. Wong. New results on on-demand broadcasting with deadline via job scheduling with cancellation. In 10th COCOON, LNCS 3106, pages 210-218, 2004.
5. J. Edmonds and K. Pruhs. Broadcast scheduling: when fairness is fine. In Proc. 13th SODA, pages 421-430, 2002.
6. T. Erlebach and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. 13th ACM-SIAM SODA, pages 194-202, 2002.
7. Stanley P. Y. Fung, Francis Y. L. Chin, and Chung Keung Poon. Laxity helps in broadcast scheduling. In Proceedings of 9th Italian Conference on Theoretical Computer Science, pages 251-264, 2005.
8. R. Gandhi, S. Khuller, Y.A. Kim, and Y.C. Wan. Algorithms for minimizing response time in broadcast scheduling. Algorithmica, 38(4):597-608, 2004.
9. S. Jiang and N. Vaidya. Scheduling data broadcasts to "impatient" users. In Proc. ACM International Workshop on Data Engineering for Wireless and Mobile Access, pages 52-59, 1999.
10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. 8th ESA, LNCS 1879, pages 290-301, 2000.
11. Jae-Hoon Kim and Kyung-Yong Chwa. Scheduling broadcasts with deadlines. Theoretical Computer Science, 325(3):479-488, 2004.
12. DirecPC Home Page, http://www.direcpc.com/.
13. Gerhard J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130:5-16, 1994.
14. Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, and Yinfeng Xu. A tight lower bound for job scheduling with cancellation. Information Processing Letters, 97(1):1-3, 2006.