On the Analysis of the M Geo/M Geo/1/N Queue with Batch Poisson Arrivals and Service Completions (original) (raw)
Related papers
Analyzing discrete-time bulk-serviceGeo/Geob/mqueue
Rairo-operations Research, 2006
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival-and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution in the queue have also been discussed. Finally, it is shown that in limiting case the results obtained in this paper tend to the continuous-time counterpart.
On the Geo/D/1 and Geo/D/1/n queues
Performance Evaluation, 1990
A discrete-time single server FIFO queue with Bernoulli arrivals and deterministic service times is studied. Both the finite capacity queue and the infinite capacity queue are investigated. The state of the system is observed at entry time and at the end of an arbitrary time slot. The closed-form expressions for the steady-state distributions of the queue length and of the unfinished work in system ( i.e. waiting time ) are obtained. The method of analysis, using Lindley's equation, naturally arises in case of deterministic service times
Maximum entropy analysis for G/G/1 queuing system
International Journal of Engineering, Transactions B: Applications
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arrival time is equal to one, the average queue length provided tallies with the results for M/G/1 model. Other particulars cases have also been deduced which match with already existing results.
Some practical considerations on multi-server queues with multiple poisson arrivals
Omega, 1978
A simple approximate formula is presented and evaluated in this paper for the steady-state average number of customers in the M(~)/G/r queueing system. The derivation of the formula is based on a heuristic argument. Comparisons between approximate results and the ones obtained analytically or by extensive simulation experiments seem to suggest that the degree of approximation achieved is satisfactory for most practical purposes.
Journal of Probability and Statistics
This paper presents analytically explicit results for the distribution of the number of customers served during a busy period for special cases of the M/G/1 queues when initiated with m customers. The functional equation for the Laplace transform of the number of customers served during a busy period is widely known, but several researchers state that, in general, it is not easy to invert it except for some simple cases such as M/M/1 and M/D/1 queues. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We obtain the distribution of the number of customers served during a busy period for various service-time distributions such as exponential, deterministic, Erlang-k, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. Further, we also provide computational results using our method. The derivations are very fast and ...
Analyzing the discrete-time multiserver queue Geom/Geom/m queue with late and early arrivals
In this paper, we present analyses of discrete-time multiserver queue with inter-arrival and service times geometrically distributed. Two v ariants of the model (i) late-arrival system with delayed access and (ii) early arrival systems, are discussed. It is shown that the results for continuous-time multiserver queue can also be obtained as a limiting case of discrete time. Some numerical results have also been presented.
Performance analysis of discrete time bulk service queuing model nb (l,k)/geo/1
International Journal of Recent Scientific Research, 2017
The present paper is an attempt to explore a discrete-time queueing models which is suitable for the performance evaluation of Asynchronous Transfer Mode (ATM) multiplexers and switches. In these models, the time axis is divided into fixed-length slots and the service of a customer must start and end of slot boundaries. Most analytical studies of discrete-time queues assume constant service times equal to one slot, an infinite buffer capacity and/or uncorrelated arrival process. A discrete time bulk service rule (,), the inter arrival time are assumed to be independent and identically distributed random variable follows negative binomial distribution. The time arrival between the consecutive arrivals of customers is described in terms of a discrete probability mass function (p.m.f) (); () is the probability of having an interval of an integer number of x time units between the arrival customer number n and customer number n+1. The service time of customers n is given in terms of a discrete p.m.f () follows geometric distribution. The arrival and service are independent and identically distributed (i.i.d). The arrival of customer in First In First Out (FIFO) order. One server transports packets in batches of size minimum L packets and maximum K. The steady state analysis for the considered queuing system is presented and the generating functions of the number of customers in the system are obtained. We also obtained the closed form of expressions for some performance measures of the system.
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.
American Journal of Mathematical and Management Sciences
Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content. This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden.