Jagerman Approximation of Erlang Processes in On-Board Computing Systems Models

• Published in: Systems of Signals Generating and Processing in the Field of on Board Communications (Online) pp. 1 - 6
• Main Authors: Erokhin, Andrei G., Vanina, Margarita F.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 12.03.2025
• Subjects: access method; Analytical models; Approximation algorithms; Computational modeling; distribution; Information systems; Load modeling; Mathematical models; Nonlinear equations; Numerical models; on-board information system; Queueing analysis; queueing theory; Software algorithms; technological process
• ISSN: 2768-0118
• DOI: 10.1109/IEEECONF64229.2025.10948064

The design of on-board computer systems associates with a large number of calculations and the implementation of complex algorithms. Analytical and simulation models develop for this purpose. These models must take into account a significant number of factors, which include environmental influences, load fluctuations, and others. Queuing theory methods widely uses in modeling on-board computer systems. Queuing network models may be either open or closed. It becomes possible to take into account the network users operation technology when calculating the characteristics of this a model in the latter case. It is necessary to use special software or develop your own programs using algorithmic programming languages in any case. The processes taking place in on-board computer networks describes by the Erlang processes. Software implementation of it has been has quite complicated for a long time. In 1974 Jagerman develops a fast algorithm that implemented Erlang formula however. This paper provides examples of models and programs that allow you calculate the characteristics of on-board computer systems with a complex structure of user dialogue based on the Jagerman algorithm and Brown method for solution of nonlinear equations.