Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane

• Published in: Chinese Journal of Electronics Vol. 27; no. 2; pp. 342 - 350
• Main Authors: Hu, Jie, Lin, Chuang, Zhang, Puheng
• Format: Journal Article
• Language: English
• Published: Published by the IET on behalf of the CIE 01.03.2018
• Subjects: computer network performance evaluation; Control plane; distributed control plane; divide and conquer methods; divide‐and‐conquer strategy; hierarchical architecture; Karush‐Kuhn‐Tucker condition; KKT condition; minimisation; modeling routing request arrival; optimal resource allocation policy; optimization problem; P2P architecture; peer to peer architecture; peer‐to‐peer computing; Performance evaluation; queueing theory; queuing theory; Resource allocation; resource allocation problem; response time minimisation; Routing; routing performance; routing response time; SDN control plane; software defined networking; Software defined networking (SDN); telecommunication network routing; tree‐like hierarchical routing architecture; routing performance; Performance evaluation; optimization problem; divide and conquer methods; hierarchical architecture; SDN control plane; queuing theory; resource allocation; optimal resource allocation policy; tree-like hierarchical routing architecture; queueing theory; peer-to-peer computing; routing response time; peer to peer architecture; software defined networking; P2P architecture; Karush-Kuhn-Tucker condition; Routing; Control plane; divide-and-conquer strategy; computer network performance evaluation; resource allocation problem; distributed control plane; response time minimisation; modeling routing request arrival; telecommunication network routing; Software defined networking (SDN); minimisation; KKT condition
• ISSN: 1022-4653; 2075-5597
• DOI: 10.1049/cje.2017.09.022

In Software defined networking (SDN), distributed control plane is becoming a promising solution to tackle with scalability and performance. We propose a tree-like hierarchical routing architecture which employs the divide-and-conquer strategy to enhance routing performance on the distributed control plane. To evaluate and optimize the performance of the hierarchical architecture, we apply queuing theory to modeling routing request arrival and processing, and derive an explicit expression of the routing response time. Then we formulate the resource allocation problem in the hierarchical architecture as an optimization problem whose objective is to minimize the response time subject to queue stability and resource constraints. Using the Karush- Kuhn-Tucker (KKT) condition we obtain the optimal resource allocation policy. Based on that, we theoretically prove that the response time under the hierarchical routing architecture is strictly less than that under the Peer to peer (P2P) architecture. Finally, we perform numerical analyses to confirm the conclusions.