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)
A tree convolution algorithm for the solution of queueing networks
Communications of the ACM
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Validated Distributed System Performance Model
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Parametric analysis of queuing networks
IBM Journal of Research and Development
| Hi-index | 0.00 |
Two general-purpose algorithms exist for the solution of product-form queueing network models: convolution and mean-value analysis. Because the space and time complexity of both of these algorithms is exponential in the number of classes in the model, they are for most purposes useless for the solution of networks with many jobs (and few jobs per class). We describe a new algorithm, having polynomial space and time complexity, that is specifically designed for the solution of queueing networks in which the classes exhibit highly symmetric patterns and in which the service stations, whose behavior is the primary object of the evaluation, have identical service characteristics. This category of queueing networks arises naturally in the modeling of local area networks.