Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues
- 1 March 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 18 (04) , 952-990
- https://doi.org/10.1017/s0001867800016232
Abstract
A classical result in queueing theory states that in the stable M/G/1 queue, the stationary distribution W(x) of the waiting time of an arriving customer or of the virtual waiting time satisfies a linear Volterra integral equation of the second kind, of convolution type. For many variants of the M/G/1 queue, there are corresponding integral equations, which in most cases differ from the Pollaczek–Khinchin equation only in the form of the inhomogeneous term. This leads to interesting factorizations of the waiting-time distribution and to substantial algorithmic simplifications. In a number of priority queues, the waiting-time distributions satisfy Volterra integral equations whose kernel is a functional of the busy-period distribution in related M/G/1 queues. In other models, such as the M/G/1 queue with Bernoulli feedback or with limited admissions of customers per service, there is a more basic integral equation of Volterra type, which yields a probability distribution in terms of which the waiting-time distributions are conveniently expressed. For several complex queueing models with an embedded Markov renewal process of M/G/1 type, one obtains matrix Volterra integral equations for the waiting-time distributions or for related vectors of mass functions. Such models include the M/SM/1 and the N/G/1 queues, as well as the M/G/1 queue with some forms of bulk service. When the service-time distributions are of phase type, the numerical computation of waiting-time distributions may commonly be reduced to the solution of systems of linear differential equations with constant coefficients.Keywords
This publication has 29 references indexed in Scilit:
- Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacityPublished by Elsevier ,2011
- A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up timesJournal of Applied Probability, 1985
- Technical Note—A Note on the M/G/1 Queue with Server VacationsOperations Research, 1984
- Stationary queue-length and waiting-time distributions in single-server feedback queuesAdvances in Applied Probability, 1984
- A service system with two stages of waiting and feedback of customersJournal of Applied Probability, 1984
- A service model in which the server is required to search for customersJournal of Applied Probability, 1984
- On the use of phase type distributions in reliability modelling of systems with two componentsOR Spectrum, 1981
- Queues with Periodic Service and Changeover TimeOperations Research, 1972
- Time dependence of queues with semi-Markovian servicesJournal of Applied Probability, 1967
- Markov Renewal Processes with Finitely Many StatesThe Annals of Mathematical Statistics, 1961