Hostname: page-component-7479d7b7d-8zxtt Total loading time: 0 Render date: 2024-07-13T13:25:40.075Z Has data issue: false hasContentIssue false
  • English
  • Français

The general bulk queue as a matrix factorisation problem of the Wiener-Hopf type. Part I.

Published online by Cambridge University Press:  01 July 2016

John Dagsvik
John Dagsvik*
Affiliation:
Central Bureau of Statistics, Oslo
Get access Rights & Permissions [Opens in a new window]

Abstract

The relationship between the Wiener-Hopf factorisation of matrices and the solution of systems of certain operator equations is discussed in an algebraic setting. It is shown that the study of the waiting time process of the nth arriving group of the general single server bulk queue leads to equations of that type. This system of equations may be considered as an extension of Lindley's waiting-time equation.

Keywords

WIENER-HOPF FACTORISATIONMEASURE ALGEBRAPROJECTION OPERATORSGROUP WAITING TIMEWAITING-TIME EQUATIONSTATIONARY DISTRIBUTIONBULK QUEUES
Type
Research Article
Information
Advances in Applied Probability , Volume 7 , Issue 3 , September 1975 , pp. 636 - 646
Copyright
Copyright © Applied Probability Trust 1975 

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

Arjas, E. (1972a) On a fundamental identity in the theory of semi-Markov processes. Adv. Appl. Prob. 4, 258–270.Google Scholar
Arjas, E. (1972b) On the use of a fundamental identity in the theory of semi-Markov queues. Adv. Appl. Prob. 4, 271–284.Google Scholar
Cohen, J. W. (1969) The Single Server Queue. North-Holland Publishing Company, Amsterdam.Google Scholar
Dagsvik, J. (1975) The general bulk queue as a matrix factorisation problem of the Wiener-Hopf type. Part II. Adv. Appl. Prob. 7, 647–655.Google Scholar
Keilson, J. (1962) The general bulk queue as a Hilbert problem. J. R. Statist. Soc. B 24, 344–359.Google Scholar
Kingman, J. F. C. (1966) On the algebra of queues. J. Appl. Prob. 3, 285–326.Google Scholar
Lambotte, J. P. and Teghem, J. L. (1969) Modèles d'Attente M/G/1 et GI/M/1 à Arrivées et Services en Groupes. Springer-Verlag, Berlin.Google Scholar
LeGall, P. (1962) Les Systèmes avec ou sans Attente et les Processus Stochastiques. Dunod, Paris.Google Scholar
Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–283.Google Scholar
Miller, H. D. (1962) A matrix factorization problem in the theory of random variables defined on a finite Markov chain. Proc. Camb. Phil. Soc. 58, 268–285.Google Scholar
Miller, R. G. (1959) A contribution to the theory of bulk queues. J. R. Statist. Soc. B 21, 320–337.Google Scholar
Presman, E. L. (1969) Factorization methods and boundary problems for sums of random variables given on Markov chains. Math. USSR Izv. 3, 815–852.Google Scholar