Извините, этот техт доступен только в “Американский Английский”. For the sake of viewer convenience, the content is shown below in the alternative language. You may click the link to switch the active language.
DEVELOPMENT OF A MULTIPATH ROUTING ALGORITHM IN SOFTWARE-DEFINED COMMUNICATION NETWORKS
Alexey S. Volkov, National Research University of Electronic Technology, Moscow, Zelenograd, Russia, leshvol@mail.ru
Aleksandr E. Baskakov, National Research University of Electronic Technology, Moscow, Zelenograd, Russia, 9999924816@ya.ru
Abstract
The paper describes the development of routing algorithm in software-defined communication networks using the principle of multi-path message delivery. The use of the OpenFlow protocol as the main one for connecting data- and control-plane devices between each other, that is, programmable switches with the controller, allows us to take the network topology presented in undirected weighted graph form as the initial data for the algorithm. There are known solutions to the problem of finding ways to transmit data in a communication network, as a rule, using the network resource reservation protocol, but additional restrictions are imposed on the network, since RSVP has a low degree of scalability, respectively, inappropriate consumption of computing resources and storage system resources of individual routers. In view of the above, an algorithm has been developed for finding a set of paths on a graph with the construction of an auxiliary graph based on the original one. Conditions are given under which an auxiliary graph can be constructed from the initial one. The algorithm takes into account the possibility of constructing several paths passing through one vertex, while meeting the requirements for the delay of the input data stream. To expand the functionality and possible areas of application of the algorithm for finding a set of paths, a criterion for the required total throughput by a set of data transmission paths is introduced. Conditions for constructing paths from a vertex to set of vertices are given. The algorithm presented in the work has an order of magnitude less time complexity, which allows you to quickly respond to changes in the data transmission network, while the most significant differences in the time spent on building a set of paths are noticeable with an increase in nodes in the data transmission network and the number of possible paths.
Keywords: software-defined networks, routing algorithm, multipath routing.
References
1. M.Garrich, F.J. Moreno-Muro, M.V.B. Delgado, and P.P. Marino (2018). Open-source network optimization software in the open SDN/NFV transport ecosystem. Journal of Lightwave Technology, 37(1), pp. 75-88.
2. M. Alsaeedi, M.M. Mohamad, and A.A., Al-Roubaiey (2019). Toward adaptive and scalable OpenFlow-SDN flow control: A survey. IEEE Access, 7, pp. 107346-107379.
3. I.Z. Bholebawa, R.K. Jha, and U.D. Dala (2016). Performance analysis of proposed OpenFlow-based network architecture using mininet. Wireless Personal Communications, 86(2), pp. 943-958.
4. W. Kim, J. Li, J.W.K. Hong and Y.J. Suh (2016), June. OFMon: OpenFlow monitoring system in ONOS controllers. In 2016 IEEE NetSoft Conference and Workshops (NetSoft), pp. 397-402.
5. S. Jero, X. Bu, C. Nita-Rotaru, H. Okhravi, R. Skowyra and S. Fahmy (2017), September. Beads: automated attack discovery in openflow-based sdn systems. In International Symposium on Research in Attacks, Intrusions, and Defenses, Springer, Cham, pp. 311-333.
6. T. Bakhshi and B. Ghita (2016), October. OpenFlow-enabled user traffic profiling in campus software defined networks. In 2016 IEEE 12th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 1-8.
7. Y. Li, D. Zhang, J. Taheri and K. Li (2018). SDN components and OpenFlow. In Big Data and Software Defined Networks. IET, pp. 49-67.
8. S. Qiao, C. Hu, X. Guan, and J. Zou (2016), August. Taming the flow table overflow in openflow switch. In Proceedings of the 2016 ACM SIGCOMM Conference, pp. 591-592.
9. A. Al-Najjar, S. Layeghy, and M. Portmann (2016), March. Pushing SDN to the end-host, network load balancing using OpenFlow. In 2016 IEEE international conference on pervasive computing and communication workshops (percom workshops), pp. 1-6.
10. K. Dong, Y. Zhao, X. Yu, J. Zhang, H. Yu, and Z. Li (2019), July. Auxiliary Graph Based Routing, Wavelength and Time-slot Assignment in Metro Quantum Optical Networks. In 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), pp. 1-3.
11. M.A. Khan, M.A. Shah, F.Z. Raja and H.A. Khattak (2019), December. A Novel Technique of Dynamic Resource Allocation in Software Defined Network. In 2019 15th International Conference on Emerging Technologies (ICET), pp. 1-5.
12. J.W Guck, M. Reisslein, and W. Kellerer (2016). Function split between delay-constrained routing and resource allocation for centrally managed QoS in industrial networks. IEEE Transactions on Industrial Informatics, 12(6), pp. 2050-2061.
13. A. Javadpour, G. Wang, and X. Xing (2018), December. Managing heterogeneous substrate resources by mapping and visualization based on software-defined network. In 2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom), pp. 316-321.
Information about author:
Alexey S. Volkov, assistant professor of the Department of Telecommunications, National Research University of Electronic Technology, Moscow, Zelenograd, Russia
Aleksandr E. Baskakov, graduate student of the Department of Telecommunications, National Research University of Electronic Technology, Moscow, Zelenograd, Russia