Abstract
We model telecommunication systems using two-state discrete Markov processes. Using the methods of dynamic programming we find the optimal virtual channel with minimal probability of a busy state. A simple example is also considered for the purpose of illustration.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lazarev, V.G. and Lazarev, Yu.V., Dynamic control of information flows in communication networks. Moscow: Radio i svyaz’, 1983.
Saitov, I.A. and Aleksikov, Yu.G., Optimization of information exchange networks for corporate telecommunication systems, Telekommunikatsii, 2007, no. 7, pp. 2–7.
Korolyov, A.V. and Saitov, I.A., Tregubov, R.B., Bogachyov, A.B., Optimization of call services at switching nodes of corporate multimedia communication networks. Telekommunikatsii, 2007, no. 8, pp. 2–8.
Kolmogorov, A.N., On the problem of queuing. Matematicheskii sbornik, 1931, vol. 38, no. 1–2, pp. 101–106.
Feller, W., Introduction to probability theory and its applications. New York: Wiley, 1968.
Tikhonov, V.I. and Mironov, M.A., Markov processes, Moscow: Sov. Radio, 1977.
Kul’gin, M., Corporate networks technology, SPb: Piter, 1999.
Bellman, P., Dynamic programming, Courier Dover Publication, 2003.
Author information
Authors and Affiliations
Additional information
Original Russian Text © V.V. Hutortsev, M.V. Hutortseva, 2008, published in Avtomatika i Vychislitel’naya Tekhnika, 2008, No. 6, pp. 66–73.
About this article
Cite this article
Hutortsev, V.V., Hutortseva, M.V. Using iterations for finding the optimal virtual channel in telecommunication networks. Aut. Conrol Comp. Sci. 42, 327–333 (2008). https://doi.org/10.3103/S0146411608060084
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411608060084