Performance analysis of tandem queues with small buffers

In this paper we present an approximation for the performance analysis of single-server tandem queues with small buffers and generally distributed service times. The approximation is based on decomposition of the tandem queue in subsystems, the parameters of which are determined by an iterative algorithm. By using a detailed description of the arrival and service processes at the subsystems, we obtain an accurate approximation of performance characteristics such as throughput and mean sojourn time, which substantially outperforms a former method.