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.
Heavy Traffic Theory for Queues with Several Servers. I
Journal of Applied Probability
Vol. 11, No. 3 (Sep., 1974), pp. 544-552
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3212698
Page Count: 9
You can always find the topics here!Topics: Traffic, Approximation, Mathematical theorems, Statism, Mathematics
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
Queues with several servers are examined here, in which arrivals are assumed to form a renewal sequence and successive service times to be mutually independent and independent of the arrival times. The first-come-first-served queue discipline only is considered. An asymptotic formula for the equilibrium waiting time distribution is obtained under conditions of heavy traffic.
Journal of Applied Probability © 1974 Applied Probability Trust