TY - GEN
T1 - Packet-in Request Redirection for Minimizing Control Plane Response Time
AU - Xia, Rui
AU - Dai, Haipeng
AU - Zheng, Jiaqi
AU - Xu, Hong
AU - Li, Meng
AU - Chen, Guihai
PY - 2020/5
Y1 - 2020/5
N2 - A distributed control plane is more scalable and robust in software defined networking. This paper focuses on controller load balancing using packet-in request redirection, that is, given the instantaneous state of the system, determining whether to redirect packet-in requests for each switch, such that the overall control plane response time (CPRT) is minimized. To address the above problem, we propose a framework based on Lyapunov optimization. First, we use the drift-plus-penalty algorithm to combine CPRT minimization problem with controller capacity constraints, and further derive a non-linear program, whose optimal solution is obtained with brute force using standard linearization techniques. Second, we present a greedy strategy to efficiently obtain a solution with a bounded approximation ratio. Third, we reformulate the program as a problem of maximizing a non-monotone submodular function subject to matroid constraints. We implement a controller proto-type for packet-in request redirection, and conduct trace-driven simulations to validate our theoretical results. The results show that our algorithms can reduce the average CPRT by 81.6% compared to static controller-switch assignment, and achieve a 3× improvement in maximum controller capacity violation ratio.
AB - A distributed control plane is more scalable and robust in software defined networking. This paper focuses on controller load balancing using packet-in request redirection, that is, given the instantaneous state of the system, determining whether to redirect packet-in requests for each switch, such that the overall control plane response time (CPRT) is minimized. To address the above problem, we propose a framework based on Lyapunov optimization. First, we use the drift-plus-penalty algorithm to combine CPRT minimization problem with controller capacity constraints, and further derive a non-linear program, whose optimal solution is obtained with brute force using standard linearization techniques. Second, we present a greedy strategy to efficiently obtain a solution with a bounded approximation ratio. Third, we reformulate the program as a problem of maximizing a non-monotone submodular function subject to matroid constraints. We implement a controller proto-type for packet-in request redirection, and conduct trace-driven simulations to validate our theoretical results. The results show that our algorithms can reduce the average CPRT by 81.6% compared to static controller-switch assignment, and achieve a 3× improvement in maximum controller capacity violation ratio.
UR - https://www.scopus.com/pages/publications/85088896697
UR - https://www.scopus.com/pages/publications/85088896697#tab=impact
U2 - 10.1109/IPDPS47924.2020.00099
DO - 10.1109/IPDPS47924.2020.00099
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781728168760
T3 - Proceedings - IEEE International Parallel and Distributed Processing Symposium
SP - 926
EP - 935
BT - Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020
PB - IEEE
T2 - 34th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2020)
Y2 - 18 May 2020 through 22 May 2020
ER -