Hard deadline queueing system with application to unified messaging service
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Optimal control of parallel queues with impatient customers
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
An overhead and resource contention aware analytical model for overloaded web servers
WOSP '07 Proceedings of the 6th international workshop on Software and performance
An overhead and resource contention aware analytical model for overloaded Web servers
Journal of Systems and Software
Analytical architecture-based performability evaluation of real-time software systems
Journal of Systems and Software
Thermal analysis of periodic real-time systems with stochastic properties: an analytical approach
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
We study queuing systems where customers have strict deadlines until the end of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/1+G models with ordered service. These are single-server queues with state-dependent Poisson arrival process, exponential service times, FCFS service discipline, and general customer impatience. We derive a closed-form solution for the conditional probability density function of the offered sojourn time, given the number of customers in the system. This is a novel result that has not been known before. Using this result, we show how the probability measure induced by the offered sojourn time is computed, and consequently how performance measures such as the probability of missing deadline and the probability of blocking are obtained. This is further illustrated through a numerical example.