Analytical lower and upper bounds for the throughput of closed queueing networks with
single and delay (infinite) servers are studied in this paper. The numerical evaluation of …

Analytic queueing network models are being used to analyze various optimization problems
such as server allocation, design and capacity issues, optimal routing, and workload …

Two classes of performance bounds for separable queueing networks are presented, one
for single-chain networks and one for multichain networks. Unlike most bounds for single …

Closed queueing networks have been widely used to model many types of service networks.
For example, a closed queueing network model for multi-tier Internet services and …

This list of references is an updated version of an earlier bibliography by Perros [153]. It
contains published papers, technical reports, and Ph. D. theses, in which analytic (exact or …

Queueing network models are widely used to analyze the performance of automated
manufacturing facilities and computer systems. These models aid the designers/operators of …

Consider a closed queueing network (CQN) with a set of stations; the service rate at each
station can be any function of the queue length at that station. Upper and lower bounds are …

Monotonicity of the throughput of an open queueing network in the interarrival and service
times Page 1 Monotonicity of the throughput of an open queueing network in the interarrival …

Equivalencies between open and closed models of queueing networks with finite buffers are
investigated. Interarrival times in open networks and service times are assumed to be …

To use queueing theory for analyzing real computing systems, we may make assumptions
that are strictly speaking untrue. The problem is especially severe for multiclass systems with …