Related papers: Dynamic Flows with Time-Dependent Capacities
The paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ODEs based on mass conversation laws on directed graphs…
We develop a computing framework that leverages wave propagation within an interconnected network, where nodes and edges possess wave manipulation capabilities, such as frequency mixing or time delay. This computing paradigm can not only…
Joint scheduling and routing of data flows with deadline constraints in communication networks has been attracting research interest. This type of problem distinguishes from conventional multicommodity flows due to the presence of the time…
We consider issues associated with the Lagrangian characterisation of flow structures arising in aperiodically time-dependent vector fields that are only known on a finite time interval. A major motivation for the consideration of this…
We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formulated as open-loop optimal control problems for general…
Neural ordinary differential equations describe how values change in time. This is the reason why they gained importance in modeling sequential data, especially when the observations are made at irregular intervals. In this paper we propose…
Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate…
In this paper, we show that the spatio-temporal evolution of incompressible flows in a long circular pipe can be described by vorticity dynamics. The principal techniques to obtain solutions are similar to those used for flows in the whole…
We provide a long-time existence and sub-convergence result for the elastic flow of a three network in $\mathbb{R}^{n}$ under some mild topological assumptions. The evolution is such that the sum of the elastic energies of the three curves…
Robustness of distributed routing policies is studied for dynamical flow networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical flow network is modeled as a system of ordinary differential…
Under the action of a time-periodic external forces we prove the existence of at least one time-periodic weak solution for the interaction between a three-dimensional incompressible fluid, governed by the Navier- Stokes equation and a two…
For many power-limited networks, such as wireless sensor networks and mobile ad hoc networks, maximizing the network lifetime is the first concern in the related designing and maintaining activities. We study the network lifetime from the…
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…
Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. Existing literature commonly assumes that customer demand quantities are defined independently for each time…
Adaptive transport networks are known to contain loops when subject to hydrodynamic fluctuations. However, fluctuations are no guarantee that a loop will form, as shown by loop-free networks driven by oscillating flows. We provide a…
We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the net flow at every node and a concave utility function for…
Empirical estimation of critical points at which complex systems abruptly flip from one state to another is among the remaining challenges in network science. However, due to the stochastic nature of critical transitions it is widely…
In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e. Hence, if a flow f(e) enters the edge e and f(e) is less…
We are concerned with a model describing the motion of two compressible, immiscible fluids with density-dependent viscosity in the whole $\mathbb R^3$. The phases of the flow may have different pressure and viscosity laws and are separated…
The network of interactions among fluid elements and coherent structures gives rise to the incredibly rich dynamics of vortical flows. These interactions can be described with the use of mathematical tools from the emerging field of network…