Abstract
We consider a service system consisting of a time-shared central server (CPU) and a number of geographically distributed stations. Customers send service requirements to the CPU through terminals at the stations. Examples of such a system are cash dispenser systems in banks, etc. A notable characteristic of such a system is that two kinds of queues are formed, one at the CPU and the others at the stations. This characteristic was first taken into account for analysis explicitly by Pan and Morimura (1986). In this paper, we generalize their model by removing the restrictive assumptions that all the stations have the same arrival rate and an identical number of terminals. Two approximation formulas for the mean system time of customers are obtained. Extensive numerical experiments reveal that our approximations are quite good. Some possible applications of our results are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baskett, F., K. M. Chandy, R. R. Muntz and F. G. Palacios, "Open, Closed and Mixed Networks of Queues with Different Classes of Customers," Journal of the Association for Computing Machinery, Vol. 22 (1975), 248–260.
Boxma, O. J., J. W. Cohen and N. Huffels, "Approximations of the Mean Waiting Time in an M/G/s Queueing System," Operations Research, Vol. 27 (1979), 1115–1127.
Chandy, K. M., J. H. Howard and D. F. Towsley, "Product Form and Local Balance in Queueing Networks," Journal of the Association for Computing Machinery, Vol. 24 (1977), 250–263.
Kimura, T., "A Two-Moment Approximation for the Mean Waiting Time in the GI/G/s Queue," Management Science, Vol. 32 (1986), 751–763.
Kleinrock, L., "Analysis of a Time-Shared Processor," Naval Research Logistics Quarterly, Vol. 11 (1964), 59–73.
Kleinrock, L., Queueing Systems, Volume II: Computer Applications, John Wiley & Sons, 1976.
Pan, H. and H. Morimura, "Approximate Analysis of an On-Line Network System," Journal of the Operations Research Society of Japan, Vol. 29 (1986), 286–304.
Scherr, A. A., An Analysis of Time-Shared Computer Systems, MIT Press, 1967.
Takahashi, Y., "An Approximation Formula for the Mean Waiting Time of an M/G/c Queue," Journal of the Operations Research Society of Japan, Vol. 20 (1977), 150–163.
Tijms, H. C., M. H. V. Hoorn and A. Federgruen, "Approximations for the Steady-State Probabilities in the M/G/c Queue," Advances in Applied Probability, Vol. 13 (1981), 186–206.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 International Federation for Information Processing
About this paper
Cite this paper
Pan, H., Morimura, H., Kijima, M. (1988). Analysis of a time-shared central server system with heterogeneous distributed stations. In: Iri, M., Yajima, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042843
Download citation
DOI: https://doi.org/10.1007/BFb0042843
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19238-1
Online ISBN: 978-3-540-39164-7
eBook Packages: Springer Book Archive