Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
Journal of the ACM (JACM)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Computational algorithms for product form queueing networks
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Some Extensions to Multiclass Queueing Network Analysis
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Optimal routing in networks with flow-controlled virtual channels
Proceedings of the Computer Network Performance Symposium
An Analysis of the Tree Convolution Algorithm
An Analysis of the Tree Convolution Algorithm
A Simple Derivation of the MVA and LBANC Algorithms From the ConvolutionAlgorithm
A Simple Derivation of the MVA and LBANC Algorithms From the ConvolutionAlgorithm
The approximate solution of large queueing network models
The approximate solution of large queueing network models
Modelling and analysis of flow-controlled computer communication networks
Modelling and analysis of flow-controlled computer communication networks
RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
Journal of the ACM (JACM)
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains
IEEE Transactions on Computers
Modeling, analysis, and optimal routing of flow-controlled communication networks
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
PAM-a noniterative approximate solution method for closed multichain queueing networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
Asymptotically optimal importance sampling for product-form queuing networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient decomposition methods for the analysis of multi-facility blocking models
Journal of the ACM (JACM)
Monte Carlo summation and integration applied to multiclass queuing networks
Journal of the ACM (JACM)
A tree-structured mean value analysis algorithm
ACM Transactions on Computer Systems (TOCS)
An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates
IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for semi-homogeneous queueing network models
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
An overview of performance prediction in MVS systems and SNA networks
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Solving product form stochastic networks with Monte Carlo summation
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Product Form Queueing Networks
Performance Evaluation: Origins and Directions
Analysis of Queueing Network Models with population size constraints and delayed blocked customers
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Simple Derivation of the MVA and LBANC Algorithms from the Convolution Algorithm
IEEE Transactions on Computers
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
The solution of homogeneous queueing networks with many job classes
Journal of Systems and Software
Using enterprise architecture analysis and interview data to estimate service response time
The Journal of Strategic Information Systems
| Hi-index | 48.23 |
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.