Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
A performance analysis of a discrete-time priority queueing system with correlated arrivals
Performance Evaluation
The impact of buffer finiteness on the loss rate in a priority queueing system
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Mixed Finite-/Infinite-Capacity Priority Queue with General Class-1 Service Times
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Performance analysis of priority queueing systems in discrete time
Network performance engineering
| Hi-index | 0.00 |
We consider a discrete-time queueing system with two priority classes and absolute priority scheduling. In our model, we capture potential correlation between the arrivals of the two priority classes. For practical use, it is required that the high-priority queue is of (relatively) small size and we hence use a model with finite high-priority queue capacity. We obtain expressions for the probability mass functions of the steady-state system content and delay of the high-priority class as well as for the probability generating functions and moments of the steady-state system content and delay of the low-priority class. The results are compared to those of a similar system, but with an infinite capacity for high priority packets, and it is shown that the latter can be inaccurate. We also investigate the effect of correlation between the arrivals of both priority classes on the performance of the system.