Abstract

Switch-controller assignment is an essential task in multi-controller software-defined networking. Static assignments are not practical because network dynamics are complex and difficult to predetermine. Since network load varies both in space and time, the mapping of switches to controllers should be adaptive to sudden changes in the network. To that end, switch migration plays an important role in maintaining dynamic switch-controller mapping. Migrating switches from overloaded to underloaded controllers brings flexibility and adaptability to the network but, at the same time, deciding which switches should be migrated to which controllers, while maintaining a balanced load in the network, is a challenging task. This work presents a heuristic approach with solution shaking to solve the switch migration problem. Shift and swap moves are incorporated within a search scheme. Every move is evaluated by how much benefit it will give to both the immigration and outmigration controllers. The experimental results show that the proposed approach is able to outweigh the state-of-art approaches, and improve the load balancing results up to ≈ 14% in some scenarios when compared to the most recent approach. In addition, the results show that the proposed work is more robust to controller failure than the state-of-art methods.

Highlights

  • In networking, data travels according to predefined policies

  • CONTROLLER FAILURE our main objective in this work is to improve the load balancing results via switch migration, in this test we evaluate the efficiency of the proposed work under controller failure

  • WORK switch migration problem (SMP) is a key-issue in dynamic switch-controller assignments in software-defined networking (SDN)

Read more

Summary

INTRODUCTION

Data travels according to predefined policies. These are defined in the management plane, enforced by the control plane and carried out by the data plane. A solution to SMP is supposed to find three unknown sets: outmigration controllers, switches to migrate, and immigration controllers, which is an NP-hard problem [16] and requires a heuristic algorithm to solve it within a reasonable time-frame. An on-line controller load balancing algorithm (OCLB) [29] was developed to solve the SMP. This algorithm iteratively reduces the load imbalance until no further switch migration is willing to improve the solution. Breadth-first search (BFS) is used in [48] to develop a control-domain adjustment algorithm (CDAA), where BFS is used to select the outmigration switches based on the switch distance to the its master controller and current traffic load.

A HEURISTIC ALGORITHM
SEARCH SCHEME
RESULTS
CONCLUSIONS AND FUTURE WORK
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.