The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.

The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, several authors have proved heavy traffic limit theorems to justify the approximation of queueing networks by reflected Brownian motions (RBM's). Based on these theorems, s...

The traac equations are a set of linear equations, which are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traac equations are therefore of great importance. This note provides a necessary and suucien...

Xiaoming Zhu Joseph M. Kahn University of California Department of Electrical Engineering and Computer Sciences 307 Cory Hall Berkeley, California 94720-1772 E-mail: [email protected] Abstract. Buffering with optical delay lines (ODLs) in optical packetswitching networks is a way to mitigate network contention. We study queueing models of ODLs in synchronous and asynchronous optical packe...

A network of single server queues with routing is considered. These networks have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. This stochastic model is insensitive. A large deviation principle for the stationary distribution of these queueing networks is found. Its rate function has a dual formul...

Java Modelling Tools (JMT) is a suite of open source applications for performance evaluation and workload characterization of computer and communication systems based on queueing networks. JMT includes tools for workload characterization (JWAT), solution of queueing networks with analytical algorithms (JMVA), simulation of general-purpose queueing models (JSIM), bottleneck identification (JABA)...

This thesis applies recent advances in the field of robust optimization to the optimal control of multiclass queueing networks. We develop models that take into account the uncertainty of interarrival and service time in multiclass queueing network problems without assuming a specific probability distribution, while remaining highly tractable and providing insight into the corresponding optimal...

Queueing networks model workflow in distributed computing systems and networks. They predict throughput, queue length, response time, and bottlenecks with simple, fast algorithms.