article

Free access

Bound hierarchies for multiple-class queuing networks

Authors:

Derek L. Eager,

Kenneth C. SevcikAuthors Info & Claims

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

Pages 179 - 206

https://doi.org/10.1145/4904.4992

Published: 02 January 1986 Publication History

Abstract

An algorithm for computing bounds on the performance measures of multiple-class, product-form queuing networks is presented. The algorithm offers the user a hierarchy of bounds with differing accuracy levels and computational cost requirements. Unlike previously proposed bounding algorithms, the algorithm is applicable to all of the types of product-form queuing networks that are commonly used in computer system and computer-communication network applications.

References

[1]

BARD, Y. Some extensions to multiclass queueing network analysis. In Performance of Computer Systems. M. Arato, A. Butrimenko, and E. Gelenbe, Eds. North Holland, Amsterdam, 1979.]]

[2]

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.]]

[3]

CHANDY, K. M., AND MARTIN. A. J. A characterization of product-form queuing networks. J. ACM 30, 2 (Apr. 1983), 286-299.]]

[4]

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

[5]

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

[6]

CHOW, W.-M. Approximations for large scale closed queueing networks. Perform. Eval. 3, 1 (Feb. 1983), 1--12.]]

[7]

DE SOUZA E SILVA, E., LAVENBERG, S. S., AND MUNTZ, R.R. A perspective on iterative methods for the approximate analysis of closed queueing networks. In Mathematical Computer Performance and Reliability. North-Holland, New York, 1984, pp. 191-210.]]

[8]

DOWDY, L. W., PEREZ-DAVILA, A., AND STEPHENS, L. E. Performance bounds based upon throughput curve properties. In Performance '83DProceedings of the 9th International Symposium on Computer Perfi)rmance Modelling, Measurement, and Evaluation (College Park, Md., May 25- 27). North-Holland, New York, 1983, pp. 285-293.]]

[9]

EAGER, D. L. Bounding algorithms for queueing network models of computer systems. Ph.D. dissertation, Tech. Rep. CSRG-156. Dept. of Comput. Sci., Univ. of Toronto, Toronto, Ont., Canada, Mar. 1984.]]

[10]

EAGER, D. L., AND SEVCIK, K.C. Performance bound hierarchies for queueing networks. ACM Trans. Comput. Syst. 1, 2 (May 1983), 99-115.]]

[11]

GRAHAM, G. S., ED. Special Issue: Queueing network models of computer system performance. ACM Comput. Surv. 10, 3 (Sept. 1978).]]

[12]

KEROLA, T. The Composite Bound Method (CBM) for computing throughput bounds in multiple class environments. Perform. Eval., to be published.]]

[13]

KRIZ, J. Throughput bounds for closed queueing networks. Perform. Eval. 4, i (Feb. 1984), 1-10.]]

[14]

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

[15]

MCKENNA, J., AND MITRA, D. Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage. In Performance "81DProceedings of the 8th International Symposium on Computer Performance Modelling, Measurement, and Evaluation (Amsterdam, Nov.). North-Holland, New York, 1981, pp. 67-84.]]

[16]

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

[17]

MIT~A, D., AND MCKENNA, J. Some results on asymptotic expansions for closed Markovian networks with state dependent service rates. In Performance "84mProceedings ofthe l Oth International Symposiltm on Computer Performance Modelling, Measurement, and Evaluation (Paris, Dec. 19-21). North-Holland, New York, 1984, pp. 377-392.]]

[18]

MUNTZ, R. R., AND WONG, J. Asymptotic properties of closed queueing network models, in 8th Anmtal Princeton Conference on Information Science and Systems (Princeton, N.J., Mar.) 1974 (private publication).]]

[19]

NEUSE, D., AND C,ANDY, K.M. SCAT: A heuristic algorithm for queueing network models of computing systems. In ACM Sigmetrics Performance Evaluation ReviewwProceedings of the ACM/ SIGMETRICS Conference on Measurement and Modelling of Computer Systems (Las Vegas, Nev., Sept. 14-16). ACM, New York, 1981, pp. 59-79.]]

[20]

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

[21]

RE~SER, M. A queueing network analysis of computer communication networks with window flow control. IEEE Trans. Commun. COM-27, 8 (Aug. 1979), 1199-1209.]]

[22]

REtSER, M. Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks. Perform EvaL I, 1 (Jan. 1981 ), 7-18.]]

[23]

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

[24]

SAUER, C. H. Computational algorithms for state-dependent queuing networks. ACM Trans. Comput. Syst. 1, 1 (Feb. 1983), 67-92.]]

[25]

SC~WEITZFR, P. Approximate analysis of multiclass closed networks of queues. In Proceedings of International Conference on Stochastic Control and Optimization (Amsterdam). 1979 (private publication).]]

[26]

SEVOK, K.C. Priority scheduling disciplines in queueing network models of computer systems. In Proceedings oflFIP 77 (Toronto, Aug.). North-Holland, New York, 1977, pp. 565-570.]]

[27]

STEPHENS, L. E., AND DOWDY, L. W. Convolutional bound hierarchies. In ACM Sigmetrics Performance Evaluation Review---Proceedings of the ACM/SIGMETRICS Conference on Measurement and Modeling of Computer Systems (Cambridge Mass., Aug. 21-24). ACM, New York, 1984, pp. 120-133.]]

[28]

Suai, R. Generalized quick bounds for performance of queueing networks. Tech. Rep. TR-05- 83. Aiken Computation Lab., Harvard University, Cambridge, Mass., Feb. 1983.]]

[29]

ZAHORJAN, J. The approximate solution of large queueing network models. Ph.D. dissertation, Tech. Rep. CSRG-122. Dept. of Comput. Sci., Univ. of Toronto, Toronto, Ont., Canada, Aug. 1980.]]

[30]

ZAnORJAN, J., AND WONG, E. A solution of separable queueing network models using mean value analysis, in ACM Sigmetrics Performance Evaluation ReviewwProceedings of the ACM/SIGMETRICS Conference on Measurement and Modeling of Computer Systems (Las Vegas, Nev., Sept. 14-16). ACM, New York, 1981, pp. 80-85.]]

[31]

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

Cited By

Shi XKe ZZhou YJin HLu LZhang XHe LHu ZWang F(2019)DecaACM Transactions on Computer Systems10.1145/331036136:1(1-47)Online publication date: 14-Mar-2019
https://dl.acm.org/doi/10.1145/3310361
Rodriguez RCampos J(2019)On Throughput Approximation of Resource-Allocation Systems by Bottleneck RegrowingIEEE Transactions on Control Systems Technology10.1109/TCST.2017.276851227:1(370-377)Online publication date: Jan-2019
https://doi.org/10.1109/TCST.2017.2768512
Beltrán M(2015)Automatic provisioning of multi-tier applications in cloud computing environmentsThe Journal of Supercomputing10.1007/s11227-015-1380-571:6(2221-2250)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s11227-015-1380-5
Show More Cited By

Index Terms

Bound hierarchies for multiple-class queuing networks

Recommendations

Performance bound hierarchies for queueing networks
SIGMETRICS '82: Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems

In applications of queueing network models to computer system performance prediction, the computational effort required to obtain an exact equilibrium solution of a model may not be justified by the accuracy actually required. In these cases, there is a ...
A traffic based decomposition of two-class queueing networks with priority service

This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the ...
Bound analysis of closed queueing networks with workload burstiness
SIGMETRICS '08

Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models as these features are responsible of significant performance ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 33, Issue 1

The MIT Press scientific computation series

Jan. 1986

249 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/4904

Issue’s Table of Contents

Copyright © 1986 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 January 1986

Published in JACM Volume 33, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
689
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)8

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Shi XKe ZZhou YJin HLu LZhang XHe LHu ZWang F(2019)DecaACM Transactions on Computer Systems10.1145/331036136:1(1-47)Online publication date: 14-Mar-2019
https://dl.acm.org/doi/10.1145/3310361
Rodriguez RCampos J(2019)On Throughput Approximation of Resource-Allocation Systems by Bottleneck RegrowingIEEE Transactions on Control Systems Technology10.1109/TCST.2017.276851227:1(370-377)Online publication date: Jan-2019
https://doi.org/10.1109/TCST.2017.2768512
Beltrán M(2015)Automatic provisioning of multi-tier applications in cloud computing environmentsThe Journal of Supercomputing10.1007/s11227-015-1380-571:6(2221-2250)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s11227-015-1380-5
Brock JLuo HDing C(2014)Locality analysisACM SIGMETRICS Performance Evaluation Review10.1145/2627534.262756541:4(102-105)Online publication date: 17-Apr-2014
https://dl.acm.org/doi/10.1145/2627534.2627565
Al-Jaroodi JMohamed NEid A(2014)Dual direction big data download and analysisACM SIGMETRICS Performance Evaluation Review10.1145/2627534.262756441:4(98-101)Online publication date: 17-Apr-2014
https://dl.acm.org/doi/10.1145/2627534.2627564
Yilmaz OTorun MAkansu A(2014)A fast derivation of Karhunen-Loeve transform kernel for first-order autoregressive discrete processACM SIGMETRICS Performance Evaluation Review10.1145/2627534.262755541:4(61-64)Online publication date: 17-Apr-2014
https://dl.acm.org/doi/10.1145/2627534.2627555
Rallapalli SMa QSong HBaldi MMuthukrishnan SQiu L(2014)Modeling the value of information granularity in targeted advertisingACM SIGMETRICS Performance Evaluation Review10.1145/2627534.262754741:4(42-45)Online publication date: 17-Apr-2014
https://dl.acm.org/doi/10.1145/2627534.2627547
Al-Ghamdi M(2014)Proactive Workload Forecasting Model with Dynamic Resource Allocation for Modern Internet ApplicationProceedings of the 2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing10.1109/UCC.2014.50(396-403)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1109/UCC.2014.50
Cerotti DGribaudo MKrüger IPiazzolla PSeracini FSerazzi G(2014)Throughput Maximization with Multiclass Workloads and Resource ConstraintsAnalytical and Stochastic Modeling Techniques and Applications10.1007/978-3-319-08219-6_17(238-252)Online publication date: 2014
https://doi.org/10.1007/978-3-319-08219-6_17
Tancrez JChevalier PSemal P(2013)A Tight Bound on the Throughput of Queueing Networks with BlockingAnalytical and Stochastic Modeling Techniques and Applications10.1007/978-3-642-39408-9_28(396-415)Online publication date: 2013
https://doi.org/10.1007/978-3-642-39408-9_28
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