Abstract
This paper compares the width of confidence intervals for the traffic intensity inM/E k/1 queueing systems with three methods-Lilliefors' method, a second method based on the number of arrivals during the service period, and a third method using censored observations, in which only those service periods with no arrivals are observed. It is shown that the width of confidence intervals, based on the number of arrivals during the service period, is narrower than for other methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allen, A. O. (1978).Probability, Statistics and Queueing Theory with Computer Science Applications.Academic Press, New York.
Bhat, U. N. (1987). A sequential technique for the control of traffic intensity in Markovian queues.Ann. Oper. Res., 8, 151–164.
Bhat, U. N. and Rao, S. S. (1987). Statistical analysis of queueing systems.QUESTA, 1, 217–247.
Cox, D. R. (1965). Some problems of statistical analysis connected with congestion.Proc. Symp. on Congestion Theory. (eds. W. L. Smith and W. E. Wilkinson), University of North Carolina, Chapel Hill, N.C.
Gross, D. and Harris, C. M. (1985).Fundamentals of Queueing Theory.Second edition.Wiley, New York.
Lilliefors, H. W. (1966). Some confidence intervals for queues.Oper. Res., 14, 723–727.
Sprott, D. A. (1973). Normal likelihoods and their relation to large sample theory of estimation.Biometrika, 60, 457–465.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jain, S. Comparison of confidence intervals of traffic intensity forM/E k/1 queueing systems. Statistical Papers 32, 167–174 (1991). https://doi.org/10.1007/BF02925489
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02925489