Designing file systems for digital video and audio
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
A statistical admission control algorithm for multimedia servers
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Operating system support for multimedia applications
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Architectures for Personalized Multimedia
IEEE MultiMedia
Cost Analyses for VBR Video Servers
IEEE MultiMedia
OVID: Design and Implementation of a Video-Object Database System
IEEE Transactions on Knowledge and Data Engineering
Value-cognizant Speculative Concurrency Control
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Algorithms for designing multimedia servers
Computer Communications
A multimedia storage system for on-demand playback
IEEE Transactions on Consumer Electronics
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Numerical analysis of content distribution method for content delivery networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Investigation of the multimedia adaptive threshold strategy for mobile integrated services networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Heuristics for QoS maintenance: adaptive policies in differentiated services wireless networks
ACM SIGMETRICS Performance Evaluation Review
Adaptive admission control algorithm in a QoS-aware Web system
Information Sciences: an International Journal
Hi-index | 0.00 |
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the QoS requirements of the existing requests in the system. Most admission control algorithms treat every request uniformly and hence optimize the system performance by maximizing the number of admitted and served requests. In practice, requests might have different levels of importance to the system. Requests offering high contribution or reward to the system performance deserve priority treatment. Failure of accepting a high-priority request would incur high penalty to the system.A novel threshold-based admission control algorithm with negotiation for two priority classes of requests is proposed in our previous study. The server capacity is divided into three partitions based on the threshold values: one for each class of requests and one common pool shared by two classes of requests. Reward and penalty are adopted in the proposed system model. High-priority requests are associated with higher values of reward as well as penalty than low-priority ones. In this paper, given the characteristics of the system workload, the proposed analytical models aim to finds the best partitions, optimizing the system performance based on the objective function of the total reward minus the total penalty. The negotiation mechanism reduces the QoS requirements of several low-priority clients, by cutting out a small fraction of the assigned server capacity, to accept a new high-priority client and to achieve a higher net earning value. Stochastic Petri-Net model is used to find the optimal threshold values and two analytical methods are developed to find sub-optimal settings. The experiment results show that the sub-optimal solutions found by the proposed analytical methods are very close to optimal ones. The methods enable the algorithm to dynamically adjust the threshold values, based on the characteristics of the system workload, to achieve higher system performance.