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 Stochastic Matrices Associated with Certain Queuing Processes

F. G. Foster
The Annals of Mathematical Statistics
Vol. 24, No. 3 (Sep., 1953), pp. 355-360
Stable URL: http://www.jstor.org/stable/2236286
Page Count: 6
  • Read Online (Free)
  • Download ($19.00)
  • 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 Stochastic Matrices Associated with Certain Queuing Processes
Preview not available

Abstract

We shall be concerned with an irreducible Markov chain, which we shall call "the system." For simplicity we shall assume that the system is aperiodic, but this is not essential. The reader is referred to [1] for explanations of the terminology used. We first state some general theorems which provide criteria for determining whether the system is transient, recurrent-null or ergodic (recurrent-nonnull). These are then applied to the Markov chains associated with certain queuing processes recently studied by D. G. Kendall [4], [5]; most of the results have already been obtained by Kendall using direct methods, and the main purpose of the present paper is to illustrate the application of general theorems to this type of problem.

Page Thumbnails

  • Thumbnail: Page 
355
    355
  • Thumbnail: Page 
356
    356
  • Thumbnail: Page 
357
    357
  • Thumbnail: Page 
358
    358
  • Thumbnail: Page 
359
    359
  • Thumbnail: Page 
360
    360