Abstract
Equilibrium behavior of nonseparable Markovian networks is, to a presently limited extent, susceptable to rapid, precise numerical calculuation. At issue in extending the application of numerical techniques is the exploitation of algebraic structure in the equilibrium equations of the network. Such structure is usually inherent in the network character of the original problem.
Some approaches to the use of network-algebraic structure in the numerical solution for equilibrium probabilities of Markovian networks will be surveyed. Recent results for quasi-geometric solutions in quasi-birth-and-death systems are related to more recent algebraic network decomposition techniques.
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
Baskett, F., and F. P. Gomez, “Processor Sharing in a Central Server Queueing Model” Proc. of the Sixth Ann. Princeton Conf. on Information Sciences and Systems“, Princeton University (March 1972)
Burke, P. J. “The Output of a Queueing System”, Operations Research, 4, 6, 699–704 (December, 1956 ).
Disney, R. L., “A Matrix Solution for the Two server Queue with Overflows”, Management Science, 19, 254–265 (1972).
Disney, R. L., and W. P. Cherry, “Some Topics in Queueing Network Theory”, this volume.
Evans, R. V., “Numerical Methods for Queues with Complex Service Rates” Research Report No. 82, Management Sciences Research Project, University of California, Los Angeles (1963).
Evans, R. V., “Geometric Distribution in Some Two Dimensional Queueing Systems”, Operations Research, 15, 5, 830–846 (September/ October 1967 ).
Gordon, W. J. and G. F. Newell, “Cyclic Queueing Systems with Restricted Queue Lengths”, Operations Research, 15, 2, 266–277 (April 1967).
Irani, K. B., and V. L. Wallace, “A system for the Solution of Simple Stochastic Networks”,Technical Report No. 31, Systems Engineering Laboratory, University of Michigan, Ann Arbor (1969).
Jackson, J. R., “Jobshop-like Queueing Systems”, Management Science, 10, 1, 131–142 (October 1963).
Nomura, K., private communication, 1973.
Reich, E., “Waiting Times when Queues are in Tandem”, Ann. Math. Stat., 28, 2, 768–773 (1957).
Wallace, V. L., “The Solution of Quasi Birth and Death Processes Arising from Multiple Access Computer Systems”, Doctoral Dissertation, Department of Electrical Engineering, University of Michigan, Ann Arbor, 1969.
Wallace, V. L., “Toward an Algebraic Theory of Markovian Networks, Proc. Symp. Computer-Communications Networks and Teletraffic New York: Polytechnic Press, (1973).
Wallace, V. L. and R. S. Rosenberg, “Markovian Models and Numerical Analysis of Computer System Behavior”, Proc. AFIPS Spring Joint Computer Conference, 28, 141–148. ( New Jersey: AFIPS Press, 1966 ).
Wallace, V. L., and R. S. Rosenberg, “RQA-1. The Recursive Queue Analyzer”, Technical Report No. 2, Systems Engineering Laboratory, University of Michigan, Ann Arbor, Michigan (February 1966).
Whitlock, J. S. “Modeling Computer Systems with Time Varying Markov Chains”, Doctoral Dissertation, Department of Computer Science, University of North Carolina, Chapel Hill, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Wallace, V.L. (1974). Algebraic Techniques for Numerical Solution of Queueing Networks. In: Clarke, A.B. (eds) Mathematical Methods in Queueing Theory. Lecture Notes in Economics and Mathematical Systems, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80838-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-80838-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06763-4
Online ISBN: 978-3-642-80838-8
eBook Packages: Springer Book Archive