Sea Turtle Foraging Optimization-Based Controller Placement with Blockchain-Assisted Intrusion Detection in Software-Defined Networks

Software-defined networking(SDN)algorithms are gaining increas-ing interest and are making networks flexible and agile.The basic idea of SDN is to move the control planes to more than one server’s named controllers and limit the data planes to numerous sending network components,enabling flexible and dynamic network management.A distinctive characteristic of SDN is that it can logically centralize the control plane by utilizing many physical controllers.The deployment of the controller—that is,the controller placement problem(CPP)—becomes a vital model challenge.Through the advancements of blockchain technology,data integrity between nodes can be enhanced with no requirement for a trusted third party.Using the lat-est developments in blockchain technology,this article designs a novel sea turtle foraging optimization algorithm for the controller placement problem(STFOA-CPP)with blockchain-based intrusion detection in an SDN environ-ment.The major intention of the STFOA-CPP technique is the maximization of lifetime,network connectivity,and load balancing with the minimization of latency.In addition,the STFOA-CPP technique is based on the sea turtles’food-searching characteristics of tracking the odour path of dimethyl sulphide(DMS)released from food sources.Moreover,the presented STFOA-CPP technique can adapt with the controller’s count mandated and the shift to controller mapping to variable network traffic.Finally,the blockchain can inspect the data integrity,determine significantly malicious input,and improve the robust nature of developing a trust relationship between sev-eral nodes in the SDN.To demonstrate the improved performance of the STFOA-CPP algorithm,a wide-ranging experimental analysis was carried out.The extensive comparison study highlighted the improved outcomes of the STFOA-CPP technique over other recent approaches.

On Reliability-optimized Controller Placement for Software-Defined Networks

By decoupling control plane and data plane,Software-Defined Networking(SDN) approach simplifies network management and speeds up network innovations.These benefits have led not only to prototypes,but also real SDN deployments.For wide-area SDN deployments,multiple controllers are often required,and the placement of these controllers becomes a particularly important task in the SDN context.This paper studies the problem of placing controllers in SDNs,so as to maximize the reliability of SDN control networks.We present a novel metric,called expected percentage of control path loss,to characterize the reliability of SDN control networks.We formulate the reliability-aware control placement problem,prove its NP-hardness,and examine several placement algorithms that can solve this problem.Through extensive simulations using real topologies,we show how the number of controllers and their placement influence the reliability of SDN control networks.Besides,we also found that,through strategic controller placement,the reliability of SDN control networks can be significantly improved without introducing unacceptable switch-to-controller latencies.

Automated Controller Placement for Software-Defined Networks to Resist DDoS Attacks

In software-defined networks(SDNs),controller placement is a critical factor in the design and planning for the future Internet of Things(IoT),telecommunication,and satellite communication systems.Existing research has concentrated largely on factors such as reliability,latency,controller capacity,propagation delay,and energy consumption.However,SDNs are vulnerable to distributed denial of service(DDoS)attacks that interfere with legitimate use of the network.The ever-increasing frequency of DDoS attacks has made it necessary to consider them in network design,especially in critical applications such as military,health care,and financial services networks requiring high availability.We propose a mathematical model for planning the deployment of SDN smart backup controllers(SBCs)to preserve service in the presence of DDoS attacks.Given a number of input parameters,our model has two distinct capabilities.First,it determines the optimal number of primary controllers to place at specific locations or nodes under normal operating conditions.Second,it recommends an optimal number of smart backup controllers for use with different levels of DDoS attacks.The goal of the model is to improve resistance to DDoS attacks while optimizing the overall cost based on the parameters.Our simulated results demonstrate that the model is useful in planning for SDN reliability in the presence of DDoS attacks while managing the overall cost.

Kernel Search-Framework for Dynamic Controller Placement in Software-Defined Network

In software-defined networking(SDN)networks,unlike traditional networks,the control plane is located separately in a device or program.One of the most critical problems in these networks is a controller placement problem,which has a significant impact on the network’s overall performance.This paper attempts to provide a solution to this problem aiming to reduce the operational cost of the network and improve their survivability and load balancing.The researchers have proposed a suitable framework called kernel search introducing integer programming formulations to address the controller placement problem.It demonstrates through careful computational studies that the formulations can design networks with much less installation cost while accepting a general connected topology among controllers and user-defined survivability parameters.The researchers used the proposed framework on six different topologies then analyzed and compared with Iterated Local Search(ILS)and Expansion model for the controller placement problem(EMCPP)along with considering several evaluation criteria.The results show that the proposed framework outperforms the ILS and EMCPP.Thus,the proposed framework has a 38.53%and 38.02%improvement in reducing network implementation costs than EMCPP and ILS,respectively.

Controller Placement in Software Defined Internet of Things Using Optimization Algorithm

The current and future status of the internet is represented by the upcoming Internet of Things(IoT).The internet can connect the huge amount of data,which contains lot of processing operations and efforts to transfer the pieces of information.The emerging IoT technology in which the smart ecosystem is enabled by the physical object fixed with software electronics,sensors and network connectivity.Nowadays,there are two trending technologies that take the platform i.e.,Software Defined Network(SDN)and IoT(SD-IoT).The main aim of the IoT network is to connect and organize different objects with the internet,which is managed with the control panel and data panel in the SD network.The main issue and the challenging factors in this network are the increase in the delay and latency problem between the controllers.It is more significant for wide area networks,because of the large packet propagation latency and the controller placement problem is more important in every network.In the proposed work,IoT is implementing with adaptive fuzzy controller placement using the enhanced sunflower optimization(ESFO)algorithm and Pareto Optimal Controller placement tool(POCO)for the placement problem of the controller.In order to prove the efficiency of the proposed system,it is compared with other existing methods like PASIN,hybrid SD and PSO in terms of load balance,reduced number of controllers and average latency and delay.With 2 controllers,the proposed method obtains 400 miles as average latency,which is 22.2%smaller than PSO,76.9%lesser than hybrid SD and 91.89%lesser than PASIN.

Using Heuristics to the Controller Placement Problem in Software-Defined Multihop Wireless Networking

Solving the controller placement problem (CPP) in an SDN architecture with multiple controllers has a significant impact on control overhead in the network, especially in multihop wireless networks (MWNs). The generated control overhead consists of controller-device and inter-controller communications to discover the network topology, exchange configurations, and set up and modify flow tables in the control plane. However, due to the high complexity of the proposed optimization model to the CPP, heuristic algorithms have been reported to find near-optimal solutions faster for large-scale wired networks. In this paper, the objective is to extend those existing heuristic algorithms to solve a proposed optimization model to the CPP in software-defined multihop wireless networking (SDMWN).Our results demonstrate that using ranking degrees assigned to the possible controller placements, including the average distance to other devices as a degree or the connectivity degree of each placement, the extended heuristic algorithms are able to achieve the optimal solution in small-scale networks in terms of the generated control overhead and the number of controllers selected in the network. As a result, using extended heuristic algorithms, the average number of hops among devices and their assigned controllers as well as among controllers will be reduced. Moreover, these algorithms are able tolower the control overhead in large-scale networks and select fewer controllers compared to an extended algorithm that solves the CPP in SDMWN based on a randomly selected controller placement approach.

A K self-adaptive SDN controller placement for wide area networks

As a novel architecture,software-defined networking(SDN) is viewed as the key technology of future networking.The core idea of SDN is to decouple the control plane and the data plane,enabling centralized,flexible,and programmable network control.Although local area networks like data center networks have benefited from SDN,it is still a problem to deploy SDN in wide area networks(WANs) or large-scale networks.Existing works show that multiple controllers are required in WANs with each covering one small SDN domain.However,the problems of SDN domain partition and controller placement should be further addressed.Therefore,we propose the spectral clustering based partition and placement algorithms,by which we can partition a large network into several small SDN domains efficiently and effectively.In our algorithms,the matrix perturbation theory and eigengap are used to discover the stability of SDN domains and decide the optimal number of SDN domains automatically.To evaluate our algorithms,we develop a new experimental framework with the Internet2 topology and other available WAN topologies.The results show the effectiveness of our algorithm for the SDN domain partition and controller placement problems.

Varna-based optimization:a novel method for capacitated controller placement problem in SDN

Recently,software defined networking(SDN)is a promising paradigm shift that decouples the control plane from the data plane.It can centrally monitor and control the network through softwarization,i.e.,controller.Multiple controllers are a necessity of current SDN based WAN.Placing multiple controllers in an optimum way is known as controller placement problem(CPP).Earlier,solutions of CPP only concentrated on propagation latency but overlooked the capacity of controllers and the dynamic load on switches,which is a significant factor in real networks.In this paper,we develop a novel optimization algorithm named varna-based optimization(VBO)and use it to solve CPP.To the best of our knowledge,this is the first attempt to minimize the total average latency of SDN along with the implementation of TLBO and Jaya algorithms to solve CPP for all twelve possible scenarios.Our experimental results show that TLBO outperforms PSO,and VBO outperforms TLBO and Jaya algorithms in all scenarios for all topologies.

The controller placement problem or the controller selection problem?

In SDN,the control logic of packet processing devices is moved onto the SDN centralized controller.This decoupled networking architecture creates some critical concerns when compared to traditional distributed architectures.One primary concern in this architecture is the placement of the controller,which is commonly known as the CPP.From our extensive literature review,we identify that there is no strict placement rule that best fits every network in SDN.Dynamic addition and deletion of controllers is inevitable.Motivated from this,in this paper,we attempt to transform the CPP into a CSP.We show that,in the dynamic SDN environment,researchers need to pay attention to CSP issues.The clear advantage of CSP over CPP is that,in the dynamic SDN ecosystem,we can answer fundamental questions about the control plane performance,i.e.,minimum number of controllers,their workload distribution,and placement/locations.Furthermore,we can meet strict,application-specific,QoS constraints.

POLE PLACEMENT CONTROLLERS FOR LINEAR TIME-DELAY SYSTEMS WITH COMMENSURATE POINT DELAYS

This paper investigates the exact and approximate spectrum assignment properties associated with realizable output-feedback pole-placement type controllers for single-input single-output linear time-invariant time-delay systems with commensurate point delays. The controller synthesis problem is discussed through the solvability of a set of coupled diophantine equations of polynomials. An extra complexity is incorporated to the above design to cancel extra unsuitable dynamics being generated when solving the above diophantine equations. Thus, the complete controller tracks any arbitrary prefixed (either finite or delay-dependent) closed-loop spectrum. However, if the controller is simplified by deleting the above mentioned extra complexity, then the robust stability and approximated spectrum assignment are still achievable for a certain sufficiently small amount of delayed dynamics. Finally, the approximate spectrum assignment and robust stability problems are revisited under plant disturbances if the nominal controller is maintained. In the current approach, the finite spectrum assignment is only considered as a particular case to the designer's choice of a (delay-dependent) arbitrary spectrum assignment objective.

Pole-placement self-tuning control of nonlinear Hammerstein system and its application to pH process control

By taking advantage of the separation characteristics of nonlinear gain and dynamic sector inside a Hammerstein model, a novel pole placement self tuning control scheme for nonlinear Hammerstein system was put forward based on the linear system pole placement self tuning control algorithm. And the nonlinear Hammerstein system pole placement self tuning control(NL-PP-STC) algorithm was presented in detail. The identi fication ability of its parameter estimation algorithm of NL-PP-STC was analyzed, which was always identi fiable in closed loop. Two particular problems including the selection of poles and the on-line estimation of model parameters, which may be met in applications of NL-PP-STC to real process control, were discussed. The control simulation of a strong nonlinear p H neutralization process was carried out and good control performance was achieved.

Software defined satellite networks:A survey

In recent years,satellite networks have been proposed as an essential part of next-generation mobile communication systems.Software defined networking techniques are introduced in satellite networks to handle the growing challenges induced by time-varying topology,intermittent inter-satellite link and dramatically increased satellite constellation size.This survey covers the latest progress of software defined satellite networks,including key techniques,existing solutions,challenges,opportunities,and simulation tools.To the best of our knowledge,this paper is the most comprehensive survey that covers the latest progress of software defined satellite networks.An open GitHub repository is further created where the latest papers on this topic will be tracked and updated periodically.Compared with these existing surveys,this survey contributes from three aspects:(1)an up-to-date SDN-oriented review for the latest progress of key techniques and solutions in software defined satellite networks;(2)an inspiring summary of existing challenges,new research opportunities and publicly available simulation tools for follow-up studies;(3)an effort of building a public repository to track new results.

Distributed Adaptive Output Consensus of Unknown Heterogeneous Non-Minimum Phase Multi-Agent Systems

This article addresses the leader-following output consensus problem of heterogeneous linear multi-agent systems with unknown agent parameters under directed graphs.The dynamics of followers are allowed to be non-minimum phase with unknown arbitrary individual relative degrees.This is contrary to many existing works on distributed adaptive control schemes where agent dynamics are required to be minimum phase and often of the same relative degree.A distributed adaptive pole placement control scheme is developed,which consists of a distributed observer and an adaptive pole placement control law.It is shown that under the proposed distributed adaptive control scheme,all signals in the closed-loop system are bounded and the outputs of all the followers track the output of the leader asymptotically.The effectiveness of the proposed scheme is demonstrated by one practical example and one numerical example.

VARIABLE STRUCTURE CONTROL APPLIED IN ELECTRO-HYDRAULIC SERVO SYSTEM WITH ANN

The variable structure control （VSC） theory is applied to the electro-hydraulic servo system here. The VSC control law is achieved using Lyapunov method and pole placement. To eliminate the chattering phenomena, a saturation function is adopted. The proposed VSC approach is fairly robust to load disturbance and system parameter variation. Since the distortion. including phase lag and amplitude attenuation occurs in the system sinusoid response, the amplitude and phase control （APC） algorithm, based on Adaline neural network and using LMS algorithm, is developed for distortion cancellation. The APC controller is simple and can on-line adjust, thus it gives accurate tracking.

U-model Enhanced Dynamic Control of a Heavy Oil Pyrolysis/Cracking Furnace

This paper proposes a case study in the control of a heavy oil pyrolysis/cracking furnace with a newly extended U-model based pole placement controller(U-PPC). The major work of the paper includes: 1) establishing a control oriented nonlinear dynamic model with Naphtha cracking and thermal dynamics; 2) analysing a U-model(i.e., control oriented prototype) representation of various popular process model sets; 3)designing the new U-PPC to enhance the control performance in pole placement and stabilisation; 4) taking computational bench tests to demonstrate the control system design and performance with a user-friendly step by step procedure.

Boiler Modelling and Optimal Control of Steam Temperature in Thermal Power Plants

Achieving accurate control of main steam temperature is a very difficult task in thermal power plants due to the large process lag （8 to 10 minutes） associated with the superheater system and there exists a deviation of ±10 ℃ in closed loop control. A control oriented boiler model and an appropriate optimal control strategy are the essential tools for improving the accuracy of this control system. This paper offers a comprehensive integrated 8th order mathematical model for the boiler and a Kalman Filter based state predictive controller for effectively controlling the main steam temperature within ± 2 ℃ and to enhance the efficiency of the boiler. It is proved through simulation that the predictive controller method with Kalman filter state estimator and predictor is the most appropriate one for the optimization of main steam temperature control as compared to other methods. This control system is under field implementation in a 210 MW boiler of a thermal power plant.

An efficient and coordinated mapping algorithm in virtualized SDN networks

Software-defined networking(SDN) enables the network virtualization through SDN hypervisors to share the underlying physical SDN network among multiple logically isolated virtual SDN networks(v SDNs),each with its own controller.The v SDN embedding,which refers to mapping a number of v SDNs to the same substrate SDN network,is a key problem in the SDN virtualization environment.However,due to the distinctions of the SDN,such as the logically centralized controller and different virtualization technologies,most of the existing embedding algorithms cannot be applied directly to SDN virtualization.In this paper,we consider controller placement and virtual network embedding as a joint vS DN embedding problem,and formulate it into an integer linear programming with objectives of minimizing the embedding cost and the controller-to-switch delay for each v SDN.Moreover,we propose a novel online vS DN embedding algorithm called CO-v SDNE,which consists of a node mapping stage and a link mapping stage.In the node mapping stage,CO-vS DNE maps the controller and the virtual nodes to the substrate nodes on the basis of the controller-to-switch delay and takes into account the subsequent link mapping at the same time.In the link mapping stage,CO-v SDNE adopts the k-shortest path algorithm to map the virtual links.The evaluation results with simulation and Mininet emulation show that the proposed CO-v SDNE not only significantly increases the long-term revenue to the cost ratio and acceptance ratio while guaranteeing low average and maximum controller-to-switch delay,but also achieves good v SDN performance in terms of end-to-end delay and throughput.