Simon S. Lam
Abstract
A new algorithm called the tree convolution algorithm, for the computation of normalization constants and performance measures of product-form queueing networks, is presented. Compared to existing algorithms, the algorithm is very efficient in the solution of networks with many service centers and many sparse routing chains. (A network is said to have sparse routing chains if the chains visit, on the average, only a small fraction of all centers in the network.) In such a network, substantial time and space savings can be achieved by exploiting the network's routing information. The time and space reductions are made possible by two features of the algorithm: (1) the sequence of array convolutions to compute a normalization constant is determined according to the traversal of a tree; (2) the convolutions are performed between arrays that are smaller than arrays used by existing algorithms. The routing information of a given network is used to configure the tree to reduce the algorithm's time and space requirements; some effective heuristics for optimization are described. An exact solution of a communication network model with 64 queues and 32 routing chains is illustrated.
- 1 Bard, Y. Some extensions to multiclass queueing network analysis. Proc. 4th International Symposium on Modelling and Performance Evaluation of Computer Systems. Vienna, Austria, Feb. 1979. Google Scholar
Digital Library
- 2 Baskett F., Chandy, K. M., Muntz, R. R., and Palacios, F. Open, closed and mixed networks of queues with different classes of customers. ACM. 22, 2 (April 1975) 248-260. Google ScholarDigital Library
- 3 Bruel, S. C. and Balbo, G. Computational Algorithms for Closed Queueing Networks. Elsevier, North-Holland, New York, 1980.Google Scholar
- 4 Buzen, J. P. Computational algorithms for closed queueing networks with exponential servers. Comm. ACM. 16, 9 (Sept. 1973) 527-531. Google ScholarDigital Library
- 5 Chandy, K. M., Herzog, U., and Woo L. S. Parametric analysis of queueing networks. IBM }. of Res. and Develop. 19, 1, (Jan. 1975) 43-49.Google Scholar
- 6 Chandy, K. M. and Neuse, D. Linearizer: A heuristic algorithm for queueing network models of computing systems. Comm. ACM. 25, 2 (Feb. 1982) 126-134. Google ScholarDigital Library
- 7 Chandy, K. M. and Sauer, C. H. Computational algorithms for product form queueing networks. Comm. ACM. 23, 10 (Oct. 1980) 537-583. Google ScholarDigital Library
- 8 Gerla, M. and Kleinrock, L. Flow control: A comparative survey. IEEE Trans. on Commun. COM 28, 4, (April 1980) 553-574.Google ScholarCross Ref
- 9 Kleinrock, L. Queueing Systems, Vol. 2: Computer Applications. Wiley- Interscience, New York, 1976, pp. 458-484.Google Scholar
- 10 Lam, S. S. Queueing networks with population size constraints. IBM I. at Res. and Develop. 21, 4, (July 1977) 370-378.Google Scholar
- 11 Lam, S. S. Dynamic scaling and growth behavior of queueing network normalization constants, }ACM. 29, 2 (April 1982) 492-513. Google ScholarDigital Library
- 12 Lam, S. S. A simple derivation of the MVA and LBANC algorithms from the convolution algorithm. Dept. of Computer Sciences, Univ. of Texas at Austin, Technical Report TR-184, November 1981. (To appear in IEEE Traes on Computers.) Google ScholarDigital Library
- 13 Lam, S. S. and Lien, Y. L. An analysis of the tree convolution algorithm. Dept. of Computer Sciences, Univ. of Texas at Austin, Technical Report TR-166, February 1980. Google ScholarDigital Library
- 14 Lam, S. S. and Lien, Y. L. Congestion control of packet communication networks by input buffer limits--A simulation study. IEEE Trans. on Computers G-30, 10, (Oct. 1981) 733-742.Google ScholarDigital Library
- 15 Lam, S. S. and Lien Y. L. Optimal routing in networks with flowcontrolled virtual channels. Performance Evaluation Review, 11, 1. (1982) 38-46. Google ScholarDigital Library
- 16 Lam, S. S. and Wang, I. W. Queueing network models of packet switching networks, part 2: Networks with population size constraints. Performance Evaluation. 2, 3, (1982), 161-180.Google ScholarCross Ref
- 17 Lavenberg, S. Closed multichain product form queueing networks with large population sizes. Prec. of Interface between Applied Probability and Computer Science, Boca Raton, Florida, Jan. 1981.Google Scholar
- 18 Lien, Y. L. Modeling and analysis of flow-controlled computer communication networks. Ph.D. Thesis, Dept. of Computer Sciences, Univ. of Texas at Austin, December 1981. Google ScholarDigital Library
- 19 Reiser, M. Numerical methods in separable queueing networks. Studies in Management Sci. 7, (1977) 113-142.Google Scholar
- 20 Reiser, M. A queueing network analysis of computer communication networks with window flow control. IEEE Trans. on Commun. COM- 27, 8, (Aug. 1979) 1199-1209.Google ScholarCross Ref
- 21 Reiser, M. Mean value analysis and convolutional method for queuedependent servers in closed queueing networks. Performance Evaluation, 1, 1, (1981) 7-18.Google ScholarCross Ref
- 22 Reiser, M. and Kobayashi, H. Queaeing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. Develop., 19, 3, (May 1975) 283-204.Google ScholarDigital Library
- 23 Reiser, M. and Lavenberg, S. S. Mean value analysis of closed multichain queueing networks. JACM, 27, 1, (April 1980) 313-322. Google ScholarDigital Library
- 24 Sauer, C. H. and Chandy, K. M. Computer Systems Performance Modeling. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.Google Scholar
- 25 Schweitzer, P. Approximate analysis of multiclass closed networks of queues. Int. Conf. Stochastic Control and Optimization, Amsterdam, 1979.Google Scholar
- 26 Wang, J. W. and Lam, S. S. Queueing network models of packet switching networks, part 1: Open networks. Performance Evaluation, 2, 1, (1982) 9-21.Google Scholar
- 27 Zahorjan, J. The approximate solution of large queueing network models. Ph.D. Thesis, available as Technical Report CSRG-122, Computer Systems Research Group, Univ. of Toronto, August 1980. Google ScholarDigital Library
Index Terms
- A tree convolution algorithm for the solution of queueing networks
Recommendations
Sojourn time approximations in queueing networks with feedback
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single ...
Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks
<P>This paper considers time-dependent Pht/Mt/s/c queueing nodes and small tandem networks of such nodes. We examine characteristics of the departure processes from a multiserver queueing node; in particular, we focus on solving for the first two time-...
Some Equivalence Results for Load-Independent Exponential Queueing Networks
In this paper we derive a number of results concerning the behavior of closed load-independent exponential queueing networks. It is shown that if the service rate of any station is increased (decreased), then the throughput of the network itself also ...
Comments