Amortized efficiency of list update and paging rules
Communications of the ACM
Designing file systems for digital video and audio
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Optimization of the grouped sweeping scheduling (GSS) with heterogeneous multimedia streams
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Note on scheduling intervals on-line
Discrete Applied Mathematics
Randomized algorithms
DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The storage and retrieval of continuous media data
Multimedia database systems
An online video placement policy based on bandwidth to space ratio (BSR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient on-line call control algorithms
Journal of Algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Load Balancing for Response Time
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Video File Allocation over Disk Arrays for Video-On-Demand
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
A Framework for the Storage and Retrieval of Continuous Media Data
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems
An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems
Admission control and routing: theory and practice
Admission control and routing: theory and practice
Quality of service specification for resource management in multimedia systems
Quality of service specification for resource management in multimedia systems
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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 (W/C) 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 ρ W C.