Related papers: Technical Notes on "A new approach to the d-MC pro…
Extreme edge computing (EEC) refers to the endmost part of edge computing wherein computational tasks and edge services are deployed only on extreme edge devices (EEDs). EEDs are consumer or user-owned devices that offer computational…
Chance-constrained optimization has emerged as a promising framework for managing uncertainties in power systems. This work advances its application to the DC Optimal Power Flow (DC-OPF) model, developing a novel approach to uncertainty…
In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…
Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study…
Electricity systems are experiencing increased effects of randomness and variability due to emerging stochastic assets. The increased effects introduce new uncertainties into power systems that can impact system operability and reliability.…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
How to provide information security while fulfilling ultra reliability and low-latency requirements is one of the major concerns for enabling the next generation of ultra-reliable and low-latency communications service (xURLLC), specially…
A network is represented as a graph consisting of nodes and edges. A cut set for a source-destination pair in a network is a set of elements that, when failed, cause the source-destination pair to lose connectivity. A Minimal Cut Set (MCS)…
Extreme Edge Computing (XEC) distributes streaming workloads across consumer-owned devices, exploiting their proximity to users and ubiquitous availability. Many such workloads are AI-driven, requiring continuous neural network inference…
Supply chain management has been concentrated on productive ways to manage flows through a sophisticated vendor, manufacturer, and consumer networks for decades. Recently, energy and material rates have been greatly consumed to improve the…
Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the…
We aim at characterizing viability, invariance and some reachability properties of controlled piecewise deterministic Markov processes (PDMPs). Using analytical methods from the theory of viscosity solutions, we establish criteria for…
We consider general, steady, balanced flows of a commodity over a network where an instance of the network flow is characterized by edge flows and nodal potentials. Edge flows in and out of a node are assumed to be conserved, thus…
We propose a generic system model for a special category of interdependent networks, demand-supply networks, in which the demand and the supply nodes are associated with heterogeneous loads and resources, respectively. Our model sheds a…
We study a class of dynamical multi-commodity flow networks in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a…
The ambition constrained validity and the model witness problems in the logic UCL, for reasoning about circuits with unreliable gates, are analyzed. Moreover, two additional problems, motivated by the applications, are studied. One consists…
Many complex systems demand manifold resources to be supplied from distinct channels to function properly, i.e, water, gas, and electricity for a city. Here, we study a model for viability of such systems demanding more than one type of…
We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol…
In this paper, we study end-to-end service reliability in Data Center Networks (DCN) with flow and Service Function Chains (SFCs) parallelism. In our approach, we consider large flows to i) be split into multiple parallel smaller sub-flows;…
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a…