DTIC ADA1013181: Steady State Algorithmic Analysis M/M/c pdf

DTIC ADA1013181: Steady State Algorithmic Analysis M/M/c

More Book Details

Description of the Book:

An algorithm for steady-state analysis of M/M/c nonpreemptive two-priority queues with heterogeneous rates is presented. It is based on a computational analysis a la Neuts which exploits a partition of the full state space into blocks. Both M/G/1 and GI/M/1 paradigm block structures arise and are exploited in the analysis. The mean number of waiting customers and the mean delay for each priority class are calculated. This gives a partial solution to the ‘probabilistic puzzler’ posed by D. P. Heyman in the fall 1977 issue of Applied Probability Newsletter, and extends a result of A. Cobham (Operations Research 2 (1954), 70-76) to two-priority queues with unequal service rates. In addition, the probabilities of individual states are computed. The algorithm has been programmed and some examples computed for nonpreemptive systems with five servers. (Author

• Creator/s: Defense Technical Information Center
• Date: 4/21/1981
• Year: 1981
• Book Topics/Themes: DTIC Archive, Miller, Douglas R, GEORGE WASHINGTON UNIV WASHINGTON D C PROGRAM IN LOGISTICS, *QUEUEING THEORY, ALGORITHMS, STEADY STATE, COMPUTATIONS, STOCHASTIC PROCESSES, MATRICES(MATHEMATICS), MATHEMATICAL LOGIC, RATES, VECTOR ANALYSIS, DELAY, HETEROGENEITY, STATISTICAL ANALYSIS, MEAN, NUMERICAL METHODS AND PROCEDURES, INVARIANCE

An excerpt captured from the PDF book