You are not currently logged in.
Access JSTOR through your library or other institution:
Approximations of the Mean Waiting Time in an M/G/s Queueing System
O. J. Boxma, J. W. Cohen and N. Huffels
Vol. 27, No. 6 (Nov. - Dec., 1979), pp. 1115-1127
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/172087
Page Count: 13
You can always find the topics here!Topics: Approximation, Traffic, Customers, Mathematical moments, Coefficients, Error rates, Approximate values, Mathematical inequalities, Network servers
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper considers the problem of obtaining approximate expressions for the first moment WGs of the stationary waiting time distribution in an M/G/s queueing system. Special attention is paid to the case
$G\equiv D$, i.e. constant service times. Most known approximations are in fact heavy traffic approximations which have rather large relative errors in the light traffic case. In the present study both the light traffic and heavy traffic behavior of WGs (WDs) are taken into account. In order to obtain mean waiting time approximations it appears to be useful to introduce a quantity (the "normed cooperation coefficient") which is inversely proportional to WGs and which is in some sense a measure for the "cooperation" between the servers of the service facility. A part of the paper is devoted to the analysis of this normed cooperation coefficient.
Operations Research © 1979 INFORMS