Proceedings ArticleDOI
HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems
Doug Neuse,K. Mani Chandy +1 more
- Vol. 11, Iss: 4, pp 195-212
Reads0
Chats0
TLDR
An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented, based on the aggregation theorem (Norton's theorem) of Chandy, Herzog and Woo.Abstract:
An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and non-exponential servers and several classes of jobs. The method is based on the aggregation theorem (Norton's theorem) of Chandy, Herzog and Woo.read more
Citations
More filters
Journal ArticleDOI
Entropy maximisation and queueing network models
TL;DR: This paper traces the progress achieved so far towards the creation of ME and MRE product-form approximations and related algorithms for the performance analysis of general Queueing Network Models (QNMs) and indicates potential research extensions in the area.
Journal ArticleDOI
The MVA priority approximation
TL;DR: A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed-, open-, and mixed-type multiclass queuing networks containing Preemptive Resume and nonpreemptive Head-Of-Line priority service centers.
Journal ArticleDOI
Solving Semi-Open Queuing Networks
Jing Jia,Sunderesh S. Heragu +1 more
TL;DR: This work first study an SOQN with a single class of jobs in tandem configuration and then extends the study to multiclass configurations, building a method based on an existing product-form approximation method for general, multiclass closed networks.
Stochastic Models for Order Picking Systems
TL;DR: New stochastic models are developed for the performance evaluation of several highly state-of-the-art warehousing systems that adequately describe and predict the consequences of variability in, e.g. order arrivals, and picking times on the performance of a warehousing system.
Proceedings ArticleDOI
A queueing network model of an edge optical burst switching node
TL;DR: This work model the edge OBS node as a closed nonproduct-form queueing network, with multiple heterogeneous classes, and develops a suite of approximate decomposition algorithms to analyze it, which have a good accuracy and provide insight into the effect of various system parameters on the performance.
References
More filters
Journal ArticleDOI
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
TL;DR: Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
Journal ArticleDOI
Computational algorithms for closed queueing networks with exponential servers
TL;DR: Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers based on two-dimensional iterative techniques which are highly efficient and quite simple to implement.
Journal ArticleDOI
Approximate analysis of general queuing networks
K. M. Chandy,U. Herzog,L. Woo +2 more
TL;DR: An approximate iterative technique based on an application of Norton's theorem from electrical circuit theory to queuing networks which obey local balance determines approximations of the queue length and waiting time distributions for each queue in the network.
Journal ArticleDOI
Product Form and Local Balance in Queueing Networks
TL;DR: In this article, the authors investigated the relationship between station and local balance in queues and networks of queues and generalize previous results on local balance to arbitrary differentiable service distribution functions.