Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (2) , 492-513
- https://doi.org/10.1145/322307.322321
Abstract
A sample dynamic scaling technique is shown that avoids both the overflow and underflow problems that are often encountered in the evaluation of normalization constants of closed product-form queuing networks W~th dynamic scaling, normalization constants for very large routing chain population sizes can be evaluated within the bounds of a relauvely small range of numbers. It is shown that the product-form solution possesses a local balance property and the M ~, M property with respect to routing chains. The relationships between normahzaUon constants of closed networks and certain equilibrium aggregate state probabdities in networks that permit external arrivals and departures are examined. The growth behavior of normalization constants is shown to be modeled by a birth-death process traversing over the set of chain population vectorsKeywords
This publication has 6 references indexed in Scilit:
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Referencing as PersuasionSocial Studies of Science, 1977
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973