<abstract xmlns="http://www.w3.org/1999/xhtml"><p>A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.</p></abstract>

A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the introduction of a two-level hierarchy of calculating the routing variables responsible for the formation of the primary and backup paths, and secondly, in ensuring a balanced load of the communication links of the network, which meets the requirements of the traffic engineering concept. The method provides implementation of link, node, path, and bandwidth protection schemes for fast re-routing in SDN. The separation in accordance with the interaction prediction principle along two hierarchical levels of the calculation functions of the primary (lower level) and backup (upper level) routes allowed to abandon the initial sufficiently large and nonlinear optimization problem by transiting to the iterative solution of linear optimization problems of half the dimension. The analysis of the proposed method confirmed its efficiency and effectiveness in terms of obtaining optimal solutions for ensuring balanced load of communication links and implementing the required network element protection schemes for fast re-routing in SDN.

Enhanced method of fast re-routing with load balancing in software-defined networks

Kharkiv National University of Radio Electronics

Department of Infocommunication Engineering

Journal of Electrical Engineering

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A two-level method of fast re-routing with load balancing in a software-defined network (SDN) is proposed. The novelty of the method consists, firstly, in the...

Enhanced method of fast re-routing with load balancing in software-defined networks

Publié en ligne: 19 janv. 2018

Pages: 444 - 454

Reçu: 30 mai 2017

DOI: https://doi.org/10.1515/jee-2017-0079

Mots clés
SDN, flow-based model, fast re-routing, load balancing, link utilization, primary path, backup path, calculations hierarchy

© 2017 Oleksandr Lemeshko et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Enhanced method of fast re-routing with load balancing in software-defined networks

Publié en ligne: 19 janv. 2018

Pages: 444 - 454

Reçu: 30 mai 2017

DOI: https://doi.org/10.1515/jee-2017-0079

Mots clésSDN, flow-based model, fast re-routing, load balancing, link utilization, primary path, backup path, calculations hierarchy

© 2017 Oleksandr Lemeshko et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mots clés
SDN, flow-based model, fast re-routing, load balancing, link utilization, primary path, backup path, calculations hierarchy