Delay analysis of a queue with re-sequencing buffer and Markov environment (original) (raw)
Related papers
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
Queueing Systems
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-known M APIGII queue by allowing dependencies between interarrival and service times. The waiting time process is directly analyzed by solving Lindley's equation by transform methods. The Laplace Stieltjes transforms (LST) of the steady-state waiting time and queue length distribution are both derived, and used to obtain recursive equations for the calculation of the moments. Numerical examples are included to demonstrate the effect of the auto-correlation of and the cross-correlation between the inter-arrival and service times.
Transient analysis of non-markovian queues via markov regenerative processes
1996
In this chapter, we develop computational techniques for the time-dependent solution of the queue length distribution for a class of non-Markovian queueing systems. The class of systems we consider are those for which the queue length process is Markov regenerative. We consider standard single server nite capacity queues such as the M/G/1/K and the GI/M/1/K queues. We also show how these algorithms can be extended to more general arrival processes such as the Batch Markovian Arrival Process (BMAP) and to multiclass queueing systems.
Calculation of delay characteristics for multiserver queues with constant service times
European Journal of Operational Research, 2009
We consider a discrete-time infinite-capacity queueing system with a general uncorrelated arrival process, constant-length service times of multiple slots, multiple servers and a first-come-first-served queueing discipline. Under the assumption that the queueing system can reach a steady state, we first establish a relationship between the steady-state probability distributions of the system content and the customer delay. Next, by means of this relationship, an explicit expression for the probability generating function of the customer delay is obtained from the known generating function of the system content, derived in previous work. In addition, several characteristics of the customer delay, namely the mean value, the variance and the tail distribution of the delay, are derived through some mathematical manipulations. The analysis is illustrated by means of some numerical examples.
Analysis of MAP/M/2/K queueing model with infinite resequencing buffer
Performance Evaluation, 1998
We consider a MAP/Mj2/K queueing model in which messages should leave the system in the order in which they entered into the system. In the case of infinite resequencing buffer, the steady-state probability vector is shown to be of matrix-geometric type. The total sojourn time of an admitted message into the system is shown to be of phase type. Efficient algorithmic procedure:; for computing various performance measures are given, and some interesting numerical examples are discussed. 0 1998 Elsl:vier Science B.V.
Analysis of the MAP/Ga, b/1/N Queue
Queueing Systems - Theory and Applications - QUESTA, 2001
The Markovian arrival process (MAP) is used to represent the bursty and correlated traffic arising in modern telecommunication network. In this paper, we consider a single server finite capacity queue with general bulk service rule in which arrivals are governed by MAP and service times are arbitrarily distributed. The distributions of the number of customers in the queue at arbitrary, post-departure and pre-arrival epochs have been obtained using the supplementary variable and the embedded Markov chain techniques. Computational procedure has been given when the service time distribution is of phase type.
Analyzing state-dependent arrival in GI/BMSP/1/∞ queues
Mathematical and Computer Modelling, 2011
We consider an infinite-buffer single-server queue with renewal input. The service to the queueing system is provided in batches of random size, according to a batch Markovian service process (BMSP). The queue length distribution of the number of customers in the system at pre-arrival and arbitrary epochs has been obtained along with some important performance measures, such as the mean number of customers in the system and the mean system sojourn time of a customer. Secondly, we study a similar queueing system with queue-length-dependent inter-arrival times and obtain the abovementioned state probabilities and performance measures. These queueing models have potential applications in the areas of computer networks, telecommunication systems, manufacturing systems, etc.
Relationship between Delay and System Contents in Multiserver Queues with Geometric Service Times
In this paper, we consider a discrete-time multiserver queueing system with inÞnite buer size, geometric service times and a FCFS (Þrst-come-Þrst-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn't require knowledge of the exact nature of the arrival process. By means of the relationship, results for the characteristics of the system contents for various discrete-time queueing models can be transformed into corresponding results for the delay characteris- tics, thus making a separate delay analysis superßuous.
Complete analysis of finite and infinite buffer queue—A computational approach
Operations Research Letters, 2007
We consider a finite buffer single server queue with renewal input and Markovian service process. System length distribution at pre-arrival and arbitrary epochs have been obtained along with some important performance measures. The corresponding infinite buffer queue has also been analyzed.
European Journal of Operational Research, 2006
This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. For such systems, we derive a relationship between the probability generating functions of the system content during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is valid regardless of the nature of the arrival process. From this relationship we derive a relationship between the first-and second-order moments of the distributions involved. It is shown that the relationship also applies to subsystems of the queueing system being discussed, and to the waiting time and queue content of a multi-server queueing system with geometric service times and uninterrupted servers.
Analysis of an MAP/PH/1 queue with flexible group service
International Journal of Applied Mathematics and Computer Science, 2017
A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stiel...