Premium
Dynamic switch migration with noncooperative game towards control plane scalability in SDN
Author(s) -
Wu Guowei,
Wang Jinlei,
Obaidat Mohammad S.,
Yao Lin,
Hsiao KueiFang
Publication year - 2019
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3927
Subject(s) - scalability , computer science , software defined networking , distributed computing , pareto principle , load balancing (electrical power) , forwarding plane , routing control plane , scheme (mathematics) , control (management) , computer network , mathematical optimization , mathematical analysis , geometry , mathematics , database , artificial intelligence , network packet , grid
Summary As software‐defined networking (SDN) is a logically centralized technology, the control plane scalability in SDN is increasingly important with the network scale increasing. Load balancing and maximizing resource utilization are very critical to the control plane in SDN, while switch migration is an effective approach to achieve these two performance metrics. However, switch migration is NP‐hard problem because it belongs to the problem of combinatorial optimization. To avoid the NP‐hard problem, we propose a switch migration scheme by adopting noncooperative game to improve the control plane scalability in SDN. First, we design a novel load balancing monitoring scheme to detect the load imbalance between controllers and trigger migrating switches. Then, we use noncooperative game among controllers to decide switch migration to get the maximizing overall profits. Last, we prove that our proposed approach can get Pareto optimality. Extensive simulations prove that our method is able to achieve a more scalable control plane with load balancing and maximizing resource utilization.