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. This article examines a model of a self-similar request flow in dynamic multiplexing communication systems. Its use allows for a more accurate description of the request incoming process over time and, consequently, a significant reduction in the throughput resource of the MCP required for operational management of the MCP frame structure.

Objective – to enable analytical and simulation modeling of the distribution of time intervals between service request arrivals in dynamic multiplexers, reflecting both the Markov and fractal properties of the request incoming process.

An analytical model of the request flow at the input of dynamic multiplexing systems is proposed, taking into account the fractal properties of binary vector distribution series of various dimensions.

Implementation of the developed model will allow for an adequate reflection of the process of requests arriving at the input of a dynamic multiplexer and, as a result, will enable the synthesis of more efficient algorithms for managing the MCP frame structure by taking into account the Markov and fractal properties of the request flow distributions.

Rudakova O.V. Model of a self-similar flow of requests at the input of a trunk multiplexer with dynamic compression // Science Intensive Technologies. 2026. V. 27. № 4. P. 63−72. DOI: https://doi.org/ 10.18127/j19998465-202604-06

1. Osnovy gosudarstvennoj politiki v oblasti ispol'zovaniya rezul'tatov kosmicheskoj deyatel'-nosti v interesah modernizacii ekonomiki Rossijskoj Federacii i razvitiya ee regionov na period do 2030 goda. https://docs.cntd.ru/document/560853771 (In Russian).
2. Grigor'ev V.A., Grigor'ev S.V. Peredacha soobshchenij. SPb.: VUS. 2002. 460 s. (In Russian).
3. Gorshkov A.A., Plahov A.V., ShChurov K.S. Povyshenie operativnosti peredachi soobshchenij v kana-lah upravleniya mul'tipleksirovannymi cifrovyh potokov. Izv. Tul'skogo gos. un-ta. Ser.: Tekhni-cheskie nauki. 2016. Vyp. 9. S. 60–69 (In Russian).
4. Plahov A.V. Metod organizacii kanala upravleniya v sistemah videosvyazi s mul'tipleksirova-niem. Izv. Tul'skogo gos. un-ta. Ser.: Tekhnicheskie nauki. 2018. № 9. S. 137–147 (In Russian).
5. Klejnrok L. Teoriya massovogo obsluzhivaniya: Per. s angl. I.I. Grushko; pod red. V.I. Nejmana. M.: Mashinostroenie. 1979. 432 s. (In Russian).
6. Konoshenko S.A. Analiz effektivnosti obespecheniya kachestva obsluzhivaniya v mul'tiservis-nyh setyah na osnove izvestnyh algoritmov marshrutizacii. Izv. Tul'skogo gos. un-ta. Ser.: Tekhniche-skie nauki. 2014. № 9–2. S. 71–75 (In Russian).
7. Paxson V., Floyd S. Wide-Area Traffic: The Failure of Poisson Modeling. ACM SIGCOM'94. P. 257–268, 1994 (In Russian).
8. Sychev K.I., Sychev K.I. Mnogokriterial'noe proektirovanie mul'tiservisnyh setej svyazi. Voennaya akad. svyazi. SPb.: Izd-vo Politekhnicheskogo un-ta. 2008. 271 s. (In Russian).
9. Sheluhin O.I., Tenyakshev A.M., Osin A.V. Fraktal'nye processy v telekommunikaciyah. M.: Ra-diotekhnik. 2003. 480 s. (In Russian).
10. Gorodeckij A.Ya., Zaborovskij V.S., Mulyuha V.A. Propusknaya sposobnost' komp'yuternyh setej s fraktal'nymi svojstvami. Nauchno-tekhnicheskie vedomosti Sankt-Peterburgskogo gosudarstvenno-go politekhnicheskogo universiteta. Informatika. Telekommunikacii. Upravlenie. 2009. № 3(80). S. 12–18 (In Russian).
11. Konyshev M.Yu., Pushkin P.Yu., Smirnov S.V. i dr. Modelirovanie dvoichnyh markovskih pro-cessov, imeyushchih strogo samopodobnye svojstva raspredelenij dvoichnyh vektorov razlichnoj raz-mernosti. Perspektivnye materialy i tekhnologii (PMT-2023): Sbornik dokladov Nacional'noj nauchno-tekhnicheskoj konferencii s mezhdunarodnym uchastiem Instituta perspektivnyh tekhnologij i industrial'nogo programmirovaniya RTU MIREA. Moskva. 10–15 aprelya 2023 goda. M.: MIREA Ros-sijskij tekhnologicheskij universitet. 2023. S. 201–206 (In Russian).
12. Patent № 2841349 C1 RF, MPK G06F 7/58, H04L 9/00. n-svyaznyj Markovskij generator psev-dosluchajnoj dvoichnoj posledovatel'nosti. A.K. Vishnevskij, A.S. Grachev, M.Yu. Konyshev i dr. 2025 (In Russian).
13. Verifikaciya kriptograficheskih algoritmov na osnove ispol'zovaniya metoda simulyacii dvoichnyh sluchajnyh posledovatel'nostej s zadannymi statisticheskimi svojstvami. V.A. Baranov, M.Yu. Konyshev, A.A. Privalov, A.V. Shestakov. Naukoemkie tekhnologii v kosmicheskih issledova-niyah Zemli. 2019. T. 11. № 6. S. 45–52 (In Russian).
14. Belyaev D.L., Bliznyuk V.I., Ivanov V.A. i dr. Metod napravlennogo perebora ryadov rasprede-lenij v zadachah modelirovaniya markovskih dvoichnyh posledovatel'nostej. Promyshlennye ASU i kontrollery. 2015. № 5. S. 47–51 (In Russian).
15. Taha H. Vvedenie v issledovanie operacij: V 2-h knigah. Kn. 1. M.: Mir. 1985. 479 s. (In Rus-sian).
16. Rudakova O.V. Formirovanie soobshchenij v kanalah upravleniya cifrovyh potokov s dinamiche-skim mul'tipleksirovaniem na osnove arifmeticheskoj progressii. Naukoemkie tekhnologii. 2026. T. 27. № 1. S. 38–47 (In Russian).