D.A. Perepelkin - Ph. D. (Eng.), Associate Professor, Ryazan State Radio Engineering University E-mail: dmitryperepelkin@mail.ru V.S. Byshov - Undergraduate, Ryazan State Radio Engineering University E-mail: b.v.s.12@yandex.ru

Providing high-speed and reliable transfer of data flows between network nodes with strict requirements to delay of the information transmission during possible traffic bursts and local overload of communication links is one of the most important problems. In this regard, to improve the quality of service (QoS) of network applications, we pay special attention to the implementation and support of multipath routing strategy and the use of composite metrics of communication links, which take into account the numerical values of the various QoS-parameters. A mathematical model of dynamic load balancing, which allows to increase the performance and reliability of computer networks at the expense of optimal loading telecommunication equipment, is offered in this paper. The proposed model takes into account the type of traffic on computer networks, allows to find optimal and backup routes, as well as to balance and distribute the load between them. Through the use of various QoS metrics it is possible to provide uniform loading of network resources and compliance with the QoS requirements for individual applications. The experimental studies on the various topologies of computer networks confirm the validity of the proposed approach. The developed software of simulation of adaptive multipath routing processes and load balancing demonstrates the efficiency of this approach in comparison with existing analogues, depending on the criterion of QoS and the type of applications in computer networks.

 

1. Shenker S., Partridge C., Guerin R. Specification of Guaranteed Quality of Service. RFC 2212. Internet Engineering Task Force. September 1997.
2. Vishnevskijj V.M. Teoreticheskie osnovy proektirovanija kompjuternykh setejj. M.: Tekhnosfera. 2003. 512 s.
3. Korjachko V.P., Perepelkin D.A. Analiz i proektirovanie marshrutov peredachi dannykh v korporativnykh setjakh. M.: Gorjachaja linija - Telekom. 2012. 235 s.
4. Jin Y. Yen. Finding the k‑shortest Loopless Paths in a Network // Management Science. 1971. V. 17. № 11. P. 712−716.
5. Perepelkin D.A., Perepelkin A.I. Algoritm adaptivnojj uskorennojj marshrutizacii v uslovijakh dinamicheski izmenjajushhikhsja nagruzok na linijakh svjazi v korporativnojj seti // Informacionnye tekhnologii. 2011. № 3. S. 2−7.
6. Perepelkin D.A. Algoritm parnykh perestanovok marshrutov na baze protokola OSPF pri dinamicheskom podkljuchenii uzlov i linijj svjazi korporativnojj seti // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2013. № 4−1 (46). S. 67−75.
7. Perepelkin D.A. Algoritm parnykh perestanovok marshrutov na baze protokola OSPF pri dinamicheskom otkaze uzlov i linijj svjazi korporativnojj seti // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2014. № 47. S. 84−91.
8. Perepelkin D.A. Dinamicheskoe formirovanie struktury i parametrov linijj svjazi korporativnojj seti na osnove dannykh o parnykh perestanovkakh marshrutov // Informacionnye tekhnologii. 2014. № 4. S. 52−60.
9. McKeown N., Anderson T., Balakrishnan H., Parulkar G., Peterson L., Rexford J., Shenker S., Turner J. Openflow: Enabling Innovation in Campus Networks Proc. ACM SIGCOMM // Computer Communication Review. 2008. V. 38. № 2. P. 69−74.
10. Hilmi Enes Egilmez. Adaptive Video Streaming over OpenFlow Networks with Quality of Service. Thesis for Degree of Master Science in Electrical and Electronics Engineering. Koc University. July 2012. 91 p.
11. Perepelkin D.A., Perepelkin A.I. Razrabotka algoritmov adaptivnojj marshrutizacii v korporativnykh vychislitelnykh setjakh // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2006. № 19. S. 114−116.
12. Perepelkin A.I., Perepelkin D.A. Razrabotka algoritma dinamicheskojj marshrutizacii na baze protokola OSPF v korporativnykh vychislitelnykh setjakh // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2009. № 28. S. 68−72.
13. Korjachko V.P., Perepelkin D.A. Razrabotka i issledovanie matematicheskojj modeli mnogoputevojj adaptivnojj marshrutizacii v setjakh svjazi s balansirovkojj nagruzki // EHlektrosvjaz. 2014. № 12. S. 27−31.
14. Perepelkin D.A. Konceptualnyjj podkhod dinamicheskogo formirovanija trafika programmno-konfiguriruemykh telekommunikacionnykh setejj s balansirovkojj nagruzki // Informacionnye tekhnologii. 2015. T. 21. № 8. S. 602−610.
15. Perepelkin D.A. Matematicheskaja model mnogoputevojj adaptivnojj marshrutizacii s balansirovkojj neodnorodnojj nagruzki v uslovijakh dinamicheskikh podkljuchenijj uzlov i linijj svjazi v telekommunikacionnykh setjakh // Radiotekhnika. 2015. № 5. S. 46−54.
16. Perepelkin D.A. Model otkazoustojjchivojj mnogoputevojj adaptivnojj marshrutizacii s balansirovkojj neodnorodnojj nagruzki v setjakh svjazi // Radiotekhnika. 2015. № 11. S. 40−47.