Motivated by applications in biological systems, we show for certain multiclass queueing networks that time-dependent distributions for the multiclass queue-lengths can have a factorized form which reduces the problem of computing such distributions to a similar problem for related single-class queueing networks. We give an example of the application of this result to an enzymatic processing ne...

Open restricted queueing networks give rise to the phenomenon of deadlock, whereby some customers may be unable to ever leave a server due to mutual blocking. This paper explores deadlock in queueing networks with limited queueing capacity, presents a method of detecting deadlock in discrete event simulations, and builds Markov chain models of these deadlocking networks. The three networks for ...

In this paper we study message flow processes in distributed simulators of open queueing networks. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the “external” arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain “natural” modelling construct for ...

We address in this paper the buffer allocation problem in general service, finite waiting room, multi-server queueing networks. Several instances are examined using an approximation method to estimate the performance of the queueing networks and an iterative search method is developed to find the optimal buffer allocation within the network. The coefficient of variation of the service time is s...

This paper establishes structural properties of the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks including tandems, cycles and fork-join networks with general blocking and starvation as well as certain networks with splitting-merging of traac streams, to deduce conca...