To obtain access to full text of journal and articles you must register!
- Article name
- METHOD FOR SCHEDULING THE TRANSMISSION OF INFORMATION IN A COMMUNICATION SYSTEM WITH DYNAMIC NETWORK TOPOLOGY BASED ON A GRAPH BYPASS IN WIDTH
- Authors
- Khlebnikov S. G., , user72@mail.ru, Military Space Academy named after A. F. Mozayskiy, Ministry of Defense of the Russian Federation, St.-Petersburg, Russia
Kolpin M. A., , vka@mil.ru, Military Space Academy named after A. F. Mozayskij, St. Petersburg, Russia
Protsenko P. A., , vka@mil.ru, Military Space Academy named after A. F. Mozayskij, St. Petersburg, Russia
- Keywords
- dynamic graph / information system / capacity / communication network / route / speed
- Year
- 2023 Issue 2 Pages 3 - 10
- Code EDN
- FUFEKW
- Code DOI
- 10.52190/1729-6552_2023_2_3
- Abstract
- The article proposes a method of scheduling the transmission of information in a communication system with a dynamic network topology, based on a modification of the known algorithm for bypassing a graph in width. A modification of the algorithm for solving the dynamic problem consists in the fact that on each time discrete for each vertex of the graph selected for inclusion in the information transmission route, the possibility of transmitting information to other vertices is estimated, taking into account the existing restrictions on the time of existence and the weight of the edges connecting them. The method allows you to find in the dynamic graph such routes of information transfer from the source vertices to the drain vertex, which provide a minimum time of information delivery.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
