Improved On-Line Broadcast Scheduling with Deadlines

  • Feifeng Zheng
  • Stanley P. Y. Fung
  • Wun-Tat Chan
  • Francis Y. L. Chin
  • Chung Keung Poon
  • Prudence W. H. Wong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4112)


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 and Chwa [11] which is shown to be 5-competitive by Chan et al. [4]. In the case that pages may have different lengths, we prove a lower bound of Ω(Δ/logΔ) on the competitive ratio where Δ is the ratio of maximum to minimum page lengths. This improves upon the previous \(\sqrt{\Delta}\) lower bound in [11,4] and is much closer to the current upper bound of (\(\Delta+2\sqrt{\Delta}+2\)) in [7]. Furthermore, for small values of Δ we give better lower bounds.


Competitive Ratio Broadcast Schedule Data Broadcast Idle Interval Tight Deadline 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aksoy, D., Franklin, M.: Scheduling for large scale on-demand data broadcast. In: Proc. of IEEE INFOCOM, pp. 651–659 (1998)Google Scholar
  2. 2.
    Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: Proc. 11th SODA, pp. 558–559 (2000)Google Scholar
  3. 3.
    Borodin, A., El-yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)MATHGoogle Scholar
  4. 4.
    Chan, W.-T., Lam, T.-W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 210–218. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Edmonds, J., Pruhs, K.: Broadcast scheduling: when fairness is fine. In: Proc. 13th SODA, pp. 421–430 (2002)Google Scholar
  6. 6.
    Erlebach, T., Hall, A.: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In: Proc. 13th ACM-SIAM SODA, pp. 194–202 (2002)Google Scholar
  7. 7.
    Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 251–264. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Gandhi, R., Khuller, S., Kim, Y.A., Wan, Y.C.: Algorithms for minimizing response time in broadcast scheduling. Algorithmica 38(4), 597–608 (2004)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Jiang, S., Vaidya, N.: Scheduling data broadcasts to “impatient” users. In: Proc. ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 52–59 (1999)Google Scholar
  10. 10.
    Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 290–301. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science 325(3), 479–488 (2004)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    DirecPC Home Page,
  13. 13.
    Woeginger, G.J.: Online scheduling of jobs with fixed start and end times. Theoretical Computer Science 130, 5–16 (1994)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Zheng, F., Chin, F.Y.L., Fung, S.P.Y., Poon, C.K., Xu, Y.: A tight lower bound for job scheduling with cancellation. Information Processing Letters 97(1), 1–3 (2006)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Feifeng Zheng
    • 1
  • Stanley P. Y. Fung
    • 2
  • Wun-Tat Chan
    • 3
  • Francis Y. L. Chin
    • 3
  • Chung Keung Poon
    • 4
  • Prudence W. H. Wong
    • 5
  1. 1.School of ManagementXi’an JiaoTong UniversityChina
  2. 2.Department of Computer ScienceUniversity of LeicesterUnited Kingdom
  3. 3.Department of Computer ScienceThe University of Hong KongHong KongChina
  4. 4.Department of Computer ScienceCity University of Hong KongChina
  5. 5.Department of Computer ScienceUniversity of LiverpoolUnited Kingdom

Personalised recommendations