article

Free access

Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks

Authors:

J. McKenna,

Debasis MitraAuthors Info & Claims

Journal of the ACM (JACM), Volume 31, Issue 2

Pages 346 - 360

https://doi.org/10.1145/62.322432

Published: 30 March 1984 Publication History

PDF eReader

References

[1]

KLEtNR~K, L.Queuemg SFstems. Vol. 2, Computer Applications. Wiley, New York, 1976.

Google Scholar

[2]

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

Google Scholar

[3]

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

Crossref

Google Scholar

[4]

KELLY, F. P. Reversibihty and Stochasttc Networks Wiley, New York, 1980.

Google Scholar

[5]

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

Crossref

Google Scholar

[6]

ZAHORJAN, J., SEVCIK, K. C., EAGER, D. L., AND GALLER, B. Balanced job bound analysis of queueing networks. Commun. ACM 25, 2 (Feb. 1982), 134-141.

Crossref

Google Scholar

[7]

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

Google Scholar

[8]

McKENNA, J., MITRA D., AND RAMAKRISHNAN, K. G.A class of dosed Markovian queueing networks: Integral representations, asymptouc expansions, generalizations. Bell Syst. Tech. J. 60, 5 (May-June 1981), 599-641.

Google Scholar

[9]

HEFFES, H. Moment formulae for a class of mixed multi-job-type queueing networks. Bell Syst. Tech J 61, 5 (May-June 1982), 709-745.

Google Scholar

[10]

BRUEL, S. C., AND BALBO, G.Computattonal Algorithms for Closed Queueing Networks. Elsevier. North-Holland, New York, 1980.

Google Scholar

[11]

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

Crossref

Google Scholar

[12]

RAMAKRISHNAN, K. G., AND MITRA, D.An overview of PANACEA, a software package for analyzing Markovian queueing networks. Bell Syst Tech J 61, 10 (Dec. 1982), 2849-2872.

Google Scholar

[13]

LAVENBERG, S. S. Closed multichain product form queueing networks with lat~ population sizes. In Apphed Probabthty.--Computer Science" The Interface. Vol. 1. R. L Disney and Teunis J. Oft, Eds. Birkhauser, Boston, 1982, pp. 219-249.

Google Scholar

[14]

BARD, Y. Some extensions to multielass queueing network analysis. In Performance of Computer Systems. M. Arato, A. Butrimenko, and E. Gelembe, Eds, Elsevier North-Holland, New York, 1979.

Crossref

Google Scholar

[15]

SCHWmTZER, P.Approximate analysis of multiclass dosed networks of queues, in Proceedings of the International Conference on Stochastic Control and Optimization, (Amsterdam, Apr. 5-6). Free University at Amsterdam, Amsterdam, The Netherlands, 1979.

Google Scholar

[16]

RAMAKRISHNAN, K, G., AND MITRA, D.PANACEA 2.1: User's Manual and Theory. Bell Labs Technical Memorandum, 1983.

Google Scholar

Cited By

View all

Casale GGao YNiu ZZhu L(2024)LN: A Flexible Algorithmic Framework for Layered Queueing Network AnalysisACM Transactions on Modeling and Computer Simulation10.1145/363345734:3(1-26)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3633457
Casale GGao YNiu ZZhu L(2022)LN: A Meta-solver for Layered Queueing Network AnalysisQuantitative Evaluation of Systems10.1007/978-3-031-16336-4_12(232-254)Online publication date: 12-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-16336-4_12
Casale G(2020)Integrated performance evaluation of extended queueing network models with lineProceedings of the Winter Simulation Conference10.5555/3466184.3466455(2377-2388)Online publication date: 14-Dec-2020
https://dl.acm.org/doi/10.5555/3466184.3466455
Show More Cited By

Index Terms

Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks

Recommendations

Asymptotic analysis for Markovian queues with two types of nonpersistent retrial customers

We consider Markovian multiserver retrial queues where a blocked customer has two opportunities for abandonment: at the moment of blocking or at the departure epoch from the orbit. In this queueing system, the number of customers in the system (servers ...
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks

Striking progress has been made recently in obtaining expressions for the sojourn time distribution function (STDF) of a job at a c-server, first-come, first-serve (FCFS) center in a closed, product-form queuing network. These results have more recently ...
Multiserver queue with semi-Markovian batch arrivals

We consider a queueing system consisting of multiple identical servers and a common queue. The service time follows an exponential distribution and the batch arrival process is governed by a semi-Markov process (SMP). Our analysis is based on the theory ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 31, Issue 2

April 1984

245 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/62

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 March 1984

Published in JACM Volume 31, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

65
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)7

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Casale GGao YNiu ZZhu L(2024)LN: A Flexible Algorithmic Framework for Layered Queueing Network AnalysisACM Transactions on Modeling and Computer Simulation10.1145/363345734:3(1-26)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3633457
Casale GGao YNiu ZZhu L(2022)LN: A Meta-solver for Layered Queueing Network AnalysisQuantitative Evaluation of Systems10.1007/978-3-031-16336-4_12(232-254)Online publication date: 12-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-16336-4_12
Casale G(2020)Integrated performance evaluation of extended queueing network models with lineProceedings of the Winter Simulation Conference10.5555/3466184.3466455(2377-2388)Online publication date: 14-Dec-2020
https://dl.acm.org/doi/10.5555/3466184.3466455
Casale G(2020)Integrated Performance Evaluation of Extended Queueing Network Models with Line2020 Winter Simulation Conference (WSC)10.1109/WSC48552.2020.9383931(2377-2388)Online publication date: 14-Dec-2020
https://doi.org/10.1109/WSC48552.2020.9383931
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
McKenna J(2016)A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networksJournal of Applied Probability10.2307/321432226:01(121-133)Online publication date: 14-Jul-2016
https://doi.org/10.2307/3214322
Mitra D(2016)Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability10.2307/142738119:01(219-239)Online publication date: 1-Jul-2016
https://doi.org/10.2307/1427381
McKenna J(2016)A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networksJournal of Applied Probability10.1017/S002190020004185126:01(121-133)Online publication date: 14-Jul-2016
https://doi.org/10.1017/S0021900200041851
Mitra D(2016)Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability10.1017/S000186780001646319:01(219-239)Online publication date: 1-Jul-2016
https://doi.org/10.1017/S0001867800016463
Anselmi JD'Auria BWalton N(2013)Closed Queueing Networks Under CongestionMathematics of Operations Research10.1287/moor.1120.058338:3(469-491)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1287/moor.1120.0583
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Asymptotic analysis for Markovian queues with two types of nonpersistent retrial customers

Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks

Multiserver queue with semi-Markovian batch arrivals

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations