Hostname: page-component-84b7d79bbc-g5fl4 Total loading time: 0 Render date: 2024-07-25T23:28:41.976Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues

Published online by Cambridge University Press:  01 July 2016

Marcel F. Neuts
Marcel F. Neuts*
Affiliation:
The University of Arizona
*
∗Postal address: Dept of Systems and Industrial Engineering, University of Arizona, Tucson, A2 85721, USA
Get access Rights & Permissions [Opens in a new window]

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

QUEUEING THEORYWAITING-TIME DISTRIBUTIONCOMPUTATIONAL PROBABILITY
Type
Research Article
Information
Advances in Applied Probability , Volume 18 , Issue 4 , December 1986 , pp. 952 - 990
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Ackroyd, M. H. and Kanyangarara, R. (1982) Skinner&s method for computing bounds on distributions and the numerical solution of continuous-time queueing problems. IEEE Trans. Comm. COM-30, 1746–1749.CrossRefGoogle Scholar
2. Ali, O. M. E. and Neuts, , (1984) A service system with two stages of waiting and feedback of customers. J. Appl. Prob. 21, 404–413.Google Scholar
3. Boxma, O. J. (1984) Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity. Euro. J. Operat. Res. 16, 246–256.Google Scholar
4. Çinlar, E. (1967) Time dependence of queues with semi-Markovian service. J. Appl. Prob. 4, 356–364.Google Scholar
5. Cohen, J. W. (1976) On Regenerative Processes in Queueing Theory. Lecture Notes in Economic and Mathematical Systems 121, Springer-Verlag, New York.Google Scholar
6. Disney, R. L., König, D. and Schmidt, V. (1984) Stationary queue-length and waiting-time distributions in single-server feedback queues. Adv. Appl. Prob. 16, 437–446.Google Scholar
7. Doshi, B. T. (1985) A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times. J. Appl. Prob. 22, 419–428.Google Scholar
8. Eisenberg, M. (1972) Queues with periodic service and changeover times. Operat. Res. 20, 440–451.Google Scholar
9. Fuhrmann, S. W. (1984) A note on the M/G/1 queue with server vacations. Operat. Res. 32, 1368–1373.Google Scholar
10. Fuhrmann, S. W. and Cooper, R. B. (1985) Stochastic decompositions in the M/G/l queue with generalized vacations. Operat. Res. 33, 1117–1129.Google Scholar
11. Gross, D. and Harris, C. M. (1985) Fundamentals of Queueing Theory , 2nd edn. Wiley, New York.Google Scholar
12. Halfin, S. (1972) Steady-state distribution for the buffer content of an M/G/1 queue with varying service rate. SIAM J. Appl. Math. 23, 356–363.CrossRefGoogle Scholar
13. Halfin, S. and Segal, M. (1972) A priority queueing model for a mixture of two types of customers. SIAM J. Appl. Math. 23, 369–379.Google Scholar
14. Heimann, D. and Neuts, M. F. (1973) The single server in discrete time–Numerical analysis IV. Naval Res. Logist. Quart. 20, 753–766.CrossRefGoogle Scholar
15. Heyman, D. P. (1977) The T-policy for the M/G/1 queue. Management Sci. 23, 775–778.Google Scholar
16. Jagerman, D. (1985) Certain Volterra integral equations arising in queueing. Stoch. Models 1,Google Scholar
17. Jaiswal, N. K. (1968) Priority Queues. Academic Press, New York.Google Scholar
18. Kella, O. and Yechiali, U. (1985) Waiting times in the non-preemptive priority M/M/s queue. Stoch. Models 1, 257–262.Google Scholar
19. Levy, Y. and Yechiali, U. (1975) Utilization of idle time in an M/G/1 queueing system. Management Sci. 22, 202–211.Google Scholar
20. Marcus, M. and Minc, H. (1964) A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston.Google Scholar
21. Medhi, J. (1975) Waiting time distribution in a Poisson queue with a general bulk service rule. Management Sci. 21, 777–782.Google Scholar
22. Medhi, J. (1979) Further results on the waiting time distribution of a Poisson queue with a general bulk service rule. Can. Centre d’études Rech. Operat. 21, 183–191.Google Scholar
23. Miller, R. G. (1960) Priority queues. Ann. Math. Statist. 31, 86–103.Google Scholar
24. Morimura, H. (1962) On the relation between the distributions of the queue size and the waiting time. Kodai Math. Sem. Rep. 14, 6–19.Google Scholar
25. Neuts, M. F. (1966) The single server queue with Poisson input and semi-Markov service times. J. Appl. Prob. 3, 202–230.Google Scholar
26. Neuts, M. F. (1967) A general class of bulk queues with Poisson input. Ann. Math. Statist. 38, 759–770.Google Scholar
27. Neuts, M. F. (1977) Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times. Adv. Appl. Prob. 9, 141–157.CrossRefGoogle Scholar
28. Neuts, M. F. (1977) Algorithms for the waiting time distributions under various queue disciplines in the M/G/1 queue with service time distributions of phase type. In Algorithmic Methods in Probability , TIMS Studies in the Management Sciences, No. 7. North-Holland, Amsterdam, 177–97.Google Scholar
29. Neuts, M. F. (1978) Queues solvable without Rouché&s theorem. Operat. Res. 27, 767–781.Google Scholar
30. Neuts, M. F. (1979) A versatile Markovian point process. J. Appl. Prob. 16, 764–779.Google Scholar
31. Neuts, M. F. (1981) Matrix-geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore.Google Scholar
32. Neuts, M. F. and Meier, K. S. (1981) On the use of phase type distributions in reliability modelling of systems with two components. OR Spektrum 2, 227–234.Google Scholar
33. Neuts, M. F. and Ramalhoto, M. F. (1984) A service model in which the server is required to search for customers. J. Appl. Prob. 21, 157–166.CrossRefGoogle Scholar
Neuts, M. F. (1986) A new informative embedded Markov renewal process for the PH/G/1 queue. Adv. Appl. Prob. 18,Google Scholar
35. Neuts, M. F. (1984) Transform-free equations for the stationary waiting time distributions in the queue with Poisson arrivals and bulk services. Technical report nr. 95B, Univ. of Delaware.Google Scholar
36. Neuts, M. F. (1985) The M/G/1 queue with a limited number of admissions or a limited admission period during each service time. Stoch. Models 1, 361–391.Google Scholar
37. Neuts, M. F. (1986) Structured Stochastic Matrices of M/G/1 Type and Their Applications. In preparation.Google Scholar
38. Ott, T. J. (1984) On the M/G/1 queue with additional inputs. J. Appl. Prob. 21, 129–142.Google Scholar
39. Pyke, R. (1961) Markov renewal processes with finitely many states. Ann. Math. Statist. 32, 1243–1259.Google Scholar
40. Ramaswami, V. (1980) The N/G/1 queue and its detailed analysis. Adv. Appl. Prob. 12, 222–261.Google Scholar
41. Rossberg, H. J. and Siegel, G. (1974) Die Bedeutung von Kingmans Integralgleichungen bei der Approximation der stationären Wartezeitverteilung im Modell GI/G/1 mit und ohne Verzögerung beim Beginn einer Beschäftigungsperiode. Math. Operationsforsch. Statist. 5, 687–699.CrossRefGoogle Scholar
42. Rossberg, H. J. and Siegel, G. (1974) The GI/G/1 model with warming-up time. Zast. Mat. 14, 17–26.Google Scholar
43. Rossberg, H. J. and Siegel, G. (1974) On Kingman&s integral inequalities for approximations of waiting time distribution in the queueing model GI/G/1 with and without warming-up time. Zast. Mat. 14, 27–30.Google Scholar
44. Sandhu, D. and Posner, M. J. M. (1984) A priority M/G/1 queue with application to voice/data traffic. Working paper no. 84-02, Univ. of Toronto, 1984.Google Scholar
45. Schellhaas, H. (1978) On the T-policy for an M/G/1 queue. Operat. Res. Verfahren 29, 750–763.Google Scholar
46. Scholl, M. and Kleinrock, L. (1983) On the M/G/1 queue with rest periods and certain service-independent queueing disciplines. Operat. Res. 31, 705–719.Google Scholar
47. Shanthikumar, J. G. (1980) Some analyses on the control of queues using level crossings of regenerative processes. J. Appl. Prob. 17, 814–821.Google Scholar
48. Shanthikumar, J. G. (1981) Optimal control of an M/G/1 priority queue via N-control. Amer. J. Math. Management Sci. 1, 191–212.Google Scholar
49. Takacs, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
50. Tambouratzis, D. G. (1973) The modified M/G/1 queue. Bull. Soc. Math. Grèce 14, 176–199.Google Scholar
51. Tambouratzis, D. G. (1979) A generalization of the M/G/1 queue. Bull. Greek Math. Soc. 20, 106–120.Google Scholar
52. Teghem, J. Jr. (1975) Properties of (O,K) policy in an M/G/1 queue and optimal joining rules in an M/M/1 queue with removable server. Proc. 7th IFORS Int. Conf. Oper Res. 229–59.Google Scholar
53. Van Hoorn, M. H. and Seelen, L. P. (1984) The SSP/G/1 queue: A single server queue with a switched Poisson process as input process. OR Spektrum 5, 207–218.CrossRefGoogle Scholar
54. Welch, P. D. (1965) On a generalized M/G/1 queueing process in which the first customer of each busy period receives exceptional service. Operat. Res. 13, 736–752.Google Scholar
55. Yeo, G. F. (1962) Single server queues with modified service mechanisms. J. Austral. Math. Soc. 2, 499–507.Google Scholar