Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane. Issue 2 (1st March 2018)

• Record Type: Journal Article
• Authors: Hu, Jie; Lin, Chuang; Zhang, Puheng
• Is Part Of: Chinese journal of electronics. Volume 27:Issue 2(2018)
• Page Start: 342
• Page End: 350
• Publication Date: 2018-03-01
• Subjects: Software defined networking (SDN) -- Control plane -- Routing -- Performance evaluation -- Resource allocation; computer network performance evaluation -- divide and conquer methods -- minimisation -- peer‐to‐peer computing -- queueing theory -- resource allocation -- software defined networking -- telecommunication network routing; SDN control plane -- distributed control plane -- routing performance -- hierarchical architecture -- modeling routing request arrival -- routing response time -- resource allocation problem -- optimal resource allocation policy -- divide‐and‐conquer strategy -- optimization problem -- peer to peer architecture -- P2P architecture -- tree‐like hierarchical routing architecture -- queuing theory -- response time minimisation -- Karush‐Kuhn‐Tucker condition -- KKT condition; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2017.09.022
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : 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.