Skip to main content
SpringerLink
Log in

Broadcast Scheduling – Minimizing Average Response Time

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 78 Accesses

Years and Authors of Summarized Original Work

  • 2005; Bansal, Charikar, Khanna, Naor

  • 2008; Bansal, Coppersmith, Sviridenko

  • 2014; Bansal, Charikar, Krishnaswamy, Li

Problem Definition

In this entry, we consider the classical broadcast scheduling problem and discuss some recent advances on this problem. The problem is formalized as follows: there is a server which has a collection of unit-sized pages P = {1, …, n}. The server can broadcast pages in integer time slots in response to requests, which are given as the following sequence: at time t, the server receives \(w_{p}(t) \in \mathbb{Z}_{\geq 0}\) requests for each page p ∈ P. We say that a request ρ for page p that arrives at time t is satisfied at time c p (t) if c p (t) is the first time after t by which the server has completely transmitted page p. The response time of the request ρ is defined to be c p (t) − t, i.e., the time that elapses from its arrival till the time it is satisfied. Notice that by definition, the response time...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Bansal N, Charikar M, Khanna S, Naor J (2005) Approximating the average response time in broadcast scheduling. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, Vancouver

    Google Scholar 

  2. Bansal N, Charikar M, Krishnaswamy R, Li S (2014) Better algorithms and hardness for broadcast scheduling via a discrepancy approach. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, Portland

    Google Scholar 

  3. Bansal N, Coppersmith D, Sviridenko M (2008) Improved approximation algorithms for broadcast scheduling. SIAM J Comput 38(3): 1157–1174

    Article  MathSciNet  MATH  Google Scholar 

  4. Bansal N, Krishnaswamy R, Nagarajan V (2010) Better scalable algorithms for broadcast scheduling. In: Automata, languages and programming (ICALP), Bordeaux, pp 324–335

    Google Scholar 

  5. Erlebach T, Hall A (2002) NP-hardness of broadcast scheduling and inapproximability of singlesource unsplittable min-cost flow. In: Proceedings of the 13th ACM-SIAM symposium on discrete algorithms, San Francisco, pp 194–202

    Google Scholar 

  6. Im S, Moseley B (2012) An online scalable algorithm for average flow time in broadcast scheduling. ACM Trans Algorithms (TALG) 8(4):39

    MathSciNet  MATH  Google Scholar 

  7. Lovett S, Meka R (2012) Constructive discrepancy minimization by walking on the edges. In: 53rd annual IEEE symposium on foundations of computer science (FOCS), New Brunswick, pp 61–67

    Google Scholar 

  8. Newman A, Neiman O, Nikolov A (2012) Beck’s three permutations conjecture: a counterexample and some consequences. In: 2012 IEEE 53rd annual symposium on foundations of computer science (FOCS), New Brunswick. IEEE, APA

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Princeton University, Princeton, NJ, USA

    Ravishankar Krishnaswamy

Authors
  1. Ravishankar Krishnaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ravishankar Krishnaswamy .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Krishnaswamy, R. (2016). Broadcast Scheduling – Minimizing Average Response Time. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_538

Download citation

Publish with us

Policies and ethics

Search

Navigation