• Corpus ID: 245334714

Infrastructure adaptation and emergence of loops in network routing with time-dependent loads

@inproceedings{Lonardi2021InfrastructureAA,
  title={Infrastructure adaptation and emergence of loops in network routing with time-dependent loads},
  author={Alessandro Lonardi and Enrico Facca and Mario Putti and Caterina De Bacco},
  year={2021}
}
Network routing approaches are widely used to study the evolution in time of self-adapting systems. However, few advances have been made for problems where adaptation is governed by time-dependent inputs. In this work, we study a dynamical systems where the edge conductivities—capacities—of a network are regulated by time-varying mass loads injected on nodes. Motivated by empirical observations, we assume that conductivities adapt slowly with respect to the characteristic time of the loads… 
3 Citations

Figures from this paper

Multicommodity routing optimization for engineering networks
TLDR
This work considers different response functions—quantities determining the interaction between passengers—in the dynamics implementing the optimal transport formulation, and observes that optimal transport networks lie in the Pareto front drawn by the energy dissipated by passengers, and the cost to build the infrastructure.
Community Detection in networks by Dynamical Optimal Transport Formulation
Detecting communities in networks is important in various domains of applications. While a variety of methods exists to perform this task, recent efforts propose Optimal Transport (OT) principles
Immiscible Color Flows in Optimal Transport Networks for Image Classification
TLDR
This work proposes a physics-inspired dynamical system that adapts Optimal Transport principles to leverage color distributions of images and outperforms competitor algorithms on image classi-cation tasks in datasets where color information matters.

References

SHOWING 1-9 OF 9 REFERENCES
Convergence properties of optimal transport-based temporal networks
TLDR
The behavior of various network properties on a number of network sequences evolving towards optimal design are studied and it is found that the transport cost function converges earlier than network properties and that these monotonically decrease.
Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
TLDR
The scalable principled method developed is exact on trees but provides good approximate solutions on locally tree-like graphs and provides the tool for settling an open and much debated question on the merit of wavelength-switching nodes and the added capabilities they provide.
Interplay of river and tidal forcings promotes loops in coastal channel networks
Global coastlines and their dense populations have an uncertain future due to increased flooding, storms, and human modification. The distributary channel networks of deltas and marshes that plumb
Physarum Dynamics and Optimal Transport for Basis Pursuit
We study the connections between Physarum Dynamics and Dynamic Monge Kantorovich (DMK) Optimal Transport algorithms for the solution of Basis Pursuit problems. We show the equivalence between these
ESAIM: Control, Optimisation and Calculus of Variations
We consider differential inclusions where a positive semidefinite function of the solutions satisfies a class-KL estimate in terms of time and a second positive semidefinite function of the initial
Information Processing Letters
Physarum Multi-Commodity Flow Dynamics (Preprint 2009.01498) Infrastructure adaptation and emergence of loops in network routing .
  • 2021
Scalable node-disjoint and edge-disjoint multiwavelength routing (Preprint
  • 2021
Transport for London open data
  • 2021