Computational algorithms for product form queueing networks-Reference-Cited by-同舟云学术

Computational algorithms for product form queueing networks

Published:1980-10 Issue:10 Volume:23 Page:573-583
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Chandy K. Mani¹,Sauer Charles H.²

Affiliation:

1. Univ. of Texas, Austin

2. IBM Thomas J. Watson Research Center, Yorktown Heights, NY

Abstract

In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359015.359020

Reference24 articles.

1. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

2. Parametric analysis of queueing networks;Chandy K.M.;IBM J. Res. Develop.,1975

Cited by 79 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Capacity Analysis of Sequential Zone Picking Systems;Operations Research;2020-01

2. SMVA: A Stable Mean Value Analysis Algorithm for Closed Systems with Load-Dependent Queues;Systems Modeling: Methodologies and Tools;2018-10-17

3. Joint design of parking capacities and fleet size for one-way station-based carsharing systems with road congestion constraints;Transportation Research Part B: Methodological;2016-11

4. Networks of Queues;Probability and Statistics with Reliability, Queuing and Computer Science Applications;2016-08-26

5. Use of Flow Equivalent Servers in the Transient Analysis of Product Form Queuing Networks;Analytical and Stochastic Modelling Techniques and Applications;2015