time and space priority in a partially shared priority queue
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.
time and space priority partial buffer sharing queueing theory matrix analytic methods