Statistical multiplexing of VBR sources: a matrix-analytic approach
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
Discrete-time multiserver queues with priorities
Performance Evaluation
Performance analysis of a single-server ATM queue with a priority scheduling
Computers and Operations Research
Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy
Computers and Operations Research
A performance analysis of a discrete-time priority queueing system with correlated arrivals
Performance Evaluation
A matrix-analytic solution for the DBMAP/PH/1 priority queue
Queueing Systems: Theory and Applications
Modelling queue sizes in an expedited forwarding DiffServ router with service differentiation
Proceedings of the 4th International Conference on Queueing Theory and Network Applications
Performance of a partially shared priority buffer with correlated arrivals
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
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
A note on the discretization of Little's result
Operations Research Letters
| Hi-index | 0.00 |
This paper studies a finite-sized discrete-time priority queue. Arriving packets can be classified into two types: delay-sensitive (class-1) packets and loss-sensitive (class-2) packets. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. Packets of class 1 have absolute transmission priority over class-2 packets whereas the latter receive space priority as the partial buffer sharing acceptance policy is used. The concurrent use of time and space priority, each for different packets, raises some issues on the order of arrivals in a slot. This is resolved by adopting a string representation for sequences of arriving packets and by defining a probability measure on the set of such strings. Performance of this queueing system is then determined using matrix-analytic techniques. Finally, the impact of various system parameters is demonstrated in several numerical examples.