On the stationary waiting-time distribution in the GI/G/1 queue, I: Transform methods and almost-phase-type distributions
- 1 March 1987
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 19 (01) , 240-265
- https://doi.org/10.1017/s0001867800016475
Abstract
This paper establishes a link between the Wiener–Hopf factorization and the phase-type method for studying theGI/G/1 queue. Using the Wiener–Hopf factorization, infinite-matrix type results are established for theGI/G/1 queue. An iterative numerical procedure (‘Levinson&s method’) based on these results is described. This method does not always converge. For the situation where either the interarrival times or the service times are of the so-called almost phase type (APH) an alternative, probabilistic derivation of the same results is given. This alternative derivation shows that in the APH situation Levinson&s method converges, converges essentially monotonically, and converges to the correct values.The algorithm has been coded and examples of numerical results are included.Keywords
This publication has 16 references indexed in Scilit:
- Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson ArrivalsTransportation Science, 1986
- The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational ProcedureOperations Research, 1986
- Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service QueuesTransportation Science, 1985
- A numerical solution for the multi-server queue with hyper-exponential service timesOperations Research Letters, 1983
- The depletion time forM/G/1 systems and a related limit theoremAdvances in Applied Probability, 1983
- Approximations for the steady-state probabilities in theM/G/cqueueAdvances in Applied Probability, 1981
- An Elementary Solution of the Queuing System G/G/1SIAM Journal on Computing, 1975
- The Distribution of the Time Required to Reduce to Some Preassigned Level a Single-Channel Queue Characterized by a Time-Dependent Poisson-Distributed Arrival Rate and a General Class of Holding TimesOperations Research, 1957
- The Solution of the Single-Channel Queuing Equations Characterized by a Time-Dependent Poisson-Distributed Arrival Rate and a General Class of Holding TimesOperations Research, 1956
- The theory of queues with a single serverMathematical Proceedings of the Cambridge Philosophical Society, 1952