Parametric estimation of tail probabilities for the single-server queue

Parametric estimation of tail probabilities for the single-server queue

0.00 Avg rating0 Votes
Article ID: iaor19971665
Country: United States
Volume: 1
Issue: 1
Start Page Number: 449
End Page Number: 462
Publication Date: Jan 1997
Journal: Frontiers in Queueing
Authors: ,
Abstract:

In this paper, the authors consider the question of how long the arrival process to the single-server queue needs to be observed in order to accurately estimate the long-run fraction of time that the workload exceeds y. They assume that the arrival process can be modeled parametrically. In such a parametric context, the present results suggest that one typically needs to observe the arrival process over a time horizon that is large relative to y2. This conclusion appears to hold regardless of whether the arrival process model exhibits complex dependencies or not.

Reviews

Required fields are marked *. Your email address will not be published.