We consider a model of an open exponential queuing network where each node comprises
several multi-class MR/M/1 queues that share a common waiting space (a buffer) of limited …

Open exponential queuing networks are considered where each node in a network
represents several exponential servers with a joint waiting space (a buffer) of limited …

This paper presents an approximation method for analyzing open restricted queueing
networks with exponential service time and Poisson arrivals. Analysis is made by node-by …

An arbitrary configuration of an open queueing network with exponential service times and
finite buffers is analysed. We offer an iterative procedure for approximating the marginal …

Queueing networks with finite capacity queues and blocking are applied to model systems
with finite resources and population constraints, such as computer and communication …

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 …

The paper presents a new approach for estimating the throughput of a closed queueing
network with exponential servers, finite buffer capacity and a blocking after service …

An approximation procedure is proposed for the analysis of general queueing networks with
finite capacity. A customer arriving to a node with fully occupied buffer is lost. Throughput …

An arbitrary configuration of an open queueing network with exponential service times and
finite buffers is analyzed. We offer an iterative procedure for approximating the marginal …

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 …