Queue length distributions in a markov model of a multistage clocked queueing network
โ Scribed by Ora E. Percus; J. K. Percus
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 265 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
โฆ Synopsis
In (41, we treated the problem of passage through a discrete-time clock-regulated multistage queueing network by modeling the input time series (a,,) to each queue as a Markov chain. We showed how to transform probability transition information from the input of one queue to the input of the next in order to predict mean queue length at each stage. The Markov approximation is very good for p = E(a,,) 4 i, which is in fact the range of practical utility. Here we carry out a Markov time series input analysis to predict the stage to stage change in the probability distribution of queue length. The main reason for estimating the queue length distribution at each stage is to locate "hot spots", loci where unrestricted queue length would exceed queue capacity, and a quite simple expression is obtained for this purpose.
๐ SIMILAR VOLUMES
This article presents an approximate analytical method for evaluating an aircraft sortie generation process. The process is modeled as a closed network of multiserver queues and fork-join nodes that allow concurrent service activities. The model uses a variation of mean value analysis (MVA) to captu
## Abstract **Summary:** A comprehensive model is developed to predict the relationship between the particle size distribution and molecular weights of particles in an emulsion copolymerization reactor. A full population balance equation is used for the particle size distribution and extended to th