Skip to main content
SpringerLink
Log in

Scheduling Broadcasts with Deadlines

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2697))

Included in the following conference series:

Abstract

We investigate the problem of scheduling broadcasts in data delivering systems via broadcast, where a number of requests from several clients can be simultaneosly 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 conserned 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Aacharya and S. Muthukrishnan. Scheduling on-demand broadcasts: new metrics and algorithms. In ACM/IEEE International Conference on Mobile Computing and Networking, pages 43–54, 1998.

    Google Scholar 

  2. D. Aksoy and M. Franklin. Scheduling for large scale on-demand data broadcast. In Proc. of IEEE INFOCOM, pages 651–659, 1998.

    Google Scholar 

  3. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proc. of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 558–559, 2000.

    Google Scholar 

  4. J. Edmonds and K. Pruhs. Broadcast scheduling: when fairness is fine. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 421–430, 2002.

    Google Scholar 

  5. T. Erlebach and A. Hall. Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 194–202, 2002.

    Google Scholar 

  6. R. Gandhi, S. Khuller, Y. A. Kim, and Y. C. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proc. of 9th International Integer Programming and Combinatorial Optimization (IPCO) Conference, volume 2337 of Lecture Notes in Computer Science (LNCS), pages 425–438. Springer-Verlag, 2002.

    Google Scholar 

  7. S. Jiang and N. Vaidya. Scheduling data broadcasts to “impatient” users. In Proc. of the ACM International Workshop on Data Engineering for Wireless and Mobile Access, pages 52–59, 1999.

    Google Scholar 

  8. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 290–301. Springer-Verlag, 2000.

    Google Scholar 

  9. B. Kalyanasundaram and M. Velauthapillai. Broadcast scheduling under deadline. private communication, 2003.

    Google Scholar 

  10. R. Lipton and A. Tomkins. Online interval scheduling. In Proc. of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302–311, 1994.

    Google Scholar 

  11. DirecPC Home Page. http://www.direcpc.com/.

    Google Scholar 

  12. J. Sgall. Online scheduling. In Online Algorithms: The State of the Art, eds. A. Fiat and G. J. Woeginger, volume 1442 of Lecture Notes in Computer Science (LNCS), pages 196-231. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  13. M. van den Akker, H. Hoogeven, and N. Vakhania. Restarts can help in the online minimization of the maximum delivery time on a single machine. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 427–436. Springer-Verlag, 2000.

    Google Scholar 

  14. Gerhard J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130:5–16, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Pusan University of Foreign Studies, Pusan, 608-738, Korea

    Jae-Hoon Kim

  2. Department of Electrical Engineering & Computer Science, Korea Advanced Institute of Science and Technology, Taejon, 305-701, Korea

    Kyung-Yong Chwa

Authors
  1. Jae-Hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyung-Yong Chwa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, JH., Chwa, KY. (2003). Scheduling Broadcasts with Deadlines. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation