Abstract
In this paper, we develop a Linearizer-type approximation technique for the analysis of large multiple-chain queueing networks that contain multi-server first-come, first-served queues with service times that are chain dependent. Use is made of a waiting time approximation based on Mean Value Analysis that has recently been developed by Souza e Silva and Muntz. The storage requirements of the iterative scheme are of the order of NR2, and the computational requirements are of the order of NR3, where N is the number of nodes and R is the number of closed routing chains. In comparing the results obtained with published empirical stress test results, the accuracy of the Linearizer-type approximation is found to be acceptable. An application in which the proposed iterative technique is found to be particularly useful is in the analysis of large queueing networks with nested passive resources and many closed routing chains, of the type arising in the modeling of computer systems with multi-programming constraints and of computer-communication networks with window flow controls.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baskett, K.M. Chandy, R.R. Muntz, and F. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” J. ACM 22, pp. 248–260, 1975.
A. Brandwajn, “A Model of a Time-Sharing System Solved Using Equivalence and Decomposition Methods,” Acta Informatica 4, 1, pp. 11–47, 1974.
A. Brandwajn, “Fast Approximate Solution of Multiprogramming Models,” Proc. 1982 ACM SIGMETRICS Conf. Meas. Mod. Comp. Sys., pp. 141–149, 1982.
R.M. Bryant, A.E. Krzesinski, M.S. Lakshmi, and K.M. Chandy, “The MVA Priority Approximation,” ACM Trans. Computer Systems 2, 4, pp. 335–359, 1984.
K.M. Chandy, and D. Neuse, “Linearizer: A Heuristic Algorithm for Queueing Network Models of Computing Systems,” Commun. ACM 25, 2, pp. 126–134, 1982.
P.A. Jacobson, and E.D. Lazowska, “Analyzing Queueing Networks with Simultaneous Resource Possession,” Comm. ACM 25, pp. 142–151, 1982.
P.A. Jacobson, and E.D. Lazowska, “A Reduction Technique for Evaluating Queueing Networks with Serialization Delays,” in Performance ‘83, North-Holland, Amsterdam, 1983.
A. Krzesinski, and J. Greyling, “Improved Linearizer Methods for Queueing Networks with Queue Dependent Centers,” Proc. 1984 ACM SIGMETRICS Conf Meas. Mod. Comp. Sys., pp. 41–50, 1984.
A. Krzesinski, and P. Teunissen, “Multiclass Queueing Networks with Population Constrained Subnetworks,” Proc. 1985 ACM SIGMETRICS Conf. Meas. Mod. Comp. Sys., pp. 128–139, 1985.
S.S. Lavenberg (Ed.), Computer Performance Modeling Handbook, Academic Press, New York, 1983.
S.S. Lavenberg, and M. Reiser, “Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with Multiple Types of Customers,” J. Appl. Prob. 17, pp. 1048–1061, 1980.
E.D. Lazowska, and J. Zahorjan, “Multiple Class Memory Constrained Queueing Networks,” Proc. 1982 ACM SIGMETRICS Conf. Meas. Mod. Comp. Sys, pp. 130–140, 1982.
D. Neuse, “Approximate Analysis of Large and General Queueing Networks,” Ph.D. Dissertation, The University of Texas at Austin, 1982.
M. Reiser, and S.S. Lavenberg, “Mean Value Analysis of Closed Multichain Queueing Networks,” J. ACM 27, pp. 313–322, 1980.
E. de Souza e Silva, and R.R. Muntz, “Approximate Solutions for a Class of Non-Product Form Queueing Network Models,” Performance Evaluation 7, pp. 221–242, 1987.
E. de Souza e Silva, S.S. Lavenberg, and R.R. Muntz, “A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains,” IEEE Trans. Computers 35, 5, pp. 419–430, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Plenum Press, New York
About this chapter
Cite this chapter
Conway, A.E. (1989). Fast Approximate Solution of Queueing Networks with Multi-Server Chain-Dependent FCFS Queues. In: Puigjaner, R., Potier, D. (eds) Modeling Techniques and Tools for Computer Performance Evaluation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0533-0_25
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0533-0_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-7853-5
Online ISBN: 978-1-4613-0533-0
eBook Packages: Springer Book Archive