A tree convolution algorithm for the solution of queueing networks
- 1 March 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (3), 203-215
- https://doi.org/10.1145/358061.358075
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.Keywords
This publication has 15 references indexed in Scilit:
- Dynamic Scaling and Growth Behavior of Queuing Network Normalization ConstantsJournal of the ACM, 1982
- Optimal routing in networks with flow-controlled virtual channelsACM SIGMETRICS Performance Evaluation Review, 1982
- LinearizerCommunications of the ACM, 1982
- Congestion Control of Packet Communication Networks by Input Buffer Limits—A Simulation StudyIEEE Transactions on Computers, 1981
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980
- Queuing Networks with Population Size ConstraintsIBM Journal of Research and Development, 1977
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Approximate Analysis of General Queuing NetworksIBM Journal of Research and Development, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973