Beat the clock: a multiple attribute approach for scheduling data broadcast
Proceedings of the 4th ACM international workshop on Data engineering for wireless and mobile access
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
A tight analysis of most-requested-first for on-demand data broadcast
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider a communication problem, in which requests for data items arrive from time to time via a terrestrial network and at each broadcast tick the single server chooses a data item to broadcast via a satellite downlink to satisfy all the requests for the item. The goal of the server is to minimize the total wait time of the requests. In this paper, we examine two well-known on-line algorithms used by the server to decide which data item to broadcast at each broadcast tick. In particular, we present complete competitive analysis of the algorithms, a research aspect of the problem which had not been studied before. Our results are consistent with observations obtained by simulation experiments reported in past literature. In addition, we prove a general lower bound to the competitive ratios of all online algorithms. The competitive ratios obtainedfor the two on-line algorithms in fact match our general lower bound, indicating the optimality of the algorithms.