Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
Mixed Finite-/Infinite-Capacity Priority Queue with Interclass Correlation
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
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
| Hi-index | 0.00 |
This paper studies a single-server queue with two traffic classes in order to model Expedited Forwarding Per-Hop Behaviour in the Differentiated Services architecture. Generally, queueing models assume infinite queue capacity but in a DiffServ router the capacity for high priority traffic is often small to prevent this traffic from monopolizing the output link and hence causing starvation of other traffic. The presented model takes the exact (finite) high-priority queue capacity into account. Analytical formulas for system contents and packet delay of each traffic class are determined. This requires extensive use of the spectral decomposition theorem as the service time of a high-priority packet takes a general distribution, which complicates the analysis. Numerical examples indicate the considerable impact of the finite capacity on the system performance.