Dynamic switch-controller association and control devolution for SDN systems
2017 IEEE International Conference on Communications (ICC), 2017•ieeexplore.ieee.org
In software-defined networking (SDN), as data plane scale expands, scalability and
reliability of the control plane have become major concerns. To mitigate such concerns, two
kinds of solutions have been proposed separately. One is multi-controller architecture, ie, a
logically centralized control plane with physically distributed controllers. The other is control
devolution, ie, delegating control of some flows back to switches. Most of existing solutions
adopt either static switch-controller association or static devolution, which may not adapt …
reliability of the control plane have become major concerns. To mitigate such concerns, two
kinds of solutions have been proposed separately. One is multi-controller architecture, ie, a
logically centralized control plane with physically distributed controllers. The other is control
devolution, ie, delegating control of some flows back to switches. Most of existing solutions
adopt either static switch-controller association or static devolution, which may not adapt …
In software-defined networking (SDN), as data plane scale expands, scalability and reliability of the control plane have become major concerns. To mitigate such concerns, two kinds of solutions have been proposed separately. One is multi-controller architecture, i.e., a logically centralized control plane with physically distributed controllers. The other is control devolution, i.e., delegating control of some flows back to switches. Most of existing solutions adopt either static switch-controller association or static devolution, which may not adapt well to the traffic variation, leading to high communication costs between switches and controller, and high computation costs of switches. In this paper, we propose a novel scheme to jointly consider both solutions, i.e., we dynamically associate switches with controllers and dynamically devolve control of flows to switches. Our scheme is an efficient online algorithm that does not need the statistics of traffic flows. By adjusting some parameter V, we can make a trade-off between costs and queue backlogs. Theoretical analysis and extensive simulations show that our scheme yields much lower costs and latency compared to static schemes, and balanced loads among controllers.
ieeexplore.ieee.org