The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service

Customers arriving according to a Markovian arrival process are served at a single server facility. Waiting customers generate priority at a constant rate γ$\gamma$; such a customer waits in a waiting space of capacity 1 if this waiting space is not already occupied by a priority generated customer; else it leaves the system. A customer in service will be completely served before the priority generated customer is taken for service (non-preemptive service discipline). Only one priority generated customer can wait at a time and a customer generating into priority at that time will have to leave the system in search of emergency service elsewhere. The service times of ordinary and priority generated customers follow PH-distributions. The matrix analytic method is used to compute the steady state distribution. Performance measures such as the probability of n consecutive services of priority generated customers, the probability of the same for ordinary customers, and the mean waiting time of a tagged customer are found by approximating them by their corresponding values in a truncated system. All these results are supported numerically.     

Analysis of BMAP/G/1 Queue with Reservation of Service

Abstract

In this article, we study BMAP/G/1 queue with service time distribution depending on number of processed items. This type of queue models the systems with the possibility of preliminary service. For the considered system, an efficient algorithm for calculating the stationary queue length distribution is proposed, and Laplace–Stieltjes transform of the sojourn time is derived. Little's law is proved. An optimization problem is considered.     

Optimal multithreshold control for a BMAP/G/1 queue with N service modes

This paper deals with the problem of the optimal service rate control in the system with BMAP (Batch Markovian Arrival Process) arrival stream. An algorithm for the computation of the embedded stationary queue length distribution is developed. The procedure for the cost criteria calculation is elaborated for any fixed parameters of the multithreshold control policy. This revised version was published online in June 2006 with corrections to the Cover Date.     

Loss pattern of DBMAP/DMSP/1/K queue and its application in wireless local communications

This paper applies a matrix-analytical approach to analyze the packet loss pattern of finite buffer single server queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time Markovian service process (DMSP). The bursty nature of packet loss pattern will be examined by means of statistics with respect to alternating loss periods and loss distances. The loss period is the period that loss once it starts; loss distance refers to the spacing between the loss periods. All of the two related performance measurement are derived, including probability distributions of a loss period and a loss distance, average length of a loss period and a loss distance. Queueing systems of this type arise in the domain of wireless local communications. Based on the numerical analysis of such a queueing system, some performance measures for the wireless local communication are presented.     

Analyzing the finite buffer batch arrival queue under Markovian service process: GIX/MSP/1/N

We consider a batch arrival finite buffer single server queue with inter-batch arrival times are generally distributed and arrivals occur in batches of random size. The service process is correlated and its structure is presented through Markovian service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures, like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication systems, manufacturing system design, etc.      

A server backup model with Markovian arrivals and phase type services

We consider a finite capacity queueing system with one main server who is supported by a backup server. We assume Markovian arrivals, phase type services, and a threshold-type server backup policy with two pre-determined lower and upper thresholds. A request for a backup server is made whenever the buffer size (number of customers in the queue) hits the upper threshold and the backup server is released from the system when the buffer size drops to the lower threshold or fewer at a service completion of the backup server. The request time for the backup server is assumed to be exponentially distributed. For this queuing model we perform the steady state analysis and derive a number of performance measures. We show that the busy periods of the main and backup servers, the waiting times in the queue and in the system, are of phase type. We develop a cost model to obtain the optimal threshold values and study the impact of fixed and variable costs for the backup server on the optimal server backup decisions. We show that the impact of standard deviations of the interarrival and service time distributions on the server backup decisions is quite different for small and large values of the arrival rates. In addition, the pattern of use of the backup server is very different when the arrivals are positively correlated compared to mutually independent arrivals.     

Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process

We consider a finite-buffer single server queue with single (multiple) vacation(s) and Markovian arrival process. The service discipline is E-limited with limit variation (ELV). Several other service disciplines like, Bernoulli scheduling, nonexhaustive and E-limited service can be treated as special cases of the ELV service.     

Waiting time distribution of the MAP/D/k system in discrete time—a more efficient algorithm

We show that the discrete time MAP/D/k presented by Chaudhry et al. (Oper. Res. Lett. 30(3) (2002) 174) has a special structure which results in a simple and more efficient computational scheme than they have presented. Specifically, we show that the computational efforts for the matrix G at each iteration can be reduced from O(d³k³m³) to O(dk³m³) by rearranging the state space and then capitalizing on the resulting structure. This saving in computational effort is significant, especially when d is very large.     

The MAP/PH/N retrial queue in a random environment

We consider the MAP/PH/N retrial queue with a finite number of sources operating in a finite state Markovian random environment. Two different types of multi-dimensional Markov chains are investigated describing the behavior of the system based on state space arrangements. The special features of the two formulations are discussed. The algorithms for calculating the stationary state probabilities are elaborated, based on which the main performance measures are obtained, and numerical examples are presented as well.     

On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N

We consider a finite-buffer single-server queue with renewal input where the service is provided in batches of random size according to batch Markovian service process (BMSP). Steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs have been obtained along with some important performance measures. The model has potential applications in the areas of computer networks, telecommunication systems, and manufacturing systems, etc.      

Analysis of a Discrete-Time Queueing System with a Single Server and Heterogeneous Markovian Arrivals

We consider a discrete-time queueing system with a single deterministic server, heterogeneous Markovian arrivals and finite capacity. Most existing techniques model the queueing system using a direct bivariate Markov chain which requires a state space that grows rapidly as the number of customer types increases. In this paper, we define renewal cycles in terms of the input process and model the system occupancy level on each renewal cycle using a one-dimensional Markov chain. We derive the exact joint steady-state probability distribution of both states of input and system occupancy with a considerably reduced state space, which leads to the efficient calculation of overall/individual performance measures such as loss probability and average delay.     

BMAP/G/1/N queue with vacations and limited service discipline

We consider a finite buffer single server queue with batch Markovian arrival process (BMAP), where server serves a limited number of customer before going for vacation(s). Single as well as multiple vacation policies are analyzed along with two possible rejection strategies: partial batch rejection and total batch rejection. We obtain queue length distributions at various epochs and some important performance measures. The Laplace–Stieltjes transforms of the actual waiting time of the first customer and an arbitrary customer in an accepted batch have also been obtained.     

Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times

Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and only if its traffic intensity is less than one. The result implies that the BMAP/PH/s/s+K retrial queue with PH-retrial times and the corresponding BMAP/PH/s queue have the same condition for ergodicity, a fact which has been believed for a long time without rigorous proof. This paper also shows that the same condition is necessary and sufficient for two modified retrial queueing systems to be ergodic. In addition, conditions for ergodicity of two BMAP/PH/s/s+K retrial queues with PH-retrial times and impatient customers are obtained. This revised version was published online in June 2006 with corrections to the Cover Date.     

Waiting-Time Asymptotics for the M/G/2 Queue with Heterogeneous Servers

In this paper, we consider a c-server queuing model in which customers arrive according to a batch Markovian arrival process (BMAP). These customers are served in groups of varying sizes ranging from a predetermined value L through a maximum size, K. The service times are exponentially distributed. Any customer not entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed with parameter . Under a full access policy freed servers offer services to orbiting customers in groups of varying sizes. This multi-server retrial queue under the full access policy is a QBD process and the steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. Some interesting numerical examples are discussed.     

Analysis of the MAP/G a ,b /1/N Queue

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.     

On a risk model with Markovian arrivals and tax

A risk model with Markovian arrivals and tax payments is considered.When the insurer is in a profitable situation,the insurer may pay a certain proportion of the premium income as tax payments. First,t...     

On approximating higher order MAPs with MAPs of order two

We show that the autocorrelation sequence of interarrival times for a Markovian arrival process (MAP) of order two is geometric. We determine the set of feasible values for the autocorrelation decay parameter and the first two or three moments of the interarrival time distribution. A method is derived for matching these parameters to a MAP of order two and some numerical examples are included to illustrate approximating higher dimensional MAPs by two dimensional ones. The numerical examples have helped us pose important questions regarding the significance of correlation in a MAP of order two when it is used as input to a queueing model.     

The discrete-time MAP/PH/1 queue with multiple working vacations

We consider a discrete-time single-server queueing model where arrivals are governed by a discrete Markovian arrival process (DMAP), which captures both burstiness and correlation in the interarrival times, and the service times and the vacation duration times are assumed to have a general phase-type distributions. The vacation policy is that of a working vacation policy where the server serves the customers at a lower rate during the vacation period as compared to the rate during the normal busy period. Various performance measures of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period are derived. Through numerical experiments, certain insights are presented based on a comparison of the considered model with an equivalent model with independent arrivals, and the effect of the parameters on the performance measures of this model are analyzed.