#### Abstract

We consider a single server queue with two types of customers. We propose a discipline of flexible priority in access that combines the features of randomization and the threshold type control. We introduce a new class of distributions, phase-type with failures () distribution, that generalizes the well-known phase-type () distribution to the case when failures can occur during service of a customer. The arrival flow is described by the marked Markovian arrival process. The service time distribution is of type with the parameters depending on the type of a customer. Customers of both types can be impatient. Behavior of the system is described by the multidimensional Markov chain. Problem of existence and computation of the stationary distribution of this Markov chain is discussed in brief as well as the problem of computation of the key performance measures of the system. Numerical examples are presented that give some insight into behavior of the system performance measures under different values of the parameters defining the strategy of customers access to service.

#### 1. Introduction

In this paper, we consider a single server queueing model of information transmission system with two types of customers. Type-1 customers can be queued into the buffer having an infinite capacity. The buffer for type-2 customers has a finite capacity. Such kind of systems quite often describes behavior of various telecommunication systems where type-1 customers are interpreted as delay tolerant and type-2 customers are interpreted as loss tolerant; see, for example, [1]. Existence of two types of customers causes the necessity of managing the discipline of customers access to the server. Popular disciplines are priority (preemptive or nonpreemptive) disciplines in which a priority is given to one of types and customers of another type have a chance to enter service only when the priority customers are absent in the system.

However, such disciplines are not appropriate when it is necessary to provide more fair access of customers to the server. In particular, in some real world systems, for example, the vehicular ad hoc networks (VANET) that use the IEEE 802.11p protocol, it is necessary to share the available access time between a Control Channel and Service Channels. The Control Channel is used for the periodical dissemination of control information (beaconing) and traffic safety related information event messages. The Service Channels are used to disseminate noncritical information for infotainment applications; see, for example, [2]. So it is necessary to alternate access to the server by two types of customers, which cannot be achieved via the classical priority discipline.

Aiming to provide more fairness in access of customers of different type to the server, in this paper, we do not assume existence of an explicit priority given to one of the types. Instead, we suggest randomized choice of a customer for service when both queues are not empty at a service completion epoch. Priority can be given to one of types implicitly by means of fixing higher probability of a choice for service. If we set equal probabilities of the choice of customers of different types for service, in probabilistic sense, we create good conditions for frequent alternation of the type of a customer in service. However, equal probabilities may be not reasonable when the intensities of two flows are quite different. So it is important to optimally choose the probability defining the randomized access. The problem becomes even more complicated if impatience of customers should be taken into account and customers of one type are more impatient than the customers of another type.

In the model under study, we account impatience of customers. Because type-2 customers can be dropped (lost) also due to their buffer overflow, additionally we assume that randomization does not work and type-2 customer is always chosen for service if the number of type-2 customers in the buffer exceeds some predefined threshold. To the best of our knowledge such type of mechanisms of customers access to service was not considered in the literature.

One of the popular distributions of service time in queueing literature (and information transmission time in telecommunications literature) is so-called phase-type () distribution. The class of distributions is dense (in the sense of a weak convergence) in the set of all probability distributions of nonnegative variables. Thus, the distribution is very general and can be used for approximation of an arbitrary distribution; see [3]. However, in real life systems during some phases of service (information transmission), the server may fail. The failure occurrence implies the loss of a customer or the necessity of complete repetition of its service or resuming service from the phase at which the failure occurred. The use of the classical distribution does not allow taking into account the failures during the service process effectively. In this paper, we introduce and apply extension of the distribution, which we call (phase-type with failures) distribution, that allows taking the failures into account.

Last but not least, we consider the model with quite complicated marked Markovian arrival process (); see [4]. Such arrival process of heterogeneous customers is much more complicated than the superposition of the stationary Poisson processes. But it allows taking into account the bursty correlated nature of information transmission processes in modern telecommunication networks.

The rest of the paper is organized as follows. The distribution is introduced and briefly analyzed in Section 2. Mathematical model of the queueing system under study is described in Section 3. Process of the system states is defined in Section 4. Its generator as a block matrix is written down. The problem of ergodicity of this process is discussed in brief and the algorithm for computation of stationary distribution of the system states is chosen. In Section 5, expressions for computation of various performance measures of the system based on the known stationary distribution of the system states are derived. In Section 6, results of numerical experiments are presented. Section 7 concludes the paper.

#### 2. Phase-Type with Failures (PHF) Distribution

In this paper, we consider the queueing model of information transmission system. We assume that errors can occur during the transmission (service of a customer), which can cause the loss of information (customer) or necessity of retransmission (repetition, in full or partial extent, of customer’s service). Thus, to formally describe the service process of an arbitrary customer with account of possible errors, we introduce essential extension of well-known distribution; see, for example, [5]. We call this new distribution (phase-type with failures) distribution. In defining distribution, Neuts has interpreted the time having such a distribution as some sequence of random times called phases, durations of which have an exponential distribution. By analogy, we define distribution as some sequence of random times called stages each of which, in turn, consists of a random number of phases. distribution can characterize different positive random variables, for example, interarrival, interretrial, and service times, in some queueing system. Because in this paper we will use this distribution to model the service time in the queueing model described in the next section, for easier interpretation, we will speak here about the type distribution of a service time.

The type distribution of a service time is defined by the continuous-time Markov chain , with a finite state space . The states are assumed to be transient. The initial state of the process at the service beginning moment (which coincides with the moment of the first stage beginning) is chosen among the transient states with probabilities defined by the entries of the stochastic row vector The sojourn time of the chain in the state , is exponentially distributed with the parameter After this time expires, with probability , , , , , the process transits to the state . The intensities of the transition between transient states of the process are defined by the subgenerator that is defined by its entries as follows:

The states and are the absorbing states transition which corresponds to the end of the current stage of the service. The transition to the absorbing state means the end of the stage and successful completion of customer’s service. The intensities of the transition to the absorbing state are defined by the entries of the column vector :

The transition to the absorbing state means the end of the stage of the service due to a failure occurrence. The intensities of the transition to the absorbing state are defined by the entries of the column vector : Note that After the transition to the absorbing state , the following three scenarios are possible: (i) with probability , service of a customer is completed and this customer leaves the system permanently without successful service (is lost); (ii) with probability , the next stage of service starts and the initial state of the process , is again chosen among the transient states with probabilities defined by the vector ; (iii) with probability , the next stage of service starts and the initial state of the process is chosen as the state from which the transition to the absorbing state occurred. In both scenarios (ii) and (iii), the intensities of transition of the process within the set of the transient states and to the absorbing states are the same as at the first stage of service.

So service of a customer finishes when either the process transits to the absorbing state (this customer is considered as successfully served) or the process transits, after some stage, to the absorbing state and scenario (i) is realized (the customer is lost). In interpretation of the service time as transmission time of some information unit (e.g., a file), scenario (ii) means the necessity of complete retransmission of the unit while scenario (iii) means its retransmission from some point where the error occurs.

Thus, the distribution is defined by the set consisting of the row vector , the matrix , the column vector , and the probabilities and , while the classical distribution is defined only by the row vector and the matrix . The pair is called in [5] an irreducible representation of distribution. distribution can be treated as the special case of when By analogy with [5] we call the set an irreducible representation of distribution.

Let us describe some properties of distribution.

Let be Laplace-Stieltjes Transform () of distribution with an irreducible representation

Lemma 1. *The LST is defined by formula where the column vector function is defined by formula where where means the diagonal matrix with the diagonal entries defined by the entries of the vector , where *

Proof of Lemma 1 is implemented based on the known probabilistic interpretation of . Let us assume that, independently of the system operation, some virtual stationary Poisson flow of some virtual events, sometimes called catastrophes, arrives. Let be the intensity of this flow.

We define as the column vector entries, of which have the meaning of the probability that catastrophe will not arrive during the rest of the time having distribution with an irreducible representation conditioned on the fact that at the given moment the underlying Markov chain of this distribution stays at the state

Using this probabilistic interpretation and formula of total probability, it is easy to derive formula from which and formula of total probability the statement of Lemma 1 immediately follows.

*Remark 2. *It can be noted that of distribution with an irreducible representation coincides with of a classical distribution with an irreducible representation It is well known for the classical distribution that its is easily calculated given the irreducible representation. However, the inverse problem, to restore the irreducible representation given the values of , is very complicated and does not have a unique solution, while, namely, the components of the irreducible representation are necessary to write down the generator of the Markov chain describing behavior of the states of some queueing system with service process. Analogously, the noted coincidence of of distribution with an irreducible representation with of a classical distribution with an irreducible representation does not imply that we can avoid introduction of distribution and substitute this distribution by the classical distribution.

Corollary 3. *The moments of distribution with an irreducible representation are calculated by formula In particular, the expectation is given by .*

Let be of the distribution of the service time which is finished successfully (probability that the service time is finished successfully and no catastrophe arrives during this time) and let be of the distribution of the service time that is finished by a customer loss (probability that the service time is finished by a customer loss and no catastrophe arrives during this time).

Lemma 4. *The s and are defined by formulas *

Proof of Lemma 4 uses similar arguments as the proof of Lemma 1.

Corollary 5. *The probability that an arbitrary service will be finished successfully and the probability that an arbitrary service will be finished by a customer’s loss are given by *

Corollary 6. *The average service times () of an arbitrary customer conditioned on the fact that it is known that service is finished successfully (is failed) are computed as follows: *

#### 3. Mathematical Model

We consider a single server queueing system with an infinite buffer and a finite buffer of capacity , the structure of which is presented in Figure 1.

Arrival of two types of customers is defined by the . This process is defined by the irreducible continuous-time Markov chain , having a finite state space . The sojourn time of the chain in the state is exponentially distributed with the parameter . After this time expires, with probability the chain jumps to the state without generation of customers, , or with probability it jumps to the state with generation of type- customer, , . Here notation means that takes the values in the set .

It is reasonable to store the set of numerous parameters, which characterize the , as the entries of the square matrices , defined as follows. The entry , , , of the matrix defines the intensity of transition of the process from the state to the state which is accompanied by arrival of type- customer. The modulus of the diagonal entry of the matrix defines intensity of departure of the process from the state . The nondiagonal entry , , , of the matrix defines the intensity of transition of the process from the state to the state which is not accompanied by arrival of any customer.

The matrix is the generator of the Markov chain . The average intensity of customers arrival (fundamental rate) is defined by the formula , where is the row vector of the stationary probabilities of the Markov chain . This vector is the unique solution to the system , Here and throughout this paper is a column vector of appropriate size consisting of 1’s, and is a row vector of appropriate size consisting of zeroes. The average intensity of type- customers arrival is defined by the formula .

We assume that the service times of type-1 and type-2 customers have distribution with the parameters depending on the type of a customer. Namely, we assume that parameters of distribution of service time of type-, , customers are given by the irreducible representation Let , be the number of transient states of underlying Markov chain of service process of type- customers.

If the server is idle during an arbitrary customer arrival epoch, the customer immediately starts service. If the server is busy during an arbitrary type- customer arrival epoch, this customer goes to the infinite buffer. If the server is busy during an arbitrary type- customer arrival epoch, this customer goes to the finite buffer of capacity . If this buffer is full, the customer is lost.

We assume the following strategy of choosing the customers for service. Let some probability , and threshold , be fixed. If, during the service completion epoch, there are customers in both buffers and the number of type-2 customers is less than or equal to , then type-1 customer is chosen for service with probability or type-2 customer occupies the server with the complimentary probability. If, during the service completion epoch, the number of type-2 customers is greater than , then type-2 customers are chosen for service. If one of the buffers is empty at the service completion epoch, service is provided to the customer from another buffer, if any, without randomization. Note that if or , then type-1 customer can be chosen for service only if type-2 customers are absent in the system. This means that type-2 customers have nonpreemptive priority over type-1 customers. If , then type-2 customers are chosen for service only if the number of such customers in the buffer exceeds the value . In other words, if the number of type-2 customers in the buffer does not exceed the threshold , type-1 customers have nonpreemptive priority over type-2 customers. Thus, the considered admission strategy is essentially more flexible than the strategy with nonpreemptive priority.

The customers in the buffers are assumed to be impatient; for example, each type- customer leaves the buffer after an exponentially distributed, with the parameter , amount of time due to the lack of service.

Let us analyze the stochastic process defining behavior of the described queueing model.

#### 4. Process of System States and Its Stationary Distribution

Let, during the epoch ,(i), be the number of type-1 customers in the buffer;(ii), be the state of the server ( when the server is idle, when the server is occupied by type-1 customer, and when the server provides service to type-2 customer);(iii), be the number of type-2 customers in the buffer;(iv), be the state of the underlying process of the ;(v) be the state of service process, .

The Markov chain , is the regular irreducible continuous-time Markov chain.

The Markov chain , has the following state space:

Let us introduce the following notations:(i) is the identity matrix and is a zero matrix of appropriate dimension. If it is necessary, dimension of the matrix is indicated by the suffix.(ii), .(iii) is the square matrix of size defined as follows: ; that is, is the diagonal matrix with the diagonal entries .(iv) is the square matrix of size with all zero entries except the entries , which are equal to 1.(v) is the square matrix of size with all zero entries except the entries , which are equal to 1.(vi) is the square matrix of size with all zero entries except the entries , which are equal to 1.(vii) is the square matrix of size with all zero entries except the entries , and which are equal to 1.(viii) is the column vector of size with all zero entries except the entry which is equal to 1.(ix), is the square matrix of size with all zero entries except the entries .(x) is the symbol of the Kronecker product of matrices; see, for example, [6].

Let us enumerate the states of the Markov chain in the lexicographic order and refer to the set of states of the chain having value of the first components of the Markov chain as* level *

Let be the generator of the Markov chain

Lemma 7. *The generator has the following block-three-diagonal structure: **The nonzero blocks , containing the intensities of the transitions from level to level have the following form: where where where *

Proof of the lemma is performed by means of analysis of the intensities of all possible transitions of the Markov chain during the time interval having infinitesimal length.

*Remark 8. *The Markov chain , belongs to the class of continuous-time asymptotically quasi-Toeplitz Markov chains (); see [7]. This is easily verified by means of checking all points of definition of given in [7].

Using results from [7], it is possible to show that if , the Markov chain is ergodic for any set of the system parameters.

Let us consider the case . In this case, the matrices and for do not depend on and have the following form:

Thus, in the case , the Markov chain , belongs to the class of continuous-time quasi-Toeplitz Markov chains () or quasi-birth-and-death processes; see [5].

It follows from [5] that the necessary and sufficient ergodicity condition of the quasi-birth-and-death process is the fulfillment of the inequality where the row vector is the unique solution to the following system of linear algebraic equations:

The ergodicity condition for the considered model is easily verified algorithmically. Finite system (20) of linear algebraic equation is solved on computer. Then, fulfillment of inequality (19) is checked.

If the ergodicity condition is fulfilled, then the following limits (stationary probabilities) exist:

Let us form the row vectors , , of these probabilities as follows:

It is well known that the probability vectors , satisfy the following system of linear algebraic equations: called equilibrium or Chapman-Kolmogorov equations. This system is infinite and the generator , generally speaking, does not possess Toeplitz-like property. So the system cannot be directly solved on computer. Such type of equations arises quite often in analysis of queues with impatient customers and retrial queueing systems. Usually in the literature they are solved by means of various truncation methods. Indeed, this system can be effectively solved by means of the numerically stable algorithm that is presented in [8].

#### 5. Performance Measures of the System

Having computed the vectors of the stationary probabilities , it is possible to compute a variety of the performance measures of the system.

The average number of customers in the system is computed by

The probability that the server is busy at an arbitrary moment is computed by

The probability that, at an arbitrary moment, the server provides service to type- customer is computed by

The probability that the server is idle at an arbitrary moment is computed by

The average number of type-1 customers in the buffer is computed by

The average number of type-2 customers in the buffer is computed by

The intensity , of the output flow of successfully served type- customers is computed by

The intensity , of the flow of type- customers that leave the system due to the failure occurrence is computed by

The loss probability of an arbitrary type- customer upon arrival due to the buffer overflow is computed by

The loss probability of an arbitrary type- customer due to impatience is computed by

The loss probability of an arbitrary type- customer due to impatience is computed by

The probability of an arbitrary type- customer loss due to a failure occurrence is computed by

The probability of an arbitrary type- customer loss is computed by

#### 6. Numerical Example

In the numerical example we assume that the finite buffer capacity is . The value of the threshold is set to be equal to 8.

The arrival process has the coefficient of correlation and the coefficient of variation and is defined by the matrices

The average arrival rate of this process is , the average arrival rate of type-1 customers is , and the average arrival rate of type-2 customers is .

The intensities of impatience of type- customers, , are and .

To illustrate importance of taking into account possible failures in the service process, let us consider two cases of service processes. In the first case, coded as , we assume that service of the customers is modelled by two phase-type service processes. Namely, we assume that the service time of type-1 customers is defined by the vector and the matrix . The mean service time is equal to The service time of type-2 customers is defined by the vector and the matrix . The mean service time is equal to .

In the second case, coded as , we assume that the service times of the customers have distributions with irreducible representations where and , are the same as in the first case and

Let us vary the parameter from 0 to 1 with the step 0.01.

Figures 2 and 3 illustrate the dependence of the loss probabilities and on the parameter .

The quite essential difference between values of the loss probability , , for case 1 when the service time has distribution and case 2 when the service time has distribution is worth noting, while the differences between the average service times are not so essential. For type-1 customer the average value of the service time having distribution is equal, as mentioned above, to 0.13333. The average value of the service time having distribution is equal to 0.14143 (the probability that an arbitrary service will be finished successfully is equal to 0.9914). For type-2 customer the average value of the service time having distribution is equal, as mentioned above, to 0.21582. The average value of service time having distribution is equal to 0.2307 (the probability that an arbitrary service will be finished successfully is equal to 0.9688).

Now, let us illustrate the dependence of the main performance measures of the system on the parameters and that define the strategy of customers access to the server. To this end let us consider the system with service time distribution of type-1 and type-2 customers defined above and vary the parameter from 0 to 1 with step 0.01 and the parameter from 1 to 10 with step 1.

Figures 4 and 5 illustrate the dependence of the loss probabilities and on the parameters and .

Figures 6 and 7 illustrate the dependence of the loss probabilities and on the parameters and .

Figures 8 and 9 illustrate the dependence of the loss probability and the probability on the parameters and .

As it is seen from Figures 4 and 5, the loss probability of type-1 customers decreases and the loss probability of type-2 customers increases with growth of the parameters and . This finding can be explained as follows. With increasing of and , type-1 customers are more often chosen for service, so they obtain the better conditions and the probability of their loss decreases. Since type-2 customers are competing for the server with type-1 customers, their loss probability grows. However we can see the opposite trend in Figures 6 and 7: the loss probability increases and the loss probability decreases with increasing of and . This can be explained as follows. When and are small, type-1 customers are rarely chosen for service and they are lost, basically, due to impatience before service. So the probability of an arbitrary type- customer loss due to a failure occurrence during its service is small. When the parameters and grow, the chance to start service for type-1 customer increases and the probability also increases. For type-2 customers, we see the opposite situation and the loss probability decreases with increasing of and .

As it is seen from Figure 8 the loss probability of an arbitrary type- customer upon arrival due to the buffer overflow essentially increases with increase of and . Due to this fact, the probability that the server is busy at an arbitrary moment that is presented in Figure 9 decreases with growth of and .

Let us introduce the value This value has the meaning of an average number of customers lost in the system per unit of time and may be considered as some kind of cost criterion of quality of the system operation. It is obvious that the value depends on the probability and the threshold that defines the strategy of customers access to the server; that is, .

Figure 10 illustrates the dependence of the values of the cost criterion on the parameters and .

The minimal value of the cost criterion is . So the admission control of customers can bring some profit even in terms of this trivial cost criterion. Note that variety of various optimization problems where the weighted sum of some performance measures should be minimized or maximized under restrictions imposed on the values of other performance measures can be formulated and solved based on the results of probabilistic analysis presented in this paper.

#### 7. Conclusion

We analyzed a queueing model with a single server which provides service for two types of customers. The system has a finite buffer for one type of customers and an infinite one for another type. Service to customers of the same type is provided according to first in-first out discipline. If both buffers are not empty at the moment of the service completion, a type of the next customer, which will be picked up for service, is defined randomly, if the number of customers in a finite buffer does not exceed some preassigned threshold. Errors can occur during service of customers. To simplify account of these errors, which may lead to a customer loss, repeated service, or partial repeated service, notion of phase-type distribution with failures () was introduced in this paper. Customers of both types are impatient. This queueing model can be used, for example, for approximating the process of information transmission using the protocol of time division between Control Channel and Service Channels. The stationary distribution of five-dimensional Markov chain defining the dynamics of the system is computed and expressions for the key performance measures of the system are derived. Results of numerical examples illustrating effect of parameters of customer’s admission strategy are presented.

#### Competing Interests

The authors declare that there are no competing interests regarding the publication of this paper.

#### Acknowledgments

The work is supported by Tomsk State University Competitiveness Improvement Program.