Recurrent algorithm of telecommunication systems and networks design

Oleksandr Pliushch, DSc (Engin.), Assoc. Prof.

Faculty of Information Technology, Taras Shevchenko National University of Kyiv, Ukraine

ORCID ID:0000-0001-5310-0660

Yurii Kravchenko, DSc (Engin.), Prof.

Faculty of Information Technology, Taras Shevchenko National University of Kyiv, Ukraine

ORCID ID: 0000-0002-4188-2850

Oleksandr Trush, PhD (Engin.), Assoc. Prof.

Faculty of Information Technology, Taras Shevchenko National University of Kyiv, Ukraine

ORCID ID: :0000-0002-4188-2850

Abstract

DOI: https://doi.org/10.17721/AIT.2023.1.10

Background. The Erlang B-formula that establishes a relationship between probability of dropped calls, call intensity in a certain link and available communication channels in this link is widely used in telecommunication networks’ design and calculations. In a great number of applications, a problem emerges of finding required number of channels in a link for set call intensity to satisfy required probability of dropped calls.

Methods. Methods of computer simulation as well as complex systems analysis.

Results. With account of the fact that the number of channels enters Erlang B-formula, firstly, as upper index of summation, secondly, exponent of the exponent function and, thirdly, in the factorial, the solution of the problem is possible graphically. This approach includes calculation of the dropped calls probability for a certain range of numbers of channels to determine the first channel’ number for which dropped call probability results in a value below the threshold. The paper shows that for big values of the number of channels and call intensity direct use of Erlang B-formula on a computer leads to quick bit grid overflow and inability to fulfill required calculations. To overcome this problem, a recurrent algorithm is proposed to resolve the task, which is derived from Erlang B-formula and due to its structure does not suffer from the above limitations while performed on a computer.

Сonclusions. Research results of the proposed algorithm demonstrate its high efficiency in implementation in Matlab environment. It is thought that the algorithm can find wide application in telecommunication networks design.

Keywords:telecommunication network, Erlang B-formula, recurrent algorithm, Matlab.

Information about the author

Oleksandr Pliushch, DSc (Engin.), Assoc. Prof., Professor of the Department of Networking and Internet Technologies, Faculty of Information Technologies, Taras Shevchenko National University of Kyiv.

Research interests: telecommunication systems, mobile networks, adaptive antennas.

Yurii Kravchenko, DSc (Engin.), Prof., Head of the Department of Networking and Internet Technologies, Faculty of Information Technologies, Taras Shevchenko National University of Kyiv.

Research interests: telecommunication systems, functional stability of complex systems, artificial intelligence.

Oleksandr Trush, PhD (Engin.), Assoc. Prof., Associate Professor of the Department of Networking and Internet Technologies, Faculty of Information Technologies, Taras Shevchenko National University of Kyiv.

Research interests: Electronics, infocommunication networks, neural networks, information technologies, information protection in networks.

References