article

Free access

RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks

Authors:

N. D. GeorganasAuthors Info & Claims

Journal of the ACM (JACM), Volume 33, Issue 4

Pages 768 - 791

https://doi.org/10.1145/6490.6495

Published: 10 August 1986 Publication History

Abstract

RECAL, a Recursion by Chain Algorithm for computing the mean performance measures of product-form multiple-chain closed queuing networks, is presented. It is based on a new recursive expression that relates the normalization constant of a network with r closed routing chains to those of a set of networks having (r - 1) chains. It relies on the artifice of breaking down each chain into constituent subchains that each have a population of one. The time and space requirements of the algorithm are shown to be polynomial in the number of chains. When the network contains many routing chains, the proposed algorithm is substantially more efficient than the convolution or mean value analysis algorithms. The algorithm, therefore, extends the range of queuing networks that can be analyzed efficiently by exact means.

References

[1]

BASKETT, F., CHANDY, K.M., MUNTZ, R.R., AND PALACIOS, F.G. Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 2 (Apr. 1975), 248-260.

Digital Library

[2]

BRUELL, S.C., AND BALBO, G. ComputationalAlgorithmsfor Closed Queueing Networks. Elsevier- North Holland, New York, 1980.

[3]

BUZEN, J.P. Computational algorithms for closed queueing networks with exponential servers. Commun. ACM 16, 9 (Sept. 1973), 527-531.

Digital Library

[4]

CHANDY, K.M., AND NEUSE, O. Linearizer: A heuristic algorithm for queueing network models of computer systems. Commun. ACM 25, 2 (Feb. 1982), 126-133.

Digital Library

[5]

CHANDY, K.M., AND SAUER, C.H. Computational algorithms for product form queueing networks. Commun. ACM 23, l0 (Oct. 1980), 573-583.

Digital Library

[6]

CONWAY, A.E., AND GEORGANAS, N.D. A new method for computing the normalization constant of multiple chain queueing networks. INFOR 24, 3 (Aug. 1986).

[7]

COURTOIS, P.J. Decomposability: Queueing and Computer System Applications. Academic Press, Orlando, Fla., 1977.

[8]

LAM, S.S. Dynamic scaling and growth behavior of queuing network normalization constants. J. ACM29, 2 (Apr. 1982), 492-513.

Digital Library

[9]

LAM, S.S., AND LIEN, Y.L. A tree convoluted algorithm for the solution of queueing networks. Commun. ACM 26, 3 (Mar. 1983), 203-215.

Digital Library

[10]

LAM, S.S., AND WONG, j.W. Queueing network models of packet switching networks. Part 2: Networks with population size constraints. Perform. EvaL 2, 3 (1982), 161 - 180.

[11]

LAVENBERG, S.S., ED. Computer Performance Modeling Handbook. Academic Press, Orlando, Fla. 1983.

[12]

LAVENBERG, S.S., AND REISER, M. Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. J. Appl. Prob. 17 (Dec. 1980), 1048-1061.

[13]

LITTLE, J.D.C. A proof of the queueing formula L = hW. Oper. Res. 9 (1961), 383-387.

Digital Library

[14]

MCKENNA, J., AND MITRA, n. Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage. Bell Syst. Tech. J. 61, 5 (May-June 1982), 661-683.

[15]

MCKENNA, J., AND MITRA, D. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. J. ACM 31, 2 (Apr. 1984), 346-360.

Digital Library

[16]

NEUSE, D.M. Approximate analysis of large and general queueing networks. Ph.D. dissertation, Univ. of Texas, Austin, 1982.

Digital Library

[17]

REISER, M., AND KOBAYASHI, H. Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. Dev., 19 (May 1975), 283-294.

Digital Library

[18]

REISER, M., AND LAVENBERG, S.S. Mean-value analysis of closed multichain queuing networks. J. ACM 27, 2 (Apr. 1980), 313-322.

Digital Library

[19]

SAUER, C.H., AND CHANDY, K.M. Computer Systems Performance modeling. Prentice-Hall, Englewood Cliffs, N.J., 1981.

Cited By

Marin AMeo MSereno MMarsan M(2024)Queuing Network Models of Multiservice RANsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36493079:2(1-26)Online publication date: 28-Feb-2024
https://dl.acm.org/doi/10.1145/3649307
Casale GHarrison POng W(2021)Facilitating load-dependent queueing analysis through factorizationPerformance Evaluation10.1016/j.peva.2021.102241152:COnline publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.peva.2021.102241
Otten SKrenzler RDaduna H(2019)Separable models for interconnected production-inventory systemsStochastic Models10.1080/15326349.2019.169266736:1(48-93)Online publication date: 18-Dec-2019
https://doi.org/10.1080/15326349.2019.1692667
Show More Cited By

Index Terms

RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queueing networks (abstract)

RECAL, a Recursion by Chain Algorithm for computing the mean performance measures of product-form multiple-chain closed queueing networks, is presented. It is based on a new recursive expression which relates the normalization constant of a network with ...
RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queueing networks (abstract)
SIGMETRICS '85: Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems

RECAL, a Recursion by Chain Algorithm for computing the mean performance measures of product-form multiple-chain closed queueing networks, is presented. It is based on a new recursive expression which relates the normalization constant of a network with ...
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence

We analyze the behavior of closed multiclass product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route or class. First, we focus on the stationary behavior and prove the conjecture that the ...

Comments

Information & Contributors

Information

Published In

Copyright © 1986 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 1986

Published in JACM Volume 33, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
506
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)6

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Marin AMeo MSereno MMarsan M(2024)Queuing Network Models of Multiservice RANsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36493079:2(1-26)Online publication date: 28-Feb-2024
https://dl.acm.org/doi/10.1145/3649307
Casale GHarrison POng W(2021)Facilitating load-dependent queueing analysis through factorizationPerformance Evaluation10.1016/j.peva.2021.102241152:COnline publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.peva.2021.102241
Otten SKrenzler RDaduna H(2019)Separable models for interconnected production-inventory systemsStochastic Models10.1080/15326349.2019.169266736:1(48-93)Online publication date: 18-Dec-2019
https://doi.org/10.1080/15326349.2019.1692667
Mandelbaum MHlynka M(2017)Examples of Applications of Queueing Theory in CanadaINFOR: Information Systems and Operational Research10.3138/infor.46.4.24746:4(247-263)Online publication date: 18-Jan-2017
https://doi.org/10.3138/infor.46.4.247
Casale G(2017)Accelerating Performance Inference over Closed Systems by Asymptotic MethodsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/30844451:1(1-25)Online publication date: 13-Jun-2017
https://dl.acm.org/doi/10.1145/3084445
Bhanja UPathak S(2015)Queueing Model of Multihop Lightwave NetworkIETE Journal of Research10.1080/03772063.2000.1141614846:3(133-137)Online publication date: 26-Mar-2015
https://doi.org/10.1080/03772063.2000.11416148
Thomasian A(2014)Performance Evaluation of Computer SystemsComputing Handbook, Third Edition10.1201/b16812-64(1-50)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-64
Thomasian A(2014)Storage Systems*Computing Handbook, Third Edition10.1201/b16812-23(1-42)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-23
Makaronidis MCasale GLasaulce SFiems DHarrison PVandendorpe L(2011)Efficient parallelization of the Method of Moments for queueing networks using multi-modular algebraProceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools10.5555/2151688.2151709(176-185)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.5555/2151688.2151709
Casale G(2009)An application of exact linear algebra to capacity planning modelsACM Communications in Computer Algebra10.1145/1504341.150434542:4(202-205)Online publication date: 6-Feb-2009
https://dl.acm.org/doi/10.1145/1504341.1504345
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents