O.V. Rudakova1

1 FSUE «NTC «ORION» (Moscow, Russia)
1 rudakovaov@mcc.rsa.ru

The continuous increase in the number of subscribers to satellite communication systems (SCS) and the growth of their demands for the variety and quality of services provided have necessitated the constant improvement of methods and technologies for channel compression. At the level of backbone SCS communication channels, dynamic multiplexers, which have the ability to account for the current needs of subscribers for message transmission by changing the structure of the multiplexed digital streams (MDS) frame, have become widespread. The possibilities for redistributing subscriber digital streams within the MDS frame largely depend on the number of time slots (TS) in the frame and the restrictions imposed by the algorithm used in the dynamic multiplexer management system for controlling the frame structure. The algorithms currently in use employ absolute TS addressing to encode the positions of TS allocated to various message sources in the MDS frame. This provides high flexibility in decision-making regarding the set of allocated VIs and operational control, but leads to the need to allocate a significant portion of the bandwidth resource of the communication channel with multiplexing for transmitting control channel (CC) messages of the MTP. As a result, increasing the total rate of channels packed in the MTP to levels close to the bandwidth of the communication channel with multiplexing reduces the quality of service. This is mainly due to transmission delays caused by the reduction of the maximum rate because a significant portion of the channel bandwidth is allocated for transmitting CC messages of the MTP. The article discusses a frame structure management algorithm in communication systems with dynamic multiplexing, which allows significantly reducing the MTP bandwidth resource required for operational management of the MTP frame structure.

Objective – to synthesize a frame structure control algorithm in communication systems with dynamic multiplexing based on an arithmetic progression, taking into account the random nature of both the arrival of compression requests and their needs for using the TDMA resource.

The synthesis of a control algorithm for the frame structure of a dynamic multiplexer based on a complex arithmetic progression was carried out, providing command compression in the CPU control unit.

The implementation of the developed algorithm involves organizing the CU in communication channels with multiplexing in the CCC under conditions of the random nature of IS requests, based on the allocation of VI in the MCP frame, taking into account efficient coding based on the use of arithmetic progression and a randomized strategy for deciding on the allocated IS positions in the MCP frame. As a result, this ensures increased efficiency in providing telecommunications services by compressing control commands in the MCP CU.

Rudakova O.V. Algorithm for frame structure management in communication systems with dynamic multiplexing. Science Intensive Technologies. 2026. V. 27. № 3. P. 35−42. DOI: https://doi.org/ 10.18127/j19998465-202603-05 (in Russian)

1. Konyshev M.Yu., Lezhnina Yu.A., Ivanov V.A. i dr. Klassifikaciya cifrovyh potokov v setyah svyazi po raspredeleniyu mnogomernyh dvoichnyh vektorov dlya resheniya zadach optimizacii trafika. Dinamika slozhnyh sistem XXI vek. 2026. T. 20. № 2. S. 14–23 DOI: 10.18127/j19997493-202602-02 (in Russian).
2. Rudakova O.V. Formirovanie soobshchenij v kanalah upravleniya cifrovyh potokov s dinamicheskim mul'tipleksirovaniem na osnove arifmeticheskoj progressii. Naukoemkie tekhnologii. 2026. T. 27. № 1. S. 38–47 DOI: https://doi.org/10.18127/ j19998465-202601-04 (in Russian).
3. Taha H. Vvedenie v issledovanie operacij: V 2-h knigah. Kn. 1. M.: Mir. 1985. 479 s.
4. Bespamyatnyh S.N. Raskraska ploskosti i teorema Van der Vardena o progressiyah. Kvant. № 12. 1983 (in Russian).
5. Plahov A.V. Algoritm razmeshcheniya kanalov peredachi informacii v cifrovom potoke s dinamicheskim mul'tipleksirovaniem. Promyshlennye ASU i kontrolery. 2018. № 4. S. 40–44 (in Russian).
6. Alekseev V.E., Talanov V.A. Grafy. Modeli vychislenij. Struktury dannyh: Uchebnik. N. Novgorod: Izd-vo NNGU. 2005. 307 s. (in Russian).