Hostname: page-component-7c8c6479df-ph5wq Total loading time: 0 Render date: 2024-03-28T11:32:54.750Z Has data issue: false hasContentIssue false

Asymptotic Properties of a Recursive Procedure for Simultaneous Estimation

Published online by Cambridge University Press:  27 July 2009

Martin I. Reiman
Affiliation:
AT&T Bell Laboratories Murray Hill, New Jersey 07974

Abstract

In this paper we consider a problem that arises in estimating the heavy traffic limit of a sojourn time distribution in a queueing network during the course of a medium traffic simulation. We need to estimate α = E[f(γ, M)], where γ is an unknown constant and M a random variable. More specifically, we are given an iid sequence of random vectors {(Xi, Mi), 1 ≤ i ≤ n}, with γ = E[Xi] and Mi having the same distribution as M.

For known γ, we have a standard estimation problem, which we describe here. The standard estimate is unbiased and asymptotically (as n → 8 ) consistent. There is also a central limit theorem for this estimator. For unknown γ, we provide two estimation procedures, one that requires two passes through the data (as well as storage of {Mi, 1 ≤ i ≤ n}), and another one, which is recursive, requiring only one pass through and bounded storage. The estimators obtained from these two procedures are shown to be strongly consistent, and central limit theorems are also proven for them.

Type
Articles
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Abramowitz, M. & Stegun, I.A. (1964). Handbook of mathematical functions with formulas, graphs, and mathematical tables. Washington D.C.: National Bureau of Standards.Google Scholar
Billingsley, P. (1968). Convergence of probability measures. New York: Wiley.Google Scholar
Breiman, L. (1968). Probability. Reading, MA: Addison-Wesley.Google Scholar
Chan, T.F., Golub, G.H., & LeVeque, R.J. (1983). Algorithms for computing the sample variance: analysis and recommendations. Amer. Statist. 37: 242247.Google Scholar
Chung, K.L. (1974). A course in probability theory, 2nd ed.New York: Academic Press.Google Scholar
Ethier, S.N. & Kurtz, T.G. (1986). Markov processes–characterization and convergence. New York: Wiley.Google Scholar
Reiman, M.I. (1988). A multiclass feedback queue in heavy traffic. Adv. Appl. Prob. 20: 179207.Google Scholar
Reiman, M.I. & Simon, B. (1990). A network of priority queues in heavy traffic: one bottleneck station. Queueing Systems 6: 3358.Google Scholar
Reiman, M.I., Simon, B., & Willie, J.S. (1988). Simterpolations: a simulation based interpolation approximation for queueing systems. Unpublished manuscript.Google Scholar