Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Hitting Time in an M/G/1 Queue

Sheldon M. Ross and Sridhar Seshadri
Journal of Applied Probability
Vol. 36, No. 3 (Sep., 1999), pp. 934-940
Stable URL: http://www.jstor.org/stable/3215453
Page Count: 7
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Hitting Time in an M/G/1 Queue
Preview not available

Abstract

We study the expected time for the work in an M/G/1 system to exceed the level x, given that it started out initially empty, and show that it can be expressed solely in terms of the Poisson arrival rate, the service time distribution and the stationary delay distribution of the M/G/1 system. We use this result to construct an efficient simulation procedure.

Page Thumbnails

  • Thumbnail: Page 
934
    934
  • Thumbnail: Page 
935
    935
  • Thumbnail: Page 
936
    936
  • Thumbnail: Page 
937
    937
  • Thumbnail: Page 
938
    938
  • Thumbnail: Page 
939
    939
  • Thumbnail: Page 
940
    940