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 Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

On the Cut-off Phenomenon in Some Queueing Systems

P. Konstantopoulos and F. Baccelli
Journal of Applied Probability
Vol. 28, No. 3 (Sep., 1991), pp. 683-694
DOI: 10.2307/3214502
Stable URL: http://www.jstor.org/stable/3214502
Page Count: 12
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On the Cut-off Phenomenon in Some Queueing Systems
Preview not available

Abstract

A number of stochastic queueing systems exhibit an interesting phenomenon known as the cut-off phenomenon. A properly scaled version of the distance between the transient process and the stationary one converges to a step function as the initial load converges to infinity. The purpose of this paper is to promote the idea that this phenomenon is a direct consequence of the coupling between the two processes, being thus generalizable to systems lacking any kind of Markovian structure.

Page Thumbnails

  • Thumbnail: Page 
683
    683
  • Thumbnail: Page 
684
    684
  • Thumbnail: Page 
685
    685
  • Thumbnail: Page 
686
    686
  • Thumbnail: Page 
687
    687
  • Thumbnail: Page 
688
    688
  • Thumbnail: Page 
689
    689
  • Thumbnail: Page 
690
    690
  • Thumbnail: Page 
691
    691
  • Thumbnail: Page 
692
    692
  • Thumbnail: Page 
693
    693
  • Thumbnail: Page 
694
    694