Abstract
One describes the class of all possible limit distributions for the random vector of waiting times in a queueing system with absolute priorities.
Similar content being viewed by others
Literature cited
O. I. Bronshtein and I. M. Dukhovnyi, Priority Queueing Models in Computer Information Systems [in Russian], Nauka, Moscow (1976).
E. A. Danielyan, “Waiting time in a model with categorized-time priorities,” Kibernetika, No. 6, 103–109 (1980).
É. A. Danielyan and P. T. Khostikyan, “Limit theorems in the models\(\vec M_z |\vec G_z |1|\infty\) with time-categorized absolute and relative priorities for fixed loads,” in: Intercollegiate Transactions in Mathematics [in Russian], No. 1, Erevan (1982), pp. 134–164.
É. A. Danielyan, “The mathematical theory of the priority models\(\vec M_z |\tilde G_z |1|\infty\),” Author's Abstract of Doctoral Dissertation, Moscow State Univ. (1981).
G. E. Shilov, Mathematical Analysis. A Special Course, Pergamon Press, Oxford (1965).
W. Feller, An Introduction to Probability Theory and Its Applications, Vols. I, II, Wiley, New York (1968 and 1966).
G. S. Grigoryan and É. A. Danielyan, “On a method of analysis of priority systems,” in: Intercollegiate Transactions in Mathematics [in Russian], No. 1, Erevan (1982), pp. 165–196.
B. V. Gnedenko and I. N. Kovalenko, Introduction to Queueing Theory, Israel Program for Scientific Translations, Jerusalem (1968).
R. L. Dobrushin, “A lemma on the limit of a composite random function,” Usp. Mat. Nauk,10, No. 2 (64), 157–159 (1955).
Additional information
Translated from Veroyatnostnye Raspredeleniya i Matematicheskaya Statistika, pp. 131–155, 1986.
Rights and permissions
About this article
Cite this article
Danielyan, É.A., Grigoryan, G.S. Multidimensional limit theorems in models with categorized-time absolute priorities. J Math Sci 38, 2239–2253 (1987). https://doi.org/10.1007/BF01093825
Issue Date:
DOI: https://doi.org/10.1007/BF01093825