NDLI: Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane

Content Provider	IET Digital Library
Author	Hu, Jie Lin, Chuang Zhang, Puheng
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.
Starting Page	342
Ending Page	350
Page Count	9
ISSN	10224653
Volume Number	27
e-ISSN	20755597
Issue Number	Issue 2, Mar (2018)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/cje/27/2
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/cje.2017.09.022
Journal	Chinese Journal of Electronics
Publisher Date	2018-03-01
Access Restriction	Open
Rights Holder	© Chinese Institute of Electronics
Subject Keyword	Communication Network Design, Planning And Routing Computer Communication Computer Network And Technique Computer Network Performance Evaluation Distributed Control Plane Divide And Conquer Method Divide-and-conquer Strategy Hierarchical Architecture Karush-Kuhn-Tucker Condition KKT Condition Minimisation Modeling Routing Request Arrival Optimal Resource Allocation Policy Optimisation Technique Optimization Problem P2P Architecture Peer to Peer Architecture Peer-to-peer Computing Queueing Theory Queuing Theory Resource Allocation Resource Allocation Problem Response Time Minimisation Routing Performance Routing Response Time SDN Control Plane Software Defined Networking Telecommunication Network Routing Tree-like Hierarchical Routing Architecture
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

The karush-kuhn-tucker optimality conditions in fuzzy optimization (2010).

On the karush-kuhn-tucker reformulation of the bilevel optimization problem (2010).

Enhanced karush-kuhn-tucker condition and weaker constraint qualifications.

Investigating EA solutions for approximate KKT conditions in smooth problems

KKT proximity measure for testing convergence in smooth multi-objective optimization

Novel packet-level resource allocation with effective QoS provisioning for wireless mesh networks

A Karush-Kuhn-Tucker approach to field-weakening for Surface-Mounted Permanent Magnets Synchronous Motors.

Distributed Spectrum Management Algorithms for Multiuser DSL Networks

Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane

Similar Documents

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

The karush-kuhn-tucker optimality conditions in fuzzy optimization (2010).

On the karush-kuhn-tucker reformulation of the bilevel optimization problem (2010).

Enhanced karush-kuhn-tucker condition and weaker constraint qualifications.

Investigating EA solutions for approximate KKT conditions in smooth problems

KKT proximity measure for testing convergence in smooth multi-objective optimization

Novel packet-level resource allocation with effective QoS provisioning for wireless mesh networks

A Karush-Kuhn-Tucker approach to field-weakening for Surface-Mounted Permanent Magnets Synchronous Motors.

Distributed Spectrum Management Algorithms for Multiuser DSL Networks

Performance Evaluation and Optimization of Hierarchical Routing in SDN Control Plane