Computational Algorithms for Closed Queueing Networks with Exponential Servers

589Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

Abstract

Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail. © 1973, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Buzen, J. P. (1973). Computational Algorithms for Closed Queueing Networks with Exponential Servers. Communications of the ACM, 16(9), 527–531. https://doi.org/10.1145/362342.362345

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free