Two-server queue with one server idle below a threshold
Queueing Systems: Theory and Applications
Multi-server threshold queues with hysteresis
Performance Evaluation
Bounding of performance measures for a threshold-based queueing system with hysteresis
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stochastic complement analysis of multi-server threshold queues with hysteresis
Performance Evaluation
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Perspective on Iterative Methods for the Approximate Analysis of Closed Queueing Networks
Proceedings of the International Workshop on Computer Performance and Reliability
Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services
IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
Control of a Heterogeneous Two-Server Exponential Queueing System
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
In this paper, we consider performance evaluation of a system which shares K servers (or resources) among N heterogeneous classes of workloads, where server allocation and deallocation for class i is dictated by a class specific threshold-based policy with hysteresis control. In particular, the server activation time for class i is noninstantaneous. There are many systems and applications where a multiclass threshold-based queueing system can be of great use. One important utility of using threshold-based approaches is in situations where applications may incur server usage costs. In these cases, one needs to consider not only the performance aspects but also the resulting cost/performance ratio. The motivation for using hysteresis control is to reduce the unnecessary cost of server setup (or activation) and server removal (or deactivation) whenever there are momentary fluctuations in workload. Moreover, servers in such systems and applications are often needed by multiple classes of workloads and, hence, it is desirable to find good approaches to sharing server resources among the different classes of workloads, preferably without statically partitioning the server pool among these classes. An important and distinguishing characteristic of our work is that we consider the modeling and analysis of a multiclass system with noninstantaneous server activation. The main contributions of this work are 1) in developing an efficient approximation method for solving such models, 2) in verifying the convergence of our iterative method, and 3) in evaluating the resulting accuracy of the technique for computing performance measures of interest, which can subsequently be used in making system design choices.