Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-12T19:43:47.075Z Has data issue: false hasContentIssue false

On the length and number of served customers of the busy period of a generalised M/G/1 queue with finite waiting room

Published online by Cambridge University Press:  01 July 2016

Stig I. Rosenlund*
Affiliation:
University of Stockholm

Abstract

Customers arrive in groups to a single server queue with finite waiting room. Two-dimensional distributions for times and numbers of served customers between occurrences of states in the embedded Markov chain are obtained by linear algebra giving systems of equations for joint Laplace-Stieltjes transforms. For M/M/1 a simple recursion relation for the joint transform of the two variables in the title is derived and used to obtained the first and second moments.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1973 

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] Cohen, J. W. (1971) On the busy periods for the M/G/1 queue with finite and with infinite waiting room. J. Appl. Prob. 8, 821827.Google Scholar
[2] Rosenlund, S. I. (1973) An M/G/1 model with finite waiting room in which a customer remains during part of service. J. Appl. Prob. 10, No. 4. To appear.Google Scholar
[3] Råde, L. (1972) A model for interaction of a Poisson and a renewal process and its relation with queueing theory. J. Appl. Prob. 9, 451456.Google Scholar
[4] Råde, L. (1972) Limit theorems for thinning of renewal point processes. J. Appl. Prob. 9, 847851.Google Scholar
[5] Tomko, J. (1967) A limit theorem for a queue when the input rate increases indefinitely. (In Russian) Studia Sci. Math. Hung. 2, 447454.Google Scholar