|
Problemy Peredachi Informatsii, 1991, Volume 27, Issue 2, Pages 15–24
(Mi ppi553)
|
|
|
|
Communication Network Theory
Comparative Throughput Analysis of Queueing Networks with Exponential and Deterministic Service Time in the Nodes
A. L. Stolyar
Abstract:
We consider a queueing network consisting of $\cdot|M|m$- and $\cdot|GI|\infty$ systems. Poisson arrivals are assumed (if the network is open). We show that the throughput characteristics are not degraded when the exponential service time in one or several $\cdot|M|1$ systems is replaced with a deterministic service time with the same mean: if the network is open, the total number of customers in the modified network is stochastically less that in the original network; if the network is closed, the average load coefficients of the systems in the modified network are not less than in the original network.
Received: 07.12.1989
Citation:
A. L. Stolyar, “Comparative Throughput Analysis of Queueing Networks with Exponential and Deterministic Service Time in the Nodes”, Probl. Peredachi Inf., 27:2 (1991), 15–24; Problems Inform. Transmission, 27:2 (1991), 99–107
Linking options:
https://www.mathnet.ru/eng/ppi553 https://www.mathnet.ru/eng/ppi/v27/i2/p15
|
Statistics & downloads: |
Abstract page: | 233 | Full-text PDF : | 109 |
|