SDN Load Balancing Method based on K-Dijkstra
Author(s) -
Xiaohui Yang
Publication year - 2018
Publication title -
international journal of performability engineering
Language(s) - English
Resource type - Journals
ISSN - 0973-1318
DOI - 10.23940/ijpe.18.04.p14.709716
Subject(s) - dijkstra's algorithm , computer science , load balancing (electrical power) , distributed computing , real time computing , theoretical computer science , geology , shortest path problem , graph , geodesy , grid
In order to solve the problem that control and forwarding are closely coupled in traditional network, the network lack of innovation and programmability, and the network management and maintenance difficulty, an SDN load balancing method based on K-Dijkstra is proposed. By using SDN technology to achieve the separation of control and forwarding, the controller is responsible for the global scheduling, making the network flow and task scheduling more flexible than the traditional network. Through the integration of flow management, traffic monitoring, dynamic load balancing and load calculation in the SDN control layer, the K-Dijkstra algorithm and the HRRF algorithm are combined in the load balancing module to solve the problem of path selection. The traffic environment also has a better load balancing effect, optimizing the control layer structure, improving network management efficiency and achieving dynamic load balancing of network traffic. The simulation results on Mininet show that the method can significantly improve network delay, packet loss and throughput compared with traditional networks.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom