Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling

Free registration required

Executive Summary

The authors consider online algorithms in pull-based broadcasting. In this model there are n pages (representing some form of useful information) available at a server and clients request a page that they are interested in. When the server transmits a page p, all outstanding requests for that page p are satisfied since it is assumed that all clients can simultaneously receive the information. It is in this respect that broadcast scheduling differs crucially from standard scheduling where each job needs its own service from the server. They distinguish two cases: all the pages are of same size (unit-size without loss of generality) and when the pages can be of different size. Broadcast scheduling is motivated by several applications in wireless and LAN based systems.

  • Format: PDF
  • Size: 169.56 KB