You are not currently logged in.
Access JSTOR 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.
Stationary and Stability of Fork-Join Networks
Panagiotis Konstantopoulos and Jean Walrand
Journal of Applied Probability
Vol. 26, No. 3 (Sep., 1989), pp. 604-614
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3214417
Page Count: 11
You can always find the topics here!Topics: Workloads, Ergodic theory, Probabilities, Queueing networks, Mathematical vectors, Random variables, Induction assumption, Infinity, Semigroups, Computer services
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
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
We consider a fork-join network with arrival and service times forming a stationary and ergodic process. The usual stability condition, namely that the input rate is strictly less than all the service rates, is proved to be valid in this general case. Finally we extend the result to the case where there is random routing.
Journal of Applied Probability © 1989 Applied Probability Trust