Throughput-competitive admission control for continuous media databases
Minos Garofalakis, Yannis Ioannidis, Banu Özden, Avi Silberschatz · 1998
Multimedia applications require a guaranteed level of service for accessing Continuous Media (CM) data, such asvideo and audio. To obtain such guarantees, the database server where the data is residing must employ an admission control scheme to limit the number of clients that can be served concurrently. We investigate the problem of on-line admission control where the decision on whether to accept or reject a request must be made without any knowledge about future requests. Employing competitive analysis techniques, we address the problem in its most general form with the following key contributions: (1) we prove a tight upper bound on the competitive ratio of the conventional Work-Conserving (WC) policy, showing that it is within a factor 1+ of the 1; optimal clairvoyant strategy that knows the entire request