Optimizing network microsegmentation policy for cyber resilience

2021 ◽  
pp. 154851292110513
Author(s):  
Steven Noel ◽  
Vipin Swarup ◽  
Karin Johnsgard
Keyword(s):  
Objective Function ◽  
Optimal Solution ◽  
Evolutionary Programming ◽  
Security Architecture ◽  
Network Resources ◽  
Policy Rules ◽  
Fine Grained ◽  
Attack Scenario ◽  
Destination Port ◽  
Destination Address

This paper describes an approach for improving cyber resilience through the synthesis of optimal microsegmentation policy for a network. By leveraging microsegmentation security architecture, we can reason about fine-grained policy rules that enforce access for given combinations of source address, destination address, destination port, and protocol. Our approach determines microsegmentation policy rules that limit adversarial movement within a network according to assumed attack scenarios and mission availability needs. For this problem, we formulate a novel optimization objective function that balances cyberattack risks against accessibility to critical network resources. Given the application of a particular set of policy rules as a candidate optimal solution, this objective function estimates the adversary effort for carrying out a particular attack scenario, which it balances against the extent to which the solution restricts access to mission-critical services. We then apply artificial intelligence techniques (evolutionary programming) to learn microsegmentation policy rules that optimize this objective function.

scholarly journals An evolutionary-based optimization algorithm for truss sizing design

2016 ◽  
Vol 38 (4) ◽  
pp. 307-317
Author(s):  
Pham Hoang Anh
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
The Other ◽  
Truss Structures ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Objective Functions

In this paper, the optimal sizing of truss structures is solved using a novel evolutionary-based optimization algorithm. The efficiency of the proposed method lies in the combination of global search and local search, in which the global move is applied for a set of random solutions whereas the local move is performed on the other solutions in the search population. Three truss sizing benchmark problems with discrete variables are used to examine the performance of the proposed algorithm. Objective functions of the optimization problems are minimum weights of the whole truss structures and constraints are stress in members and displacement at nodes. Here, the constraints and objective function are treated separately so that both function and constraint evaluations can be saved. The results show that the new algorithm can find optimal solution effectively and it is competitive with some recent metaheuristic algorithms in terms of number of structural analyses required.

Design and robustness analysis of fuzzy PID controller for automatic voltage regulator system using genetic algorithm

2022 ◽  
pp. 014233122110667
Author(s):  
Tufan Dogruer ◽  
Mehmet Serhat Can
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Pid Controller ◽  
Robustness Analysis ◽  
Optimal Solution ◽  
Voltage Regulator ◽  
Fuzzy Pid ◽  
Multi Objective ◽  
Fuzzy Pid Controller ◽  
Automatic Voltage Regulator

In this paper, a Fuzzy proportional–integral–derivative (Fuzzy PID) controller design is presented to improve the automatic voltage regulator (AVR) transient characteristics and increase the robustness of the AVR. Fuzzy PID controller parameters are determined by a genetic algorithm (GA)-based optimization method using a novel multi-objective function. The multi-objective function, which is important for tuning the controller parameters, obtains the optimal solution using the Integrated Time multiplied Absolute Error (ITAE) criterion and the peak value of the output response. The proposed method is tested on two AVR models with different parameters and compared with studies in the literature. It is observed that the proposed method improves the AVR transient response properties and is also robust to parameter changes.

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives

2021 ◽  
Author(s):  
Jungho Park ◽  
Hadi El-Amine ◽  
Nevin Mutlu
Keyword(s):  
Resource Allocation ◽  
Objective Function ◽  
Large Scale ◽  
Computational Study ◽  
Optimal Solution ◽  
Exact Algorithm ◽  
Minimax Regret ◽  
Optimal Solutions ◽  
Heuristic Approaches ◽  
Exact Approach

We study a large-scale resource allocation problem with a convex, separable, not necessarily differentiable objective function that includes uncertain parameters falling under an interval uncertainty set, considering a set of deterministic constraints. We devise an exact algorithm to solve the minimax regret formulation of this problem, which is NP-hard, and we show that the proposed Benders-type decomposition algorithm converges to an [Formula: see text]-optimal solution in finite time. We evaluate the performance of the proposed algorithm via an extensive computational study, and our results show that the proposed algorithm provides efficient solutions to large-scale problems, especially when the objective function is differentiable. Although the computation time takes longer for problems with nondifferentiable objective functions as expected, we show that good quality, near-optimal solutions can be achieved in shorter runtimes by using our exact approach. We also develop two heuristic approaches, which are partially based on our exact algorithm, and show that the merit of the proposed exact approach lies in both providing an [Formula: see text]-optimal solution and providing good quality near-optimal solutions by laying the foundation for efficient heuristic approaches.

Solving Solid Transportation Problems With Multi-Choice Cost and Stochastic Supply and Demand

2018 ◽  
pp. 137-170 ◽  
Author(s):  
Sankar Kumar Roy ◽  
Deshabrata Roy Mahapatra
Keyword(s):  
Stochastic Programming ◽  
Objective Function ◽  
Transportation Problem ◽  
Supply And Demand ◽  
Optimal Solution ◽  
Programming Approach ◽  
Solid Transportation Problem ◽  
New Approach ◽  
Non Linear Programming ◽  
The Cost

In this chapter, the authors propose a new approach to analyze the Solid Transportation Problem (STP). This new approach considers the multi-choice programming into the cost coefficients of objective function and stochastic programming, which is incorporated in three constraints, namely sources, destinations, and capacities constraints, followed by Cauchy's distribution for solid transportation problem. The multi-choice programming and stochastic programming are combined into a solid transportation problem, and this new problem is called Multi-Choice Stochastic Solid Transportation Problem (MCSSTP). The solution concepts behind the MCSSTP are based on a new transformation technique that will select an appropriate choice from a set of multi-choice, which optimize the objective function. The stochastic constraints of STP converts into deterministic constraints by stochastic programming approach. Finally, the authors construct a non-linear programming problem for MCSSTP, and by solving it, they derive an optimal solution of the specified problem. A realistic example on STP is considered to illustrate the methodology.

scholarly journals Online Clique Clustering

Algorithmica ◽  
2019 ◽  
Vol 82 (4) ◽  
pp. 938-965
Author(s):  
Marek Chrobak ◽  
Christoph Dürr ◽  
Aleksander Fabijan ◽  
Bengt J. Nilsson
Keyword(s):  
Objective Function ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Optimal Solution ◽  
Deterministic Algorithm ◽  
Input Graph ◽  
Online Clustering ◽  
Objective Value ◽  
Asymptotic Competitive Ratio ◽  
Better Than

Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of edges in the clusters, we propose an online algorithm based on the doubling technique. It has an asymptotic competitive ratio at most 15.646 and a strict competitive ratio at most 22.641. We also show that no deterministic algorithm can have an asymptotic competitive ratio better than 6. For the variant where we want to minimize the number of edges between clusters, we show that the deterministic competitive ratio of the problem is $$n-\omega (1)$$n-ω(1), where n is the number of vertices in the graph.

scholarly journals Optimal Solution of Vehicle Routing Problems with Fractional Objective Function

2020 ◽  
Author(s):  
Roberto Baldacci ◽  
Andrew Lim ◽  
Emiliano Traversi ◽  
Roberto Wolfler Calvo
Keyword(s):  
Objective Function ◽  
Vehicle Routing ◽  
Optimal Solution ◽  
Vehicle Routing Problems ◽  
Routing Problems

A mutual approach for profit-based unit commitment in deregulated power system integrated with renewable energy sources

2020 ◽  
pp. 014233122096631
Author(s):  
T Anbazhagi ◽  
K Asokan ◽  
R AshokKumar
Keyword(s):  
Power System ◽  
Objective Function ◽  
Wind Power ◽  
Unit Commitment ◽  
Renewable Energy Sources ◽  
Optimal Solution ◽  
Lévy Flight ◽  
Levy Flight ◽  
Mutual Approach ◽  
Deregulated Power System

This paper proposes a mutual technique for solving the profit-based unit commitment (PBUC) problem in deregulated power system integrated with wind power. The proposed mutual approach is the joined execution of different solution techniques and known by the non-dominated sorting of moth fly optimization (MFO) with levy flight search (NSMFLF) technique. In the proposed approach, the levy flight search and the traditional moth flame optimization looking conduct is prepared in parallel as for the objective function and update the conceivable combination of generation units. The objective function maximizes the profit of the generating companies as for the revenue and total fuel cost in light of the gauge estimations of power demand, price and reserve power. Here, the uncertainty events of the wind power are predicted by utilizing the artificial intelligence techniques. Thus, the system is ensured with the high utilization of wind power. Finally, the non-dominated sorting is performed to choose the optimal solution from the conceivable generated combinations. The optimal combination used to maximize the profit of the generating companies and solve the PBUC problem in light of the objective function. The proposed method is implemented in the matrix laboratory working stage and the outcomes are analyzed with the current strategies.

scholarly journals Accelerate stochastic subgradient method by leveraging local growth condition

2019 ◽  
Vol 17 (05) ◽  
pp. 773-818 ◽  
Author(s):  
Yi Xu ◽  
Qihang Lin ◽  
Tianbao Yang
Keyword(s):  
Growth Rate ◽  
Global Convergence ◽  
Objective Function ◽  
Optimal Solution ◽  
Subgradient Method ◽  
Local Region ◽  
Subgradient Methods ◽  
Local Growth ◽  
Smoothness Assumption ◽  
First Order

In this paper, a new theory is developed for first-order stochastic convex optimization, showing that the global convergence rate is sufficiently quantified by a local growth rate of the objective function in a neighborhood of the optimal solutions. In particular, if the objective function [Formula: see text] in the [Formula: see text]-sublevel set grows as fast as [Formula: see text], where [Formula: see text] represents the closest optimal solution to [Formula: see text] and [Formula: see text] quantifies the local growth rate, the iteration complexity of first-order stochastic optimization for achieving an [Formula: see text]-optimal solution can be [Formula: see text], which is optimal at most up to a logarithmic factor. To achieve the faster global convergence, we develop two different accelerated stochastic subgradient methods by iteratively solving the original problem approximately in a local region around a historical solution with the size of the local region gradually decreasing as the solution approaches the optimal set. Besides the theoretical improvements, this work also includes new contributions toward making the proposed algorithms practical: (i) we present practical variants of accelerated stochastic subgradient methods that can run without the knowledge of multiplicative growth constant and even the growth rate [Formula: see text]; (ii) we consider a broad family of problems in machine learning to demonstrate that the proposed algorithms enjoy faster convergence than traditional stochastic subgradient method. We also characterize the complexity of the proposed algorithms for ensuring the gradient is small without the smoothness assumption.

Sign in / Sign up

Export Citation Format

Share Document