350 rub
Journal Radioengineering №8 for 2016 г.
Article in number:
Development and research of fast rerouting traffic algorithm between Data Centers
Keywords:
data centers
adaptive routing
fast rerouting
communication links
network traffic
resiliency
service providers
Authors:
V.P. Koryachko - Dr. Sc. (Eng.), Professor, Ryazan State Radio Engineering University. E-mail: koryachko.v.p@rsreu.ru
D.A. Perepelkin - Ph. D. (Eng.), Associate Professor, Ryazan State Radio Engineering University. E-mail: dmitryperepelkin@mail.ru
M.A. Ivanchikova - Post-graduate Student, Ryazan State Radio Engineering University. E-mail: ivanchikova.masha@yandex.ru
Abstract:
At the present day the virtualization of network infrastructure or its part by data centers (DC) provides flexible management of network topology and function in real time. This method allows to get rid of the excess costs of expensive equipment and network service. To provide resiliency of the network structure, backup links are often used. But in the practice DC can be served by different telecommunications providers. So it necessary to provide adaptive routing and fast rerouting between DC with using new routing algorithms that provides the resiliency of adaptive routing processes during dynamic failures of communication nodes and links.
Mathematical model and fast rerouting traffic algorithm between data centers that provide the resiliency adaptive routing processes during dynamic failures of communication nodes and links are offered in article. Proposed mathematical model and fast rerouting traffic algorithm provide resiliency of adaptive routing processes during dynamic failures of communication nodes and links and can increase the effectiveness of the network operations between DC by reducing the complexity of routing table building and absence of need to perform their full recalculation. To validate the correctness of proposed algorithm, software for simulation of routing processes in network between data centers during dynamic failures of communication nodes and links was developed. This software proves the effectiveness of the proposed approach in comparison with existing analogues.
Pages: 133-139
References
- Mikhajjlov R.L., Makarenko S.I. Ocenka ustojjchivosti seti svjazi v uslovijakh dejjstvija na nee destabilizirujushhikh faktorov // Radiotekhnicheskie i telekommunikacionnye sistemy. 2013. № 4. S. 69−79.
- Makarenko S.I. Prednamerennoe formirovanie informacionnogo potoka slozhnojj struktury za schet vnedrenija v sistemu svjazi dopolnitelnogo imitacionnogo potoka // Voprosy kiberbezopasnosti. 2014. № 3 (4). S. 7−13.
- 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.
- 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.
- 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.
- Sharafat A.R., Das S., Parulkar G.M., McKeown N. MPLS-TE and MPLS VPNS with OpenFlow. Proc. of the ACM SIGCOMM 2011 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Toronto. ON. Canada. August 2011.
- Korjachko V.P., Izhvanov JU.L., SHibanov A.P. Metod rascheta kharakteristik vysokoskorostnykh opornykh kanalov Rossijjskojj universitetskojj seti RUNNet // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2011. № 38. S. 55−60.
- Zhang-Shen R., McKeown N. Guaranteeing Quality of Services to Peering Traffic. Proc. IEEE INFOCOM. April 2008.
- Zhang-Shen R., McKeown N. Designing a Fault-Tolerant Network Using Valiant Load-Balancing. Proc. IEEE INFOCOM. 2008. P. 2360−2368.
- Izhvanov JU.L., Korjachko V.P., SHibanov A.P., Saprykin A.N., Lukjanov O.V. Optimizacija setejj s dozirovannojj balansirovkojj nagruzki i piringovymi kanalami // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2013. № 1 (43). S. 67−74.
- Erickson D., Heller B., Yang S., Chu J., Ellithorpe J., McKeown N., Parulkar G., Rosenblum M. Optimizing a Virtualized Data Center. Proc. ACM SIGCOMM. 2011. P. 478−479.
- Dan Li, Chuanxiong Guo, Haitao Wu, Kun Tan, Yongguang Zhang, Songwu Lu. FiConn: Using BackupPort for Server Interconnection in Data Centers // Proc. IEEE INFOCOM. 2009. P. 2276−2285.
- Andersen D., Balakrishnan H., Kaashoek F., Morris R. Resilient Overlay Networks // Proc. 18th ACM Symposium on Operating Systems Principles. 2001. P. 131−145.
- Korjachko V.P., Perepelkin D.A., Ivanchikova M.A. Algoritm parnykh perekhodov kanalov svjazi pri dinamicheskom izmenenii nagruzki v korporativnykh setjakh neskolkikh provajjderov svjazi s razlichnymi zonami pokrytija // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2014. № 47. S. 72−80.
- Yong Liu, A.L. Narasimha Reddy. A Fast Rerouting Scheme for OSPF/IS-IS Networks // Proc. of ICCCN. October 2004.
- Korjachko V.P., Perepelkin D.A. Analiz i proektirovanie marshrutov peredachi dannykh v korporativnykh setjakh. M.: Gorjachaja linija - Telekom. 2012. 235 s.
- Jarry A. Fast reroute paths algorithms // Telecommunication Systems. 2013. V. 52. N 2. P. 881−888.
- Korjachko V.P., Perepelkin D.A., Ivanchikova M.A. Algoritm adaptivnojj marshrutizacii v korporativnykh setjakh neskolkikh provajjderov svjazi // Vestnik Rjazanskogo gosudarstvennogo radiotekhnicheskogo universiteta. 2013. № 2 (44). S. 52−56.