Home Comparing Short and Long-Memory Charts to Monitor the Traffic Intensity of Single Server Queues
Article
Licensed
Unlicensed Requires Authentication

Comparing Short and Long-Memory Charts to Monitor the Traffic Intensity of Single Server Queues

  • Marta Santos , Manuel Cabral Morais EMAIL logo and António Pacheco
Published/Copyright: January 30, 2019
Become an author with De Gruyter Brill

Abstract

The traffic intensity (ρ) is a vital parameter of queueing systems because it is a measure of the average occupancy of a server. Consequently, it influences their operational performance, namely queue lengths and waiting times. Moreover, since many computer, production and transportation systems are frequently modelled as queueing systems, it is crucial to use control charts to detect changes in ρ. In this paper, we pay particular attention to control charts meant to detect increases in the traffic intensity, namely: a short-memory chart based on the waiting time of the n-th arriving customer; two long-memory charts with more sophisticated control statistics, and the two cumulative sum (CUSUM) charts proposed by Chen and Zhou (2015). We confront the performances of these charts in terms of some run length related performance metrics and under different out-of-control scenarios. Extensive results are provided to give the quality control practitioner a concrete idea about the performance of these charts.

MSC 2010: 62P30; 60K20

Award Identifier / Grant number: UID/Multi/04621/2013

Funding statement: This work was partially supported by FCT (Fundação para a Ciência e a Tecnologia) through project UID/Multi/04621/2013.

Acknowledgements

We are greatly indebted to the Referee who selflessly devoted invaluable time to scrutinize this work.

References

[1] U. N. Bhat, A control technique for the parameters of stochastic processes, Bull. Inst. Internat. Statist. 44 (1971), no. 2, 94–98. Search in Google Scholar

[2] U. N. Bhat, A statistical technique for the control of traffic intensity in Markovian queue, Ann. Oper. Res. 8 (1987), 151–164. 10.1007/BF02187088Search in Google Scholar

[3] U. N. Bhat and I. Sahin, Transient behavior of queuing systems M/D/1, M/Ek/1, D/M/1 and Ek/M/1, Technical Memo M135, Department of Operations Research, Case Western University, Cleveland, 1969. Search in Google Scholar

[4] U. N. Bhat and S. Subba Rao, A statistical technique for the control of traffic intensity in the queuing systems M/G/1 and GI/M/1, Operations Res. 20 (1972), 955–966. 10.1287/opre.20.5.955Search in Google Scholar

[5] D. Brook and D. A. Evans, An approach to the probability distribution of cusum run length, Biometrika 59 (1972), 539–549. 10.1093/biomet/59.3.539Search in Google Scholar

[6] N. Chen, Y. Yuan and S. Zhou, Performance analysis of queue length monitoring of M/G/1 systems, Naval Res. Logist. 58 (2011), no. 8, 782–794. 10.1002/nav.20483Search in Google Scholar

[7] N. Chen and S. Zhou, CUSUM statistical monitoring of M/M/1 queues and extensions, Technometrics 57 (2015), no. 2, 245–256. 10.1080/00401706.2014.923787Search in Google Scholar

[8] S.-H. Kim, C. Alexopoulos, K.-L. Tsui and J. R. Wilson, A distribution-free tabular cusum chart for autocorrelated data, IIE Trans. 39 (2007), 317–330. 10.1080/07408170600743946Search in Google Scholar

[9] M. C. Morais and S. Knoth, On ARL-unbiased charts to monitor the traffic intensity of a single server queue, Proceedings of the XII. International Workshop on Intelligent Statistical Quality Control Hamburg 2016, Front. Stat. Qual. Control 12, Springer, Heidelberg (2018), 217–242. 10.1007/978-3-319-75295-2_5Search in Google Scholar

[10] M. C. Morais and A. Pacheco, On stochastic ordering and control charts for traffic intensity, Sequential Anal. 35 (2016), no. 4, 536–559. 10.1080/07474946.2016.1238266Search in Google Scholar

[11] A. M. Pacheco Pires, Sistemas M/M/r/n: Comparação de sistemas com iguais taxas de chegadas e de serviço (M/M/r/n systems: Comparing systems with the same arrival and service rates), Master’s thesis, Department of Mathematics, Instituto Superior Técnico, University of Lisbon, Lisbon, 1990. Search in Google Scholar

[12] A. G. Pakes, Queueing theory, Encyclopedia of Statistical Sciences. Volume 7, John Wiley & Sons, New York (1986), 483–489. Search in Google Scholar

[13] N. U. Prabhu, Foundations of queueing theory, Int. Ser. Oper. Res. Management Sci. 7, Kluwer Academic Publishers, Boston, 1997. 10.1007/978-1-4615-6205-4Search in Google Scholar

[14] M. D. M. Santos, On control charts and the detection of increases in the traffic intensity of queueing systems, Master’s thesis, Department of Mathematics, Instituto Superior Técnico, University of Lisbon, Lisbon, 2016. Search in Google Scholar

[15] M. Santos, M. C. Morais and A. Pacheco, Comparing short-memory charts to monitor the traffic intensity of single server queues, Stoch. Qual. Control 33 (2018), no. 1, 1–21. 10.1515/eqc-2017-0030Search in Google Scholar

[16] MathWorks, Matlab, Version 9.0 (R2016a), 2016. Accessed from www.mathworks.com on 2016-06-08. Search in Google Scholar

Received: 2018-09-18
Revised: 2018-12-27
Accepted: 2019-01-15
Published Online: 2019-01-30
Published in Print: 2019-06-01

© 2019 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 26.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/eqc-2018-0026/html
Scroll to top button