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

Oleksandr Lemeshko 1  and Oleksandra Yeremenko 1
  • 1 Kharkiv National University of Radio Electronics, Department of Infocommunication Engineering, Kharkiv, Ukraine


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.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] R. White and J. E. Tantsura, Navigating Network Complexity: Next-Generation Routing with SDN, Service Virtualization, and Service Chaining, Addison-Wesley Professional, 2015.

  • [2] A. S. Monge and K. G. Szarkowicz, MPLS the SDN Era: Interoperable Scenarios to Make Networks Scale to New Services, O’Reilly Media, 2016.

  • [3] T. D. Nadeau and K. Gray, SDN, Software Defined Networks: An Authoritative Review of Network Programmability Technologies, O’Reilly Media, 2013.

  • [4] G. Pujolle, Software Networks: Virtualization, SDN, 5G, Security, John Wiley & Sons, 2015.

  • [5] J. Rak, D. Papadimitriou, H. Niedermayer and P. Romero, “Information-Driven Network Resilience: Research Challenges and Perspectives”, Optical Switching and Networking, vol. 23, Part 2, pp. 156–178, January 2017.

  • [6] J. Domzal and R. Wojcik, “Efficient and Reliable Transmission Flow-Aware Networks - an Integrated Approach based on SDN Concept”, Proc. 2017 International Conference on Computing Networking and Communications (ICNC), 26-29 January 2017, pp. 837–842.

  • [7] J. Domzal, Z. Dulinski, J. Rozsa, P. Gawowicz, E. Biernacka and R. Wojcik, “Automatic Hidden Bypasses Software-Defined Networks”, Journal of Network and Systems Management, vol. 25, no. 3, pp. 457–480, 1 July 2017.

  • [8] P. Smith, D. Hutchison, J. P. Sterbenz, M. Schöller, A. Fessi, M. Karaliopoulos, C. Lac and B. Plattner, “Network Resilience: a Systematic Approach”, IEEE Communications Magazine, vol. 49, no. 7, pp. 88–97, July 2011.

  • [9] D. Tipper, “Resilient Network Design: Challenges and Future Directions”, Telecommunication Systems, vol. 56, no. 1, pp. 5–16, May 2014.

  • [10] I. Hussain, Fault-Tolerant IP and MPLS Networks (Networking Technology), Indianapolis: Cisco Press, 2005.

  • [11] I. Koren and C. Krishna, Fault-Tolerant Systems, Morgan Kaufmann, 2007.

  • [12] R. Kuhn, B. Hanafee, J. Allen, Reactive Design Patterns, Manning Publications, 2017.

  • [13] Y. Seok, Y. Lee, Y. Choi and C. Kim, “Dynamic Constrained Traffic Engineering for Multicast Routing”, Proc. Information Networking: Wired Communications and Management, vol. 2343, September 2002, pp. 278–288.

  • [14] Y. Wang and Z. Wang, “Explicit Routing Algorithms for Internet Traffic Engineering”, Proceedings Eight International Conference on Computer Communications and Networks (Cat. no. 99EX370), 11-13 Oct.1999, pp. 582–588.

  • [15] Y. Seok, Y. Lee, C. Kim and Y. Choi, “Dynamic Constrained Multipath Routing for MPLS Networks”, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. no. 01EX495), 15-17 Oct.2001, pp. 348–353.

  • [16] O. V. Lemeshko, S. V. Garkusha, O. S. Yeremenko and A. M. Hailan, “Policy-based QoS Management Model for Multiservice Networks”, Proc. 2015 International Siberian Conference on Control and Communications (SIBCON), 21-23 May 2015, pp. 1–4.

  • [17] A. V. Lemeshko, O. Yu. Evseeva and S. V. Garkusha, “Research on Tensor Model of Multipath Routing Telecommunication Network with Support of Service Quality by Greate Number of Indices”, Telecommunications and RadioEngineering, vol. 73, no. 15, pp. 1339–1360, 2014.

  • [18] O. S. Yeremenko, O. V. Lemeshko, O. S. Nevzorova and A. M. Hailan, “Method of Hierarchical QoS Routing Based on the Network Resource Reservation”, Proc. 2017 IEEE First Ukraine Conference on Electrical and Computer Engineering (UKR-CON), May 29 - June 2, 2017, pp. 971–976.

  • [19] K. Xu, D. Tipper, Y. Qian, P. Krishnamurthy and S. Tipmongkonsilp, “Time-Varying Performance Analysis of Multihop Wireless Networks with CBR Traffic”, IEEE Transactions on Vehicular Technology, vol. 63, no. 7, pp. 3397–3409, September 2014.

  • [20] K. A. Alnowibet, “Nonstationary Erlang Loss Queues and Networks”, PhD Thesis, North Carolina State University, 2004.

  • [21] O. V. Lemeshko and O. S. Yeremenko, “Dynamics Analysis of Multipath QoS-Routing Tensor Model with Support of Different Flows Classes”, Proc. 2016 International Conference on Smart Systems and Technologies (SST), 12-14 Oct 2016, pp. 225–230.

  • [22] O. V. Lemeshko, O. S. Yeremenko and A. M. Hailan, “QoS Solution of Traffic Management based on the Dynamic Tensor Model the Coordinate System of Interpolar Paths and Internal Node Pairs”, Proc. 2016 International Conference Radio Electronics & Info Communications (UkrMiCo), 11-16 September 2016, pp. 1-6.

  • [23] T. Gomes, L. Martins, S. Ferreira, M. Pascoal and D. Tipper, “Algorithms for Determining a Node-Disjoint Path Pair Visiting Specified Nodes”, Optical Switching and Networking, vol. 23, Part 2, pp. 189–204, January 2017.

  • [24] O. Lemeshko, K. Arous and N. Tariki, “Effective Solution for Scalability and Productivity Improvement Fault-Tolerant Routing”, Proc. 2015 Second International Scientific-Practical Conference Problems of Infocommunications Science and Technology (PIC S&T), 13-15 October 2015, pp. 76–78.

  • [25] O. S. Yeremenko, O. V. Lemeshko and N. Tariki, “Fast ReRoute Scalable Solution with Protection Schemes of Network Elements”, Proc. 2017 IEEE First Ukraine Conference on Electrical and Computer Engineering (UKRCON), May 29 – June 2, 2017, pp. 783–788.

  • [26] M. Luo, Y. Zeng, J. Li and W. Chou, “An Adaptive Multi-Path Computation Framework for Centrally Controlled Networks”, Computer Networks, vol. 83, no. C, pp. 30–44, June 2015.

  • [27] S. C. Lin, P. Wang and M. Luo, “Control Traffic Balancing Software Defined Networks”, Computer Networks, vol. 106, pp. 260–271, September 2016.

  • [28] M. D. Mesarovic, D. Macko and Y. Takahara, Theory of Hierarchical, Multilevel, System, Academic Press, 1970.

  • [29] M. G. Singh and A. Titli, Systems: Decomposition, Optimization and Control, Oxford: Pergamon, 1978.


Journal + Issues