Partially shared buffers with full or mixed priority

Abstract

This paper studies a finite-sized discrete-time two-class priority queue. 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. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.

Performance analysis of space–time priority queues

“…[13] where different types of buffer sharing strategies are compared. The combination of partial buffer sharing and time priority is studied in [14] for a discrete-time queue with batch-Markovian arrivals where the priority class gets both time and space priority and in [15] where one class gets time priority while the other gets space priority. A similar system is studied in [16] for continuous-time queues with phase-type service times, again giving space and time priority to different classes.…”

A Space Merging Approach to the Analysis of the Performance of Queueing Models with Finite Buffers and Priority Jumps

“…Let us briefly consider the works in which similar problems are investigated. First, note that during the last decade, new types of priority schemes, which are called multiple priorities, have been intensively investigated (Demoor et al, 2011;Kim et al, 2007;Lee and Choi, 2001;Melikov et al, 2006). Unlike the classical priority scheme, multiple priorities pertaining to real-time calls have high time priorities and low space priorities, and non-real-time calls have low time priorities and high space priorities.…”