Comparing Short-Memory Charts to Monitor the Traffic Intensity of Single Server Queues
Author:
Santos Marta,Morais Manuel Cabral,Pacheco António
Abstract
Abstract
This paper describes the application of simple quality control charts to monitor the traffic intensity of single server queues, a still uncommon use of what is arguably the most successful statistical process control tool.
These charts play a vital role in the detection of increases in the traffic intensity of single server queueing systems such as the
{M/G/1}
,
{GI/M/1}
and
{GI/G/1}
queues.
The corresponding control statistics refer solely to a customer-arrival/departure epoch as opposed to several such epochs, thus they are termed short-memory charts.
We compare the RL performance of those charts under three out-of-control scenarios referring to increases in the traffic intensity due to:
a decrease in the service rate while the arrival rate remains unchanged;
an increase in the arrival rate while the service rate is constant;
an increase in the arrival rate accompanied by a proportional decrease in the service rate.
These comparisons refer to a broad set of interarrival and service time distributions, namely exponential, Erlang, hyper-exponential, and hypo-exponential.
Extensive results and striking illustrations are provided to give the quality control practitioner an idea of how these charts perform in practice.
Funder
Fundação para a Ciência e a Tecnologia
Publisher
Walter de Gruyter GmbH
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Statistics, Probability and Uncertainty,Safety, Risk, Reliability and Quality,Statistics and Probability
Reference72 articles.
1. On ARL-unbiased charts to monitor the traffic intensity of a single server queue;Proceedings of the 12th. International Workshop on Intelligent Statistical Quality Control,2016
2. Telefon-ventetider. Et stykke sandsynlighedsregning (The application of the theory of probability in telephone administration);Mat. Tidsskrift B (Copenhagen),1920
3. Control of traffic intensity in a queue—a method based on SPRT;Opsearch,1984
4. Markov chain approximation methods in a class of level-crossing problems;Oper. Res. Lett.,1997
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献