Approximate Analysis for the Merge Configuration of an Open Queueing Network with Blocking

Abstract

Abstract A merge configuration of open queueing networks with exponential service times and finite buffers is analysed. We offer an iterative algorithm to approximate the steady-state probabilities for each queue of the system. The procedure decomposes the queueing network into individual queues and analyses each individual queue in isolation. An M/M/l/N or M/G/l/N model is used for the analysis of the merging queues; an M/M/l/N with state dependent arrival rates is used for the receiving queue. The approximation method is easy to implement, requires little memory, is computationally fast and yields very accurate results.