Classification of Markov chains describing the evolution of random strings

We consider LIFO queue with several customer types, batch arrival and batch services. We get necessary and sufficient conditions for this queue to be ergodic, null recurrent and transient. These are given in terms of positive solutions of finite system of equations pi = Fi(p1, ..., pk), i = 1, ..., k, where Fi are polynomials with positive coefficients

Near-Optimal Switching Strategies for a Tandem Queue

textabstractMotivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible, without compromising the total system delay (i.e. avoiding starvation of the second queue). The balance between these objectives is governed by a linear cost function of the queue lengths. In the first model, the server in the first queue can be either switched on or off, depending on the queue lengths of both queues. This model has been studied extensively in the literature. Obtaining the optimal control is known to be computationally intensive and time consuming.We are particularly interested in the scenario that the first queue can operate at larger service speed than the second queue. This scenario has received less attention in literature. We propose an approximation using an efficient mathematical analysis of a near-optimal threshold policy based on a matrix-geometric solution of the stationary probabilities that enables us to compute the relevant stationary measures more efficiently and determine an optimal choice for the threshold value. In some of our target applications, it is more realistic to see the first queue as a (controllable) batch-server system. We follow a similar approach as for the first model and obtain the structure of the optimal policy as well as an efficiently computable near-optimal threshold policy. We illustrate the appropriateness of our approximations using simulations of both models

Classification of Markov chains describing the evolution of random strings

Programme 1 : Architectures paralleles, bases de donnees, reseaux et systemes distibuesSIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1993 n.2022 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc