You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis 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.
Passage Times for Overtake-Free Paths in Gordon-Newell Networks
Advances in Applied Probability
Vol. 14, No. 3 (Sep., 1982), pp. 672-686
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/1426680
Page Count: 15
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.
Preview not available
Consider a path in a multiclass Gordon-Newell network such that a customer present in a node of this path cannot be overtaken by any other customer behind him in a node of this path or by probabilistic influences created by such customers. The passage time through such a path is a mixture of Erlangian distributions, where the mixing distribution is given by the steady state of the network.
Advances in Applied Probability © 1982 Applied Probability Trust