Related papers: Protection of flows under targeted attacks
We consider a new class of max flow network interdiction problems, where the defender is able to introduce new arcs to the network after the attacker has made their interdiction decisions. We prove properties of when this restructuring will…
We address the problem of Gaussian Process (GP) optimization in the presence of unknown and potentially varying adversarial perturbations. Unlike traditional robust optimization approaches that focus on maximizing performance under…
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
It has been known that heterogeneous networks are vulnerable to the intentional removal of a small fraction of highly connected or loaded nodes, which implies that, to protect a network effectively, a few important nodes should be allocated…
Recent optical flow methods are almost exclusively judged in terms of accuracy, while their robustness is often neglected. Although adversarial attacks offer a useful tool to perform such an analysis, current attacks on optical flow methods…
Recently, bandit optimization has received significant attention in real-world safety-critical systems that involve repeated interactions with humans. While there exist various algorithms with performance guarantees in the literature,…
Data flow analysis and optimization is considered for homogeneous rectangular mesh networks. We propose a flow matrix equation which allows a closed-form characterization of the nature of the minimal time solution, speedup and a simple…
We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algorithm in the setting of optical networks, but it should be…
While various aspects of edge computing (EC) have been studied extensively, the current literature has overlooked the robust edge network operations and planning problem. To this end, this letter proposes a novel fairness-aware…
Modeling traffic distribution and extracting optimal flows in multilayer networks is of utmost importance to design efficient multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and…
Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…
We quantify the threat of network adversaries to inducing \emph{network overload} through \emph{routing attacks}, where a subset of network nodes are hijacked by an adversary. We develop routing attacks on the hijacked nodes for two…
As we seek to deploy machine learning models beyond virtual and controlled domains, it is critical to analyze not only the accuracy or the fact that it works most of the time, but if such a model is truly robust and reliable. This paper…
The solid-on-solid model provides a commonly used framework for the description of surfaces. In the last years it has been extended in order to investigate the effect of defects in the bulk on the roughness of the surface. The determination…
Existing techniques for the cost optimization of water distribution networks either employ meta-heuristics, or try to develop problem-specific optimization techniques. Instead, we exploit recent advances in generic NLP solvers and explore a…
There is a growing need for new optimization methods to facilitate the reliable and cost-effective operation of power systems with intermittent renewable energy resources. In this paper, we formulate the robust AC optimal power flow…
This paper deals with robust optimization applied to network flows. Two robust variants of the minimum-cost integer flow problem are considered. Thereby, uncertainty in problem formulation is limited to arc unit costs and expressed by a…
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound…
This work proposes a novel method for scaling multi-timestep security-constrained optimal power flow in large power grids. The challenge arises from dealing with millions of variables and constraints, including binary variables and…
Electrical power systems are one of the most important infrastructures that support our society. However, their vulnerabilities have raised great concern recently due to several large-scale blackouts around the world. In this paper, we…