Approximate analysis of general queuing networks

Authors:
K. M. Chandy;U. Herzog;L. Woo
Affiliations:
University of Texas, Austin, Texas;University of Stuttgurt, Stuttgart, West Germany;IBM Thomas J . Watson Research Center, Yorktown Heights, New York
Venue:
IBM Journal of Research and Development
Year:
1975

Citing 2
Cited 8

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Design of Real-Time Computer Systems

Design of Real-Time Computer Systems

Approximate mean value analysis technique for non-product form solution stochastic Petri nets: an application to stochastic marked graphs

PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Modeling Bus Contention and Memory Interference in a Multiprocessor System

IEEE Transactions on Computers
Load Redistribution Under Failure in Distributed Systems

IEEE Transactions on Computers
A unified framework for the bottleneck analysis of multiclass queueing networks

Performance Evaluation
Queueing networks

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Queuing network of scale free topology: on modelling large scale network

The Journal of Supercomputing
Approximate techniques for modeling the performance of complex systems

Computer Languages
Active memory controller

The Journal of Supercomputing

Quantified Score

Hi-index	0.02

Visualization

Abstract

An approximate iterative technique for the analysis of complex queuing networks with general service times is presented. The technique is based on an application of Norton's theorem from electrical circuit theory to queuing networks which obey local balance. The technique determines approximations of the queue length and waiting time distributions for each queue in the network. Comparison of results obtained by the approximate method with simulated and exact results shows that the approximate method has reasonable accuracy.