Mean-Value Analysis of Closed Multichain Queuing Networks

@article{Reiser1980MeanValueAO,
  title={Mean-Value Analysis of Closed Multichain Queuing Networks},
  author={Martin Reiser and Stephen S. Lavenberg},
  journal={J. ACM},
  year={1980},
  volume={27},
  pages={313-322}
}
It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants. The resulting computational procedures have improved properties (avoidance of numerical problems and, in some cases, fewer operations) compared to previous algorithms. Furthermore, the new algorithms have a physically meaningful interpretation which provides the… 
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking
TLDR
It is shown that the equilibrium-state probabilities for this type of blocking queuing network have an approximate product-form solution, which is based on normalizing the infeasible states that violate station capacities, and the throughputs of both systems are approximately equal.
Closed Multichain Product Form Queueing Networks with Large Population Sizes
TLDR
Large population approximations for throughputs, mean queue sizes and mean response times are obtained based on the asymptotic result and on the equations of mean-value analysis for closed multichain product form queueing networks.
Approximate Performance and Sensitivity Analysis of Closed Queueing Networks
A new heuristic algorithm called QNA (Queueing Network Analyzer), has been proposed by the authors for the evaluation of the average performance measures in a queueing network, This algorithm
Asymptotic expansion for large closed queuing networks
In this paper, a new asymptotic method is developed for analyzing closed BCMP queuing networks with a single class (chain) consisting of a large number of customers, a single infinite server queue,
Calculating joint queue-length distributions in product-form queuing networks
A new computational algorithm called distribution analysis by chain (DAC) is developed. This algorithm computes joint queue-length distributions for product-form queuing networks with single-server
Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations
TLDR
This work provides an extension to S-B MVA to enable the analysis of networks with multipleserver stations and demonstrates the accuracy of this approach.
Approximate Analysis of Load Dependent General Queueing Networks
A method for obtaining approximate solutions to load-dependent closed queueing networks containing general service-time distributions and first-come-first-served scheduling disciplines is presented.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms
TLDR
This paper shows how open and closed subchains interact with each other in such systems with N servers and L chains and derives efficient algorithms derived from the generating function representation.
Horner's rule for the evaluation of general closed queueing networks
TLDR
An algorithm is given which does not show a combinatorial operation count and is based on a generalization of Horner's rule for polynomials for separable closed queueing networks.
Computational algorithms for closed queueing networks with exponential servers
TLDR
Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers based on two-dimensional iterative techniques which are highly efficient and quite simple to implement.
Closed Queuing Systems with Exponential Servers
TLDR
It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
TLDR
Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
A Queueing Network Analysis of Computer Communication Networks with Window Flow Control
A computer communication network with window flow control is modeled by a closed multichain queueing network. The severe computational limitation of previous solution algorithms is overcome with a
A use of complex probabilities in the theory of stochastic processes
The exponential distribution is very important in the theory of stochastic processes with discrete states in continuous time. A. K. Erlang suggested a method of extending to other distributions
StaUonary state probabilities of arrival instants for closed queuing network with mulUple types of customers
  • J .R. Jobshop-fike queuing systems. Management Sci
  • 1979
StaUonary state probabilities of arrival instants for closed queuing network with mulUple types of customers Yorktown Heights
  • Res. Rep RC IBM Thomas J. Watson Res. Cir
  • 1979
...
1
2
3
...