3,450 research outputs found
Automation for network security configuration: state of the art and research trends
The size and complexity of modern computer networks are progressively increasing, as a consequence of novel architectural paradigms such as the Internet of Things and network virtualization. Consequently, a manual orchestration and configuration of network security functions is no more feasible, in an environment where cyber attacks can dramatically exploit breaches related to any minimum configuration error. A new frontier is then the introduction of automation in network security configuration, i.e., automatically designing the architecture of security services and the configurations of network security functions, such as firewalls, VPN gateways, etc. This opportunity has been enabled by modern computer networks technologies, such as virtualization. In view of these considerations, the motivations for the introduction of automation in network security configuration are first introduced, alongside with the key automation enablers. Then, the current state of the art in this context is surveyed, focusing on both the achieved improvements and the current limitations. Finally, possible future trends in the field are illustrated
A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming
In this paper we deal with a network of agents seeking to solve in a
distributed way Mixed-Integer Linear Programs (MILPs) with a coupling
constraint (modeling a limited shared resource) and local constraints. MILPs
are NP-hard problems and several challenges arise in a distributed framework,
so that looking for suboptimal solutions is of interest. To achieve this goal,
the presence of a linear coupling calls for tailored decomposition approaches.
We propose a fully distributed algorithm based on a primal decomposition
approach and a suitable tightening of the coupling constraints. Agents
repeatedly update local allocation vectors, which converge to an optimal
resource allocation of an approximate version of the original problem. Based on
such allocation vectors, agents are able to (locally) compute a mixed-integer
solution, which is guaranteed to be feasible after a sufficiently large time.
Asymptotic and finite-time suboptimality bounds are established for the
computed solution. Numerical simulations highlight the efficacy of the proposed
methodology.Comment: 57th IEEE Conference on Decision and Contro
- …