Affordable Access

Publisher Website

Competitive On-line Scheduling of Continuous-Media Streams

Authors
Journal
Journal of Computer and System Sciences
0022-0000
Publisher
Elsevier
Volume
64
Issue
2
Identifiers
DOI: 10.1006/jcss.2001.1799
Keywords
  • Multimedia Databases
  • Resource Scheduling
  • Admission Control
  • On-Line Algorithms
  • Competitive Analysis

Abstract

Abstract Multimedia applications require a guaranteed level of service for accessing continuous-media data. To obtain such guarantees, the database server where the data are 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 of 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+Δ1−ρ of the optimal clairvoyant strategy, where Δ is the ratio of the maximum to minimum request length (i.e., time duration), and ρ is the maximum fraction of the server's bandwidth that a request can demand; (2) we prove a lower bound of Ω(logΔ1−ρ) on the competitive ratio of any deterministic or randomized admission control scheme, demonstrating an exponential gap between greedy and optimal on-line solutions; (3) we propose simple deterministic schemes based on the idea of bandwidth prepartitioning that guarantee competitive ratios within a small constant factor of logΔ (i.e., they are provably near-optimal) if ρ<1/⌈logΔ⌉; and (4) we introduce a novel admission control policy that partitions the server bandwidth based on the expected popularities of different request lengths and experimentally demonstrate its benefits compared to WC.

There are no comments yet on this publication. Be the first to share your thoughts.