Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T06:52:58.513Z Has data issue: false hasContentIssue false
  • English
  • Français

Analysis of an M/G/1/K/N queue

Part of: Special processes Computer system organization

Published online by Cambridge University Press:  14 July 2016

T. Takine ,
H. Takagi  and
T. Hasegawa
T. Takine*
Affiliation:
Kyoto University
H. Takagi*
Affiliation:
IBM Research Division
T. Hasegawa*
Affiliation:
Kyoto University
*
∗∗ Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606–01, Japan.
∗∗∗ Postal address: IBM Japan Ltd, Tokyo Research Laboratory, 5–19 Sanban-cho, Chiyoda-ku, Tokyo 102, Japan.
∗∗ Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606–01, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

A steady-state analysis of an M/G/1 queue with a finite capacity (K) and a finite population (N) of customers is given. The queue size distribution in this M/G/1/K/N system can be derived from the known queue size distribution in the corresponding M/G/1//N system. The system throughput, the mean response time, and the blocking probability are then calculated. The joint distributions of the queue size and the remaining service times are used to obtain the distributions of the unfinished work in the service facility and the waiting time of an accepted customer.

Keywords

FINITE SOURCE MODELS

MSC classification

Primary: 60K25: Queueing theory
Secondary: 68M20: Performance evaluation; queueing; scheduling
Type
Research Papers
Information
Journal of Applied Probability , Volume 30 , Issue 2 , June 1993 , pp. 446 - 454
Copyright
Copyright © Applied Probability Trust 1993 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Cohen, J. W. (1982) The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Courtois, P. J. and Georges, J. (1971) On a single-server finite queuing model with state-dependent arrival and service processes. Operat. Res. 19, 424–435.Google Scholar
Jaiswal, N. K. (1968) Priority Queues. Academic Press, New York.Google Scholar
Miyazawa, M. (1983) The derivation of invariance relations in complex queueing systems with stationary inputs. Adv. Appl. Prob. 15, 874–885.Google Scholar
Riordan, J. (1962) Stochastic Service Systems. Wiley, New York.Google Scholar
Saaty, T. L. (1961) Elements of Queueing Theory. McGraw-Hill, New York.Google Scholar
Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar