T.A. Onufrieva - Ph. D. (Eng.), Associate Professor, Department «Computer systems and networks», Kaluga branch of the Bauman MSTU. E-mail: onufrievata@mail.ru A.A. Zaitseva - Student, Department «Computer systems and networks», Kaluga branch of the Bauman MSTU. E-mail: neshmet@yandex.ru

The main objective of the functioning of the telecommunications network - the timeliness and accuracy of the reporting of information. Route - this means not only laying route, but also means for blocking forwarding routes through the network. If the tables are configured incorrectly, the best packages will be delivered slowly, and in the worst case, they will not be delivered to where to apply, which can lead to a breach of the security of data transmission network. There are static and dynamic routing. Existing dynamic routing algorithms are used to determine optimum routes of delivery of information. One of the problems of algorithms is that information about the appearance of a good route to subnet spreads more or less rapidly, but the loss of data, the destruction of any of the route not spread so fast. In the development and implementation of new routing algorithms, it is necessary to study processes occurring in the network, in order to assess the functioning of the quality indicators, the accuracy of message delivery and support decision making. The most acceptable methods of research is considered to be methods of simulation. To solve these problems various mathematical devices are used. In this case, as the mathematical formalism of Markov chain is considered. Using a Markov chain modeling allows you to perform dynamic routing algorithm. As a condition for the implementation of the Markov chain is set probabilities of transition from one state to another. This model allows you to find the most probable state of the system, to determine the model error associated with the data about the destruction of any of the route.

 

1. Bobkov S.P., Bytev D.O. Modelirovanie sistem. Ivanovo: Izd-vo Ivanovskogo gosudarstvennogo khimiko-tekhnolo­gi­ches­ko­go universiteta. 2008. 156 s.
2. Vishnevskijj B.M., Porockijj C.M. Dinamicheskaja marshrutizacija v ATM-setjakh: problemy i reshenija //Avtomatika i telemekhanika. 2003. № 6. S. 20−23.
3. Lavrov D.N. Seti i sistemy telekommunikacijj. Federalnoe agentstvo po obrazovaniju. Omskijj gosudarstvennyjj universitet im. F.M. Dostoevskogo. Omsk. 2006. 182 s.
4. Doneckov A.M. Podkhod k resheniju zadachi kommivojazhera // EHlektromagnitnye volny i ehlektronnye sistemy. 2015. T. 20. № 7. S. 57−60.
5. Onufrieva T.A., Zajjceva A.A. Primenenie setejj Petri dlja modelirovanija i analiza IP-telefonii // EHlektromagnitnye volny i ehlektronnye sistemy. 2015. T. 20. № 7. S. 30−32.
6. Onufrieva T.A., Zajjceva A.A. Modelirovanie i analiz seti IP-telefonii // Innovacionnaja nauka. 2015. № 11‑2. S. 92−95.
7. Umyskov A.V., Blijalkin P.A., Smolenkov A.V. Problema vybora algoritma marshrutizacii // Bjulleten nauki i praktiki. 2016. № 6 (7). S. 142−146.
8. Saushev A.V. Markovskie modeli upravlenija sostojaniem slozhnykh tekhnicheskikh sistem // Trudy Mezhdunar. simpoziuma «Nadezhnost i kachestvo». 2014. T. 1. S. 57−62.
9. Marmaljuk P.A., JUrev G.A., Kuravskijj L.S. Rezultaty vychislitelnogo ehksperimenta po sravneniju metodov identifikacii markovskikh processov // Nejjrokompjutery: razrabotka, primenenie. 2015. № 9. S. 44−50.