Statistical analysis of single-server loss queueing systems

TL;DR

This paper derives statistical bounds for output characteristics of single-server loss queueing systems using empirical data and Kolmogorov's statistics, providing insights into system performance based on large sample analysis.

Contribution

It introduces a novel application of Kolmogorov's statistics to derive bounds for queueing system outputs using empirical input data.

Findings

Derived bounds for system performance metrics

Applied Kolmogorov's statistics to queueing data

Provided methods for large sample analysis

Abstract

In this article statistical bounds for certain output characteristics of the $M/GI/1/n$ and $GI/M/1/n$ loss queueing systems are derived on the basis of large samples of an input characteristic of these systems, such as service time in the $M/GI/1/n$ queueing system or interarrival time in the $GI/M/1/n$ queueing system. The analysis of this article is based on application of Kolmogorov's statistics for empirical probability distribution functions.