We consider two scheduling problems in a broadcast setting. The first problem is that of minimizing the average response time of requests. For the offline version of this problem we give an algorithm with an approximation ratio of O (log2(T +n)), where n is the total number of pages and T is the time horizon (arrival time of the last request). This substantially improves the previously best known approximation factor of O ( ) for the problem [3].
Our second result is for the throughput maximization version of the broadcast scheduling problem. Here each request has a deadline and the goal is to satisfy the maximum number of requests by their deadlines. We give an algorithm with an approximation ratio of 5/6. This improves the previously best known approximation guarantee of 3/4 for the problem. [10].
By: Nikhil Bansal; Don Coppersmith; Maxim Sviridenko
Published in: RC23468 in 2004
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .