Conclusions
In the article we have analyzed a class of systems for the recording of digital input to the system by queueing-theoretic methods and developed a method for determining the buffer storage capacity. We have investigated a single-server queueing system with finite waiting space and derived a generating function for the busy period of a system with constant service time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
A. Ya. Khinchin, Works on Mathematical Queueing Theory [in Russian], Fizmatgiz, Moscow (1963).
G. P. Klimov, Stochastic Service Systems [in Russian], Izd. Nauka, Moscow (1966).
D. Cox and W. L. Smith, Queues, Wiley, New York (1961).
D. G. Kendall, “Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain,” Ann. Math. Statist.,24, 338–354 (1953).
W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York (1950).
T. L. Saaty, Elements of Queueing Theory, with Applications, McGraw-Hill, New York (1961).
M. I. Lanin, “Calculation of the message loss probability in centralized control systems,” Avtomat. i Telemekhan.,23, No. 3 (1962).
V. P. Vinnitskii, “A digital code-to-pulse sequence converter,” Mekhanizatsiya i Avtomat izatsiya Upravleniya, No. 1 (1967).
V. I. Mudrov, “Determination of the loss probability in mixed-type single-server queueing systems,” in: Problems of Cybernetics [in Russian], No. 4, Izd. Nauka, Moscow (1960).
Additional information
Translated from Kibernetika, No. 6, pp. 75–81, November–December, 1971.
Rights and permissions
About this article
Cite this article
Vinnitskii, V.P. Capacity-time analysis of data recording and transmission systems. Cybern Syst Anal 7, 1025–1032 (1971). https://doi.org/10.1007/BF01068829
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068829