Transient solutions in markovian queueing systems
Computers & Operations ResearchPublished 1 January 1977
Winfried K. Grassmann
Citations286
SJR quartileQ1
SJR score1.60
SNIP2.02
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper discusses the methods available to find transient solutions for huge, but sparse Markov processes, as they arise in connection with queueing systems. The methods discussed include Runge-Kutta, Liou's method and randomization. It is shown that all these methods are closely related, but that the method of randomization is superior to the other two methods. Our own experience and experience of others clearly indicate that all the methods mentioned above are viable for finding transient solutions in problems having 600 states or more.
Keywords
Computer ScienceDecision SciencesBusiness, Management and Accounting
Journal of the Franklin InstituteAn introduction to probability theory and its applications
29,966 Citations1958
Operations ResearchFinite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
296 Citations1967Frederick S. Hillier, Ronald W. Boling
A procedure is described for approximating the mean output rate for the case of exponential holding times and it is demonstrated that this procedure provides an excellent approximation for most cases and that it is computationally feasible for large problems.
Proceedings of the IEEEA novel method of evaluating transient response
147 Citations1966M.L. Liou
A novel method of evaluating transient responses of linear time-invariant systems using the state space approach is described, which is simple, accurate, and effective, especially when used with a digital computer.
ACM Computing SurveysA Survey of Indexing Techniques for Sparse Matrices
82 Citations1973Udo W. Pooch, Al Nieder
The concluding section of the paper compares the types of methods, discusses their suitabihty for different types of processing, and makes suggestions about the adaptability and flexibility of the maj or exmting methods of indexing algorithms for application to user problems.
ComputingEin Wartesystem mit zwei parallelen Warteschlangen
11 Citations1968R. Schaßberger
This paper deals with the calculation of the ergodic projection of transition matrices by a service system with two interconnected parallel queues, Poisson input and exponentially distributed service times.
ComputingLokal optimale Schranken bei Randwertaufgaben
6 Citations1968Wolfgang Wetterling
A known method of Chebyshev-approximation for uniformly optimal bounds and a new method of optimization for locally optimal bounds is compared and an existence theorem is proved.
Defense Technical Information Center (DTIC)The Numerical Solution of Transient Queueing Problems
2 Citations1972Olson, Stuart W.
A generalized, Runge-Kutta programming package, written in FORTRAN IV for the IBM 360/65, is presented and described in detail for use on queueing problems.