A very well known and popular technique for the performance evaluation of current computer and operating systems is analytical modeling based on queueing networks because it is easy to understand and use compared to other modeling techniques. For so called product form queueing networks eecient exact and approximate analysis algorithms exist but most queueing networks of realistic systems do no...

While many single station queues possess explicit forms for their equilibrium probabilities, queueing networks are more problematic. Outside of the class of product form networks (e.g., Jackson, Kelly and BCMP networks), one must resort to bounds, simulation, asymptotic studies or approximations. By focusing on a class of two-station closed reentrant queueing networks under the last buffer firs...

A modern data communication system consists of a network of information processing stations or nodes interconnected by data transmission channels or links. Information flows from node to node in packetized data units. These packets can originate from a variety of sources, and the paths over which they traverse the network can intersect, so that multiple packets are often intended for delivery o...

The analysis of queueing networks with blocking reached its peak in the 1980s and early 1990s. Several elegant decomposition-based approximation techniques were developed, and in this paper, the author gives a personal account of some of these techniques and also some of the players involved. The lessons learnt from analyzing such queueing networks have been useful in developing decomposition-b...

The contrast between the stochasticity of biochemical networks and the regularity of cellular behavior suggests that biological networks generate robust behavior from noisy constituents. Identifying the mechanisms that confer this ability on biological networks is essential to understanding cells. Here we show that queueing for a limited shared resource in broad classes of enzymatic networks in...