ACM

Communications of the ACM

Home/Magazine Archive/September 1973 (Vol. 16, No. 9)/Computational algorithms for closed queueing networks.../Abstract

Computational algorithms for closed queueing networks with exponential servers

By Jeffrey P. Buzen
Communications of the ACM, September 1973, Vol. 16 No. 9, Pages 527-531
10.1145/362342.362345
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.