Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

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

  • Part of
  • Nafna Blanghaps, Yuval Nov, Gideon Weiss
  • Journal:
    Journal of Applied Probability / Volume 50 / Issue 4 / December 2013
    Published online by Cambridge University Press:
    30 January 2018, pp. 1044-1056
    Print publication:
    December 2013
    • Article
      • You have access
    • PDF
    • Export citation

  • 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.

  • On inference in a one-dimensional mosaic and an M/G/∞ queue

  • Peter Hall
  • Journal:
    Advances in Applied Probability / Volume 17 / Issue 1 / March 1985
    Published online by Cambridge University Press:
    01 July 2016, pp. 210-229
    Print publication:
    March 1985

  • Suppose segments are distributed at random along a line, their locations being determined by a Poisson process. In the case where segment length is fixed, we compare efficiencies of several different estimates of Poisson intensity. The case of random segment length is also considered, and there we study estimation procedures based on empiric properties. The one-dimensional mosaic may be viewed as an M/G/∞ queue.