Properties and performance modelling of finite buffer M/G/l/K networks

摘要

Finite buffer, single-server queueing systems and networks are difficult to analyze since the length of time a customer spends in the system does not follow the Markovian property. A two-moment approximation schema is developed for the probability distribution of M/G/l/K systems and extended to the analysis of M/C/l/K queueing networks. The general purpose of this paper is to develop a flexible and practical transform-free approach for computing the probability distribution and performance measures of the system as well as identify the underlying properties of these systems. It is shown that for most performance measures, a sigmoid or S-shaped curve with an inflection point at p = 1 appears as K→∞. This has direct implications for the analysis and optimization of such systems. The performance modelling of the M/C/l/K queueing networks of general topologies along with extensive numerical results accompany the paper along with the linear concave performance measures for these systems.