Hostname: page-component-6898cfcb55-cbk24 Total loading time: 0 Render date: 2026-11-11T06:01:49.208Z Has data issue: false hasContentIssue false

Sojourn Time Estimation in an M/G/∞ Queue with Partial Information

Published online by Cambridge University Press:  30 January 2018

Nafna Blanghaps*
Affiliation:
University of Haifa
Yuval Nov*
Affiliation:
University of Haifa
Gideon Weiss*
Affiliation:
University of Haifa
*
∗ Postal address: Department of Statistics, University of Haifa, Haifa, 31905, Israel.
∗ Postal address: Department of Statistics, University of Haifa, Haifa, 31905, Israel.
∗ Postal address: Department of Statistics, University of Haifa, Haifa, 31905, Israel.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We propose an estimator for the cumulative distribution function G of the sojourn time in a steady-state M/G/∞ queueing system, when the available data consists of the arrival and departure epochs alone, without knowing which arrival corresponds to which departure. The estimator generalizes an estimator proposed in Brown (1970), and is based on a functional relationship between G and the distribution function of the time between a departure and the rth latest arrival preceding it. The estimator is shown to outperform Brown's estimator, especially when the system is heavily loaded.

Information

Type
Research Article
Copyright
© Applied Probability Trust