Keywords: Software-Defined Network, Fast ReRouting, path protection, bandwidth


The subject matter of the article is the fast rerouting processes with the implementation of the protection scheme of the path and its bandwidth. The goal of the work is to improve the performance-based Fast ReRoute model with the protection scheme of the path and its bandwidth, which can be used for Software-Defined Networks. The following tasks are solved in the article: improvement and research of the Fast ReRoute model with the protection scheme of the path and its bandwidth. The following methods are used: graph theory, queuing theory, and mathematical programming methods. The following results were obtained: Fast ReRoute model was improved and investigated. That allows implementing the 1:n protection scheme of the path and its bandwidth in Software-Defined Networks. Conclusions: Within the framework of the proposed Fast ReRoute model with the schemes of the path protection and its bandwidth, the problem of calculating the set of primary and backup disjoint paths was solved. The proposed mathematical model, using the introduction of additional conditions, allowed us to reduce the solution of the technological problem of fast rerouting to the solution of the optimization problem of mixed integer linear programming. The advantage of the improved model is the possibility of implementing protection schemes 1:1, 1:2, ..., 1:n without introducing an additional set of control (routing) variables. This helps to reduce the dimension of the optimization problem to be solved and the computational complexity of its implementation. The optimality criterion of routing solutions contributes to the formation of primary and backup disjoint paths with the maximum bandwidth. In this case, the path with the highest bandwidth will correspond to the primary path, while the remaining paths will be used as a backup, in order to reduce their bandwidth. The total number of calculated disjoint paths depends on the selected redundancy scheme.


Download data is not yet available.

Author Biographies

Oleksandra Yeremenko, Kharkiv National University of Radio Electronics
Doctor of Sciences (Engineering), Associate Professor, Professor of V. V. Popovskyy Department of Infocommunication Engineering
Maryna Yevdokymenko, Kharkiv National University of Radio Electronics
PhD (Engineering Sciences), Associate Professor of V. V. Popovskyy Department of Infocommunication Engineering
Batoul Sleiman, Kharkiv National University of Radio Electronics
Graduate Student of V. V. Popovskyy Department of Infocommunication Engineering


White, R., Banks. E. (2018), Computer Networking Problems and Solutions: An innovative approach to building resilient, modern networks, 1st ed., Addison-Wesley Professional, 832 p.

Blokdyk, G. (2018), SD-WAN A Complete Guide, Edition Paperback, 300 p.

Abd Elazim, N. M., Sobh, M. A., Bahaa-Eldin, A. M. (2018), "Software Defined Networking: Attacks and Countermeasures", in Proc. 2018 13th International Conference on Computer Engineering and Systems (ICCES), P. 555–567. DOI:

Prajapati, A., Sakadasariya, A., Patel, J. (2018), "Software defined network: Future of networking", in Proc. 2018 2nd International Conference on Inventive Systems and Control (ICISC), P. 1351–1354. DOI:

Kim, T., Nguyen-Duc, T. (2018), "OQR: On-demand QoS Routing without Traffic Engineering in Software Defined Networks", in Proc. 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft), P. 362–365. DOI:

Linkov, I. (2019), Cyber Resilience of Systems and Networks (Risk, Systems and Decisions), 1st ed. Kindle Edition, 475 p.

Rak. J. (2015), Resilient Routing in Communication Networks. 1st edition, Springer, 179 p.

Lemeshko, A. V., Evseeva, O. Yu., Garkusha. S. V. (2014), "Research on Tensor Model of Multipath Routing in Telecommunication Network with Support of Service Quality by Greate Number of Indices", Telecommunications and RadioEngineering, Vol. 73, Issue 15, P. 1339–1360. DOI:

Lemeshko, O., Yeremenko, O., Yevdokymenko, M., Shapovalova, A., Hailan, A.M., Mersni, A. (2019), "Cyber Resilience Approach Based on Traffic Engineering Fast ReRoute with Policing", in Proc. 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), P. 117–122. DOI:

Lemeshko, O., Yevdokymenko, M., Yeremenko, O. (2019), "Model of data traffic QoS fast rerouting in infocommunication networks", Innovative Technologies and Scientific Solutions for Industries, No. 3 (9), P. 127–134. DOI:

Lemeshko, O., Yeremenko, O., Yevdokymenko, M., Sleiman, B. (2019), "Enhanced Solution of the Disjoint Paths Set Calculation for Secure QoS Routing", in Proc. 2019 IEEE International Conference on Advanced Trends in Information Theory (ATIT), P. 1–4.

Lemeshko, O., Yeremenko, O., Yevdokymenko, M., Sleiman, B., Hailan, A.M., Mersni, A. (2019), "Computation Method of Disjoint Paths under Maximum Bandwidth Criterion", in Proc. 3rd IEEE International Conference Advanced Information and Communication Technologies (AICT), P. 161–164. DOI:

Lemeshko, O., Yevdokymenko, M., Naors, Y. A. A. (2018), "Development of the tensor model of multipath QoE-routing in an infocommunication network with providing the required Quality Rating", Eastern-European Journal of Enterprise Technologies, Vol. 5, Issue 2 (95), P. 40–46. DOI:

Chang, Z., Zhao, G., Sun, Y. (2013), "A Calculation Method for The Reliability of a Complex k-out-of-n System," in Proc. 2013 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE), P. 204–207.

Shi, Y. (2010), "Calculation of Network System Reliability Based on Improved Disjointed Minimal Path Set," in Proc. 2010 International Conference on E-Product E-Service and E-Entertainment, P. 1–4.

Guo, L. (2016), "Efficient approximation algorithms for computing k disjoint constrained shortest paths", Journal of Combinatorial Optimization, Vol. 32, Issue 1, P. 144–158.

Yu, Z.. Ni, M.. Wang, Z., Huang, H. (2011), "Heuristic algorithm for K-disjoint QoS routing problem. Computational Sciences and Optimization (CSO)", In Proc. of the Fourth International Joint Conference, P. 353–356. DOI:

Cruz, P., Gomes, T., Medhi, D. (2014), "A Heuristic for Widest Edge-disjoint Path Pair Lexicographic Optimization," in Proc. 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), P. 9–15. DOI:

Guck, J. W., Bemten, A. Van, Reisslein, M., Kellerer, W. (2018), "Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation", IEEE Communications Surveys & Tutorials, Vol. 20, No. 1, P. 388–415. DOI:

Karakus, M., Durresi, A. (2019), "Quality of Service (QoS) in Software Defined Networking (SDN): A survey", Journal of Network and Computer Applications, Vol. 80, P. 200–218. DOI:

Yang, Y., Xu, M., Li, Q. (2018), "Fast Rerouting Against Multi-Link Failures Without Topology Constraint", IEEE/ACM Transactions on Networking, Vol. 26, No. 1, P. 384–397. DOI:

Strelkovskaya, I., Solovskaya, I., Grygoryeva, T., Paskalenko, S. (2016), "The solution to the problem of the QoS characteristics definition for self-similar traffic serviced by the W/M/1 QS," in Proc. 2016 Third International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&T), P. 40 42. DOI:

Hasan, H., Cosmas, J., Zaharis, Z., Lazaridis, P., Khwandah, S. (2016), "Development of FRR mechanism by adopting SDN notion", in Proc. 2016 24th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), P. 1-7. DOI:

Lee, K., Kim, M., Kim, H., Chwa, H. S., Lee, J., Shin, I. (2019), "Fault-Resilient Real-Time Communication Using Software-Defined Networking", in Proc. 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), P. 204-215. DOI:

Chen, Y., Zhao, Z. (2018), "Research on Network Performance Optimization and Application of Wireless Intelligent Routing", in proc. 2018 IEEE International Conference of Safety Produce Informatization (IICSPI), P. 489-492. DOI:

Tipper, D. (2014), "Resilient network design: challenges and future directions. Telecommunication Systems", No. 56 (1), P. 5–16. DOI:

Mu, C., Zhang, J., Liu, Y. (2019), "Multi-objective ant colony optimization algorithm based on decomposition for community detection in complex networks", Soft Comput, P. 12683–12709 DOI:

Chen, C., Xu, C., Xu, C., Liu, D., Tian, L. (2018), "Trajectory Data Compression Using Hopfield Neural Network", in Proc. 2018 International Conference on Computational Science and Computational Intelligence (CSCI), P. 186–190. DOI:

Andrade, B. A. R., Ferreira, N. R. (2018), "Simulated annealing and tabu search applied on network reconfiguration in distribution systems", in Proc. 2018 Simposio Brasileiro de Sistemas Eletricos (SBSE), P. 1–6. DOI:

Abstract views: 16
PDF Downloads: 17
How to Cite