Flexible distributed control plane deployment

Liu, Shaoteng; Steinert, Rebecca; Kostić, Dejan

doi:10.1109/noms.2018.8406150

Cited by 10 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Contributionsmentioning

confidence: 99%

“…With the above contributions, we significantly advance our initial approach [21] on solving the control plane deployment problem along with substantial improvements on the methods we use for implementation. We extend our black-box optimization process presented in [21] comprising flow routing under bandwidth constraints, by delay and backlog constraints using network calculus. We detail the design of two routability check algorithms, the refined estλ used for bandwidth verification (first introduced in [21]) and a novel algorithm based on CGH for latency verification.…”

Section: Contributionsmentioning

confidence: 99%

“…We extend our black-box optimization process presented in [21] comprising flow routing under bandwidth constraints, by delay and backlog constraints using network calculus. We detail the design of two routability check algorithms, the refined estλ used for bandwidth verification (first introduced in [21]) and a novel algorithm based on CGH for latency verification. We achieve significant reduction in running time with the devised algorithms.…”

Section: Contributionsmentioning

confidence: 99%

“…In addition, we report on the intuition, demonstrate theoretical proofs, and include evaluation results to show the achieved performance required for practical network operations. Further, we address a basic constraint that we overlooked in our initial approach [21], namely when a node hosts a controller instance and an aggregator, the instance must control the latter. Not respecting such a requirement can unnecessarily inject control traffic, consume energy, decrease reliability, etc.…”

Section: Contributionsmentioning

confidence: 99%

“…The resulting FPTAS algorithm runs much faster than FAS in solving the control traffic routability check problem as explained below and demonstrated in Appendix A. This algorithm was initially introduced in our previous work [21]. In the following, we report for the first time the details of the algorithm and its performance.…”

Section: E Routability Checkmentioning

confidence: 99%

See 4 more Smart Citations

Fast Deployment of Reliable Distributed Control Planes With Performance Guarantees

et al. 2020

Self Cite

View full text Add to dashboard Cite

Current trends strongly indicate a transition towards large-scale programmable networks with virtual network functions. In such a setting, deployment of distributed control planes will be vital for guaranteed service availability and performance. Moreover, deployment strategies need to be completed quickly in order to respond flexibly to varying network conditions. We propose an effective optimization approach that automatically decides on the needed number of controllers, their locations, control regions, and traffic routes into a plan which fulfills control flow reliability and routability requirements, including bandwidth and delay bounds. The approach is also fast: the algorithms for bandwidth and delay bounds can reduce the running time at the level of 50x and 500x, respectively, compared to state-of-the-art and direct solvers such as CPLEX. Altogether, our results indicate that computing a deployment plan adhering to predetermined performance requirements over network topologies of various sizes can be produced in seconds and minutes, rather than hours and days. Such fast allocation of resources that guarantees reliable connectivity and service quality is fundamental for elastic and efficient use of network resources. INDEX TERMS Software-defined networking, distributed control plane, controller placement problem, latency, reliability, routability, optimization. V K possible ways to map them on the network. For each mapping, there are K V possible ways of defining control regions.

show abstract

Section: Contributionsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

Section: E Routability Checkmentioning

confidence: 99%

See 3 more Smart Citations

Fast Deployment of Reliable Distributed Control Planes With Performance Guarantees

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

Controller placement problem during SDN deployment in the ISP/Telco networks: A survey

Sapkota,

Dawadi,

Joshi

2023

Engineering Reports

View full text Add to dashboard Cite

With the successful implementation of Software‐Defined Networking (SDN) in data center networking, the way forward for its deployment in the ISP/Telco network is becoming prominent. Small and medium‐sized networks may easily adopt SDN. The research on SDN deployment and implementation for a large‐scale network is continuing. This paper properly presents the current research status of Controller Placement Problem (CPP) and Multi‐CPP (MCPP) over SDN with their specific challenges and provides a comprehensive review of the major performance metrics, that is, latency, and controller load balancing techniques. This survey highlights the use of network partitioning‐based CPP and clustering approaches and their benefits in the context of SDN deployment. Moreover, this paper highlights the importance of implementing SDN and SDN security issues into ISP/Telco networks. Finally, we provide some key areas of ongoing research and discuss the future research direction regarding the various SDN‐based Controller Placement (CP) issues in the next‐generation IP and advanced networking technologies.

show abstract

A comprehensive study of different objectives and solutions of controller placement problem in software‐defined networks

Dhar

Debnath

Bhattacharyya

et al. 2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Software-defined network (SDN) is a programmable networking paradigm that enables logically centralized network management. In order to overcome the shortcomings of traditional networks, SDN has come into the picture. SDN is a recent and fast-forwarding technique that involves separating the network's control plane from the data plane. This network also allows us to directly communicate with the applications through application programming interfaces. A network administrator can directly modify and update the routing policies and rules in SDN. Apart from the advantages given by the SDN, it has also been found that separation of control plane directly affects the network performance.Finding the optimum number of controllers and their locations to improve the performance is one of the fundamental research problems in SDN which is also commonly known as the controller placement problem (CPP). In this article, we have addressed the CPP in SDN in detail and investigated the optimization objectives that influence CPP. The state-of-the-art of this article is to review almost all the optimization objective along with their mathematical formulation and survey the CPP solutions proposed by the other researchers'. Classified the CPP into three parts based on the objectives and solutions of CPP and reviewed the impact of these objectives on network performance. This article gives a comprehensive overview of current strategies on CPP in SDN and at last, we give some research issues that can be further explored by the researchers.

show abstract

Flexible distributed control plane deployment

Cited by 10 publications

References 31 publications

Fast Deployment of Reliable Distributed Control Planes With Performance Guarantees

Fast Deployment of Reliable Distributed Control Planes With Performance Guarantees

Controller placement problem during SDN deployment in the ISP/Telco networks: A survey

A comprehensive study of different objectives and solutions of controller placement problem in software‐defined networks

Contact Info

Product

Resources

About