Computational Algorithms for Closed Queueing Networks with Exponential Servers

593Citations
Citations of this article
48Readers
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.

Cited by Powered by Scopus

Introduction to discrete event systems

2591Citations
N/AReaders
Get full text

Queueing Networks and Markov Chains: Modeling and Performance Evaluation With Computer Science Applications: Second Edition

1061Citations
N/AReaders
Get full text

Probability and Statistics with Reliability, Queuing and Computer Science Applications

978Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers over time

‘10‘12‘13‘14‘15‘16‘17‘18‘19‘20‘21‘22‘23‘24‘250481216

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 22

65%

Professor / Associate Prof. 7

21%

Researcher 4

12%

Lecturer / Post doc 1

3%

Readers' Discipline

Tooltip

Computer Science 18

55%

Engineering 6

18%

Business, Management and Accounting 6

18%

Mathematics 3

9%

Article Metrics

Tooltip
Mentions
References: 5

Save time finding and organizing research with Mendeley

Sign up for free
0