Abstract
Two queuing systems for variable-length customers, namely, a processor-sharing system and a multiline system without waiting places, are considered, for which arrivals are completely random, the joint arrival-length and service-time distribution is arbitrary, and the cumulative arrival volume is limited. For these systems, the stationary state probabilities and the arrival loss probability are determined.
Similar content being viewed by others
REFERENCES
Tikhonenko, O.M., Modeli massovogo obsluzhivaniya v sistemakh obrabotki informatsii (Queuing Models in Information Processing Systems), Minsk: Universitetskoe, 1990.
Yashkov, S.F., Analiz ocheredei v EVM (Analysis of Computer Queues), Moscow: Radio i Svyaz', 1989.
Tikhonenko, O.M., Determination of Characteristics of Queuing Systems with Limited Memory, Avtomat. Telemekh., 1997, no. 6, pp. 105-110.
Sengupta, B., The Spatial Requirement of an M/G/1 Queue; or: How to Design for Buffer Space, in Modeling and Performance Evaluation Methodology, Baccelli, F. and Fayolle, G., Eds., New York: Springer, 1984, pp. 547-564.
Riordan, J., Stochastic Service Systems, New York: Wiley, 1962. Translated under the title Veroyatnostnye sistemy obsluzhivaniya, Moscow: Svyaz', 1966.
Rights and permissions
About this article
Cite this article
Tikhonenko, O.M., Klimovich, K.G. Analysis of Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume. Problems of Information Transmission 37, 70–79 (2001). https://doi.org/10.1023/A:1010451827648
Issue Date:
DOI: https://doi.org/10.1023/A:1010451827648