Геннадий Васильевич Слюсарев
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Геннадий Васильевич Слюсарев has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Daria Gosteva
North-Caucasus Federal University
2 shared publications - M. D. Bavizhev
НИЦ АО «НПП „РАДИЙ“
2 shared publications - Valery Mochalov
North-Caucasus Federal University
2 shared publications - A. F. Chipiga
North Caucasus Federal University
1 shared publication - Alexander D. Skorik
Russian Institute of Powerful Radio Engineering
1 shared publication - Gennadiy Ivanovich Linets
North-Caucasus Federal University
1 shared publication
Latest Publications
- 22 May 2026
- Published by Volga State University of Technology in Vestnik of Volga State University of Technology. Series Radio Engineering and Infocommunication Systems
- No. 1(69),p. 26-41
Распределённая цифровая АФАР как адаптивный оператор внимания
Постановка проблемы. В распределённых цифровых активных фазированных антенных решётках (АФАР) на подвижных платформах классические методы формирования луча требуют высокой точности геометрии, времени и фазы. Ошибки позиционирования и синхронизации ведут к потере когерентности и снижению отношения сигнал/шум (SNR). Цель. Разработка метода когерентной обработки сигналов распределённой цифровой АФАР, в котором требования к синхронизации ослабляются за счёт адаптивного перераспределения вкладов элементов апертуры. Материалы и методы. Использована модель стохастической апертуры из M платформ с учётом ошибок позиционирования, времени и фазы. Процесс формирования луча формализован как адаптивный оператор внимания (структура Q–K–V). Веса определяются экспоненциальной функцией от рассогласований. Проведено численное моделирование для M = 5, включая однородное и неоднородное распределение SNR. Результаты.Показано, что предложенный подход обобщает классическое когерентное формирование луча. При неоднородном SNR выигрыш в выходном SNR достигает 3,3 дБ. Вычислительная сложность линейна по числу платформ и гипотез O(K·M). Практическая значимость. Метод позволяет ослабить аппаратные требования, обеспечивая «мягкую» деградацию характеристик при ошибках навигации. Архитектура масштабируема и пригодна для роя БПЛА и малых космических платформ. Formulation of the problem. In distributed digital active phased array antennas (APAA) on mobile platforms, classical beamforming methods require high accuracy of geometry, timing, and phase. Positioning and synchronization errors lead to loss of coherence and reduction in the signal-to-noise ratio. Objective.To develop a coherent signal processing method for distributed digital APAA in which synchronization requirements are relaxed through adaptive redistribution of aperture element contributions. Materials and methods. A stochastic aperture model of M platforms is used, accounting for positioning, timing, and phase errors. The beamforming process is formalized as an adaptive attention operator (Q–K–V structure). Weights are determined by an exponential function of mismatches. Numerical simulation is performed for M=5, including both uniform and non-uniform SNR distributions. Results. It is shown that the proposed approach generalizes classical coherent beamforming. Under non-uniform SNR, the output SNR gain reaches 3,3 dB. Computational complexity is linear in the number of platforms and hypotheses, O(K·M). Practical significance. The method relaxes hardware requirements, providing graceful degradation of performance under navigation errors. The architecture is scalable and suitable for UAV swarms and small space platforms.
- 22 May 2026
- Published by Volga State University of Technology in Vestnik of Volga State University of Technology. Series Radio Engineering and Infocommunication Systems
- No. 1(69),p. 26-41
Распределённая цифровая АФАР как адаптивный оператор внимания
Постановка проблемы. В распределённых цифровых активных фазированных антенных решётках (АФАР) на подвижных платформах классические методы формирования луча требуют высокой точности геометрии, времени и фазы. Ошибки позиционирования и синхронизации ведут к потере когерентности и снижению отношения сигнал/шум (SNR). Цель. Разработка метода когерентной обработки сигналов распределённой цифровой АФАР, в котором требования к синхронизации ослабляются за счёт адаптивного перераспределения вкладов элементов апертуры. Материалы и методы. Использована модель стохастической апертуры из M платформ с учётом ошибок позиционирования, времени и фазы. Процесс формирования луча формализован как адаптивный оператор внимания (структура Q–K–V). Веса определяются экспоненциальной функцией от рассогласований. Проведено численное моделирование для M = 5, включая однородное и неоднородное распределение SNR. Результаты.Показано, что предложенный подход обобщает классическое когерентное формирование луча. При неоднородном SNR выигрыш в выходном SNR достигает 3,3 дБ. Вычислительная сложность линейна по числу платформ и гипотез O(K·M). Практическая значимость. Метод позволяет ослабить аппаратные требования, обеспечивая «мягкую» деградацию характеристик при ошибках навигации. Архитектура масштабируема и пригодна для роя БПЛА и малых космических платформ. Formulation of the problem. In distributed digital active phased array antennas (APAA) on mobile platforms, classical beamforming methods require high accuracy of geometry, timing, and phase. Positioning and synchronization errors lead to loss of coherence and reduction in the signal-to-noise ratio. Objective.To develop a coherent signal processing method for distributed digital APAA in which synchronization requirements are relaxed through adaptive redistribution of aperture element contributions. Materials and methods. A stochastic aperture model of M platforms is used, accounting for positioning, timing, and phase errors. The beamforming process is formalized as an adaptive attention operator (Q–K–V structure). Weights are determined by an exponential function of mismatches. Numerical simulation is performed for M=5, including both uniform and non-uniform SNR distributions. Results. It is shown that the proposed approach generalizes classical coherent beamforming. Under non-uniform SNR, the output SNR gain reaches 3,3 dB. Computational complexity is linear in the number of platforms and hypotheses, O(K·M). Practical significance. The method relaxes hardware requirements, providing graceful degradation of performance under navigation errors. The architecture is scalable and suitable for UAV swarms and small space platforms.
- Open Access
- 12 May 2026
- Published by FSFEI HE Don State Technical University in Advanced Engineering Research (Rostov-on-Don)
- Vol. 26 (2) , 2221
Analytical Model of the Buffer Memory of an OpenFlow Switch in a Software-Defined Network (SDN)
Introduction . Reliable identification of the probabilistic and temporal features of switching nodes is required for assessing the quantitative characteristics of software-defined networks. Widely used queuing theory (QT) methods only approximately specify and model the processes in an OpenFlow switch and its buffer memory. This results in understated and unrealistic performance estimates for the designed network equipment, causing switch buffer overloading and packet loss. A different modeling approach can solve this problem. The objective of this paper is to develop and study an analytical model for the buffer memory of an OpenFlow switch in an SDN using advanced techniques. Materials and Methods . The discrete Laplace-Stieltjes transform was used. Statistical characteristics of packet flows and the throughput of communication channels for a given packet loss probability were taken into account. The OpenFlow switch buffer memory model was based on the mathematical apparatus of the QT. It was constructed under the assumption of recurrence of input data flows with batch arrivals. The model was based on schematic representations of the switch structure, its record set, and a graph description of the transmission of network packets leaving the switch. We started with schematic representations of the switch structure, its record set, and a graph description of the transmission of network packets exiting the switch. Two model assumptions were taken as acceptable: arbitrary distribution of the relationship between the volume of data flows and their service time; discreteness of the distribution of the information flow structure. Results . The developed model integrated the probability of packet flow loss, their statistical characteristics, the throughput of computing devices, and the multiphase service procedure. When testing the model performance, we assumed that the switch load increased from 0.1 to 0.9, and the loss probability — from 10 –3 to 10 –6 . For these metrics, we determined how the switch load affected the buffer memory size and latency. In the first case, the minimum value (memory capacity) was 0.201, the maximum — 10564. In the second, they were 0 and 470 ms, respectively. For simulation modeling, the minimum time was 0 ms, the maximum — 2300 ms. The simulation and analytical modeling indicators were close at loads below 50% and increased several times at loads above 50%. The indicators increased sharply with loads up to 70%, and then increased exponentially. Discussion . At low network loads, queues did not overflow, packets were not lost, and linear dependences were maintained. At medium and high loads, packet flow processing was described by nonlinear dependences. The results of analytical and simulation modeling diverged due to the explosive nature of self-similar network traffic and its approximate description by the Pareto distribution. Switch load determined the feasibility of the proposed approach. The model is suitable for designing elements of software-defined networks to analyze their resilience under various information impacts. Conclusion . The proposed SDN analytical model determined the values and variances of the switch buffer memory size, as well as the memory capacity for constructing address flow tables. The solution performance was tested with switch loads ranging from 0.1 to 0.9. It is planned to create a model that takes into account request flows from both the external network and the server.
- 12 May 2026
- Published by FSFEI HE Don State Technical University in Advanced Engineering Research (Rostov-on-Don)
- Vol. 26 (2) , 2221
Open AccessAnalytical Model of the Buffer Memory of an OpenFlow Switch in a Software-Defined Network (SDN)
Introduction . Reliable identification of the probabilistic and temporal features of switching nodes is required for assessing the quantitative characteristics of software-defined networks. Widely used queuing theory (QT) methods only approximately specify and model the processes in an OpenFlow switch and its buffer memory. This results in understated and unrealistic performance estimates for the designed network equipment, causing switch buffer overloading and packet loss. A different modeling approach can solve this problem. The objective of this paper is to develop and study an analytical model for the buffer memory of an OpenFlow switch in an SDN using advanced techniques. Materials and Methods . The discrete Laplace-Stieltjes transform was used. Statistical characteristics of packet flows and the throughput of communication channels for a given packet loss probability were taken into account. The OpenFlow switch buffer memory model was based on the mathematical apparatus of the QT. It was constructed under the assumption of recurrence of input data flows with batch arrivals. The model was based on schematic representations of the switch structure, its record set, and a graph description of the transmission of network packets leaving the switch. We started with schematic representations of the switch structure, its record set, and a graph description of the transmission of network packets exiting the switch. Two model assumptions were taken as acceptable: arbitrary distribution of the relationship between the volume of data flows and their service time; discreteness of the distribution of the information flow structure. Results . The developed model integrated the probability of packet flow loss, their statistical characteristics, the throughput of computing devices, and the multiphase service procedure. When testing the model performance, we assumed that the switch load increased from 0.1 to 0.9, and the loss probability — from 10 –3 to 10 –6 . For these metrics, we determined how the switch load affected the buffer memory size and latency. In the first case, the minimum value (memory capacity) was 0.201, the maximum — 10564. In the second, they were 0 and 470 ms, respectively. For simulation modeling, the minimum time was 0 ms, the maximum — 2300 ms. The simulation and analytical modeling indicators were close at loads below 50% and increased several times at loads above 50%. The indicators increased sharply with loads up to 70%, and then increased exponentially. Discussion . At low network loads, queues did not overflow, packets were not lost, and linear dependences were maintained. At medium and high loads, packet flow processing was described by nonlinear dependences. The results of analytical and simulation modeling diverged due to the explosive nature of self-similar network traffic and its approximate description by the Pareto distribution. Switch load determined the feasibility of the proposed approach. The model is suitable for designing elements of software-defined networks to analyze their resilience under various information impacts. Conclusion . The proposed SDN analytical model determined the values and variances of the switch buffer memory size, as well as the memory capacity for constructing address flow tables. The solution performance was tested with switch loads ranging from 0.1 to 0.9. It is planned to create a model that takes into account request flows from both the external network and the server.
- 1 April 2026
- Published by Voronezh State Technical University in ВЕСТНИК ВОРОНЕЖСКОГО ГОСУДАРСТВЕННОГО ТЕХНИЧЕСКОГО УНИВЕРСИТЕТА
- Vol. 22 (1) , 159-168
Концептуальное проектирование распределенной стохастической антенной решетки на малых беспилотниках
Рассматривается концепция распределённых активных фазированных антенных решёток, формируемых на базе роев малых беспилотных летательных аппаратов воздушного и космического базирования. Предлагаемый подход основан на принципе стохастического синтеза апертуры, при котором виртуальная антенна большого размера формируется за счёт пространственного распределения антенных элементов на подвижных носителях с последующей цифровой компенсацией фазовых и временных искажений. Когерентность излучения и приёма обеспечивается не жёстким геометрическим построением решётки, а итеративной обработкой I/Q-сигналов с учётом текущего взаимного расположения элементов и ошибок позиционирования. Приводится совокупность математических моделей, описывающих формирование диаграммы направленности, когерентное накопление сигналов и влияние стохастических возмущений на характеристики системы. Выполнен параметрический анализ и численное моделирование для сценариев воздушного и космического базирования, позволяющие оценить энергетический потенциал, угловое разрешение и устойчивость к потерям отдельных элементов роя. Отдельное внимание уделено ключевым технологическим аспектам реализации: сверхточной синхронизации времени и частоты, управлению роем, высокоскоростной передаче данных и требованиям к производительности вычислительных средств. Показана целесообразность применения методов искусственного интеллекта для мультидисциплинарной оптимизации архитектуры системы и ускорения проектных процедур. This paper examines the concept of distributed active phased antenna arrays formed from swarms of small air- and space-based unmanned aerial vehicles. The proposed approach is based on the principle of stochastic aperture synthesis, in which a large virtual antenna is formed by spatially distributing antenna elements on moving carriers, followed by digital compensation for phase and time distortions. Coherence of radiation and reception is ensured not by rigid geometric construction of the array, but by iterative processing of I/Q signals, taking into account the current relative positions of the elements and positioning errors. A set of mathematical models is presented describing the formation of the radiation pattern, coherent signal accumulation, and the influence of stochastic disturbances on the system's characteristics. Parametric analysis and numerical modeling are performed for air- and space-based scenarios, allowing for an assessment of the energy potential, angular resolution, and resilience to losses of individual swarm elements. Special attention is given to key technological aspects of implementation: ultra-precise time and frequency synchronization, swarm control, high-speed data transmission, and computing performance requirements. The feasibility of using artificial intelligence methods for multidisciplinary optimization of the system architecture and acceleration of design processes is demonstrated.
- 1 April 2026
- Published by Voronezh State Technical University in ВЕСТНИК ВОРОНЕЖСКОГО ГОСУДАРСТВЕННОГО ТЕХНИЧЕСКОГО УНИВЕРСИТЕТА
- Vol. 22 (1) , 159-168
Концептуальное проектирование распределенной стохастической антенной решетки на малых беспилотниках
Рассматривается концепция распределённых активных фазированных антенных решёток, формируемых на базе роев малых беспилотных летательных аппаратов воздушного и космического базирования. Предлагаемый подход основан на принципе стохастического синтеза апертуры, при котором виртуальная антенна большого размера формируется за счёт пространственного распределения антенных элементов на подвижных носителях с последующей цифровой компенсацией фазовых и временных искажений. Когерентность излучения и приёма обеспечивается не жёстким геометрическим построением решётки, а итеративной обработкой I/Q-сигналов с учётом текущего взаимного расположения элементов и ошибок позиционирования. Приводится совокупность математических моделей, описывающих формирование диаграммы направленности, когерентное накопление сигналов и влияние стохастических возмущений на характеристики системы. Выполнен параметрический анализ и численное моделирование для сценариев воздушного и космического базирования, позволяющие оценить энергетический потенциал, угловое разрешение и устойчивость к потерям отдельных элементов роя. Отдельное внимание уделено ключевым технологическим аспектам реализации: сверхточной синхронизации времени и частоты, управлению роем, высокоскоростной передаче данных и требованиям к производительности вычислительных средств. Показана целесообразность применения методов искусственного интеллекта для мультидисциплинарной оптимизации архитектуры системы и ускорения проектных процедур. This paper examines the concept of distributed active phased antenna arrays formed from swarms of small air- and space-based unmanned aerial vehicles. The proposed approach is based on the principle of stochastic aperture synthesis, in which a large virtual antenna is formed by spatially distributing antenna elements on moving carriers, followed by digital compensation for phase and time distortions. Coherence of radiation and reception is ensured not by rigid geometric construction of the array, but by iterative processing of I/Q signals, taking into account the current relative positions of the elements and positioning errors. A set of mathematical models is presented describing the formation of the radiation pattern, coherent signal accumulation, and the influence of stochastic disturbances on the system's characteristics. Parametric analysis and numerical modeling are performed for air- and space-based scenarios, allowing for an assessment of the energy potential, angular resolution, and resilience to losses of individual swarm elements. Special attention is given to key technological aspects of implementation: ultra-precise time and frequency synchronization, swarm control, high-speed data transmission, and computing performance requirements. The feasibility of using artificial intelligence methods for multidisciplinary optimization of the system architecture and acceleration of design processes is demonstrated.
- 18 October 2025
- Published by Springer Nature
- p. 115-127
The Algorithm of Load Distribution Between Computing Resources of the Data Processing Center
- 18 October 2025
- Published by Springer Nature
- p. 115-127
The Algorithm of Load Distribution Between Computing Resources of the Data Processing Center
- Open Access
- 25 December 2024
- Published by FSFEI HE Don State Technical University in Advanced Engineering Research (Rostov-on-Don)
- Vol. 24 (4) , 424-432
Optimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks
Introduction. When managing traffic at the packet level in modern telecommunication networks, it is proposed to use methods that transform a self-similar stochastic packet flow into a quasi-deterministic one. To do this, it is required to apply complex probabilistic laws of distribution of self-similar flows. From the literature, methods of balancing the network load are known, which, with the problem indicated above, contribute to increasing the efficiency of telecommunication systems. However, there is no strictly mathematical solution to find out the optimal probabilistic characteristics of the output flow, based on the input flow. The presented research is intended to fill this gap. Its objective is to create a method for determining the optimal probabilistic characteristics of the packet flow, using the minimum value of the proximity measure of the self-similar input and quasi-deterministic output flows.Materials and Methods. To solve the research problem, the parameters of the output flow distribution were selected so that the approximation function was close to 𝛿𝛿-function. The Kullback-Leibler divergence was used as a proximity measure of the input and output distributions of time intervals. Methods of set theory, metric spaces, multidimensional optimization, and teletraffic were used. The solution algorithm included minimization of the Kullback-Leibler divergence and the limit passage to 𝛿𝛿-function.Results. A probability distribution is shown — an approximation of 𝛿𝛿-function, which maintains the equality of time intervals of a quasi-deterministic output packet flow. A method for transforming a self-similar input flow into a quasideterministic output flow is presented. The Kullback–Leibler divergence was used as a measure of their proximity. The minimum of the Kullback-Leibler divergence between the input and output flows with a normal distribution was achieved in the case of equality of the mathematical expectations of these flows. Using the passage to the limit, it has been established that time interval T between packets of the quasi-deterministic output flow must be equal to the mathematical expectation of the time intervals between packets of the input self-similar flow. To obtain a quasi-deterministic flow, the passage to the limit is performed for the found value of the mathematical expectation at σ → 0.Discussion and Conclusion. The application of this method will reduce the negative impact of self-similarity of network traffic on the efficiency of the telecommunication network. The use of quasi-deterministic flows makes it possible to predict the load of network resources, which can be the basis for improving the quality of user service. Two difficulties associated with calculations and practical implementation of the solution are eliminated. Firstly, it is difficult to use the delta function as a function of the output flow distribution density. Secondly, there are no ideal deterministic flows in the operation of telecommunication networks. The proposed method has great potential in the design and optimization of communication networks.
- 25 December 2024
- Published by FSFEI HE Don State Technical University in Advanced Engineering Research (Rostov-on-Don)
- Vol. 24 (4) , 424-432
Open AccessOptimization Problem for Probabilistic Time Intervals of Quasi-Deterministic Output and Self-Similar Input Data Packet Flow in Telecommunication Networks
Introduction. When managing traffic at the packet level in modern telecommunication networks, it is proposed to use methods that transform a self-similar stochastic packet flow into a quasi-deterministic one. To do this, it is required to apply complex probabilistic laws of distribution of self-similar flows. From the literature, methods of balancing the network load are known, which, with the problem indicated above, contribute to increasing the efficiency of telecommunication systems. However, there is no strictly mathematical solution to find out the optimal probabilistic characteristics of the output flow, based on the input flow. The presented research is intended to fill this gap. Its objective is to create a method for determining the optimal probabilistic characteristics of the packet flow, using the minimum value of the proximity measure of the self-similar input and quasi-deterministic output flows.Materials and Methods. To solve the research problem, the parameters of the output flow distribution were selected so that the approximation function was close to 𝛿𝛿-function. The Kullback-Leibler divergence was used as a proximity measure of the input and output distributions of time intervals. Methods of set theory, metric spaces, multidimensional optimization, and teletraffic were used. The solution algorithm included minimization of the Kullback-Leibler divergence and the limit passage to 𝛿𝛿-function.Results. A probability distribution is shown — an approximation of 𝛿𝛿-function, which maintains the equality of time intervals of a quasi-deterministic output packet flow. A method for transforming a self-similar input flow into a quasideterministic output flow is presented. The Kullback–Leibler divergence was used as a measure of their proximity. The minimum of the Kullback-Leibler divergence between the input and output flows with a normal distribution was achieved in the case of equality of the mathematical expectations of these flows. Using the passage to the limit, it has been established that time interval T between packets of the quasi-deterministic output flow must be equal to the mathematical expectation of the time intervals between packets of the input self-similar flow. To obtain a quasi-deterministic flow, the passage to the limit is performed for the found value of the mathematical expectation at σ → 0.Discussion and Conclusion. The application of this method will reduce the negative impact of self-similarity of network traffic on the efficiency of the telecommunication network. The use of quasi-deterministic flows makes it possible to predict the load of network resources, which can be the basis for improving the quality of user service. Two difficulties associated with calculations and practical implementation of the solution are eliminated. Firstly, it is difficult to use the delta function as a function of the output flow distribution density. Secondly, there are no ideal deterministic flows in the operation of telecommunication networks. The proposed method has great potential in the design and optimization of communication networks.
- 8 August 2020
- Published by Springer Nature
- p. 470-479
Spatial Secrecy of a Low-Frequency Satellite Communication System with a Phased Antenna Array
- 8 August 2020
- Published by Springer Nature
- p. 470-479
Spatial Secrecy of a Low-Frequency Satellite Communication System with a Phased Antenna Array