Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-14T11:13:53.999Z Has data issue: false hasContentIssue false
  • English
  • Français

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

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

In a previous paper (Dagsvik (1975)) the waiting time process of the single server bulk queue is considered and a corresponding waiting time equation is established. In this paper the waiting time equation is solved when the inter-arrival or service time distribution is a linear combination of Erlang distributions. The analysis is essentially based on algebraic arguments.

Keywords

PROJECTION OPERATORSWAITING TIME EQUATIONHYPER-ERLANG DISTRIBUTIONHYPER-EXPONENTIAL DISTRIBUTIONSTATIONARY STATEBULK QUEUES
Type
Research Article
Information
Advances in Applied Probability , Volume 7 , Issue 3 , September 1975 , pp. 647 - 655
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

Çinlar, E. (1967a) Time dependence of queues with semi-Markovian services. J. Appl. Prob. 4, 356–364.Google Scholar
Çinlar, E. (1967b) Queues with semi-Markovian arrivals. J. Appl. Prob. 4, 365–379.Google Scholar
Dagsvik, J. (1975) The general bulk queue as a matrix factorisation problem of the Wiener-Hopf type. Part I. Adv. Appl. Prob. 7, 636–646.Google Scholar
Kingman, J.F.C. (1966) On the algebra of queues. J. Appl. Prob. 3, 285–326.Google Scholar
Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–283.CrossRefGoogle Scholar
Miller, H. D. (1961) A convexity property in the theory of random variables defined on a finite Markov chain. Amer. Math. Statist. 32, 1260–1270.Google Scholar
Neuts, M. F. (1966) The single server queue with Poisson input and semi-Markov service times. J. Appl. Prob. 3, 202–230.Google Scholar