Related papers: Designing optimal transport networks
We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these net works. In general, the impact of additional random links on the performance of…
As cities struggle to adapt to more ``people-centered'' urbanism, transportation planning and engineering must innovate to expand the street network strategically in order to ensure efficiency but also to deter sprawl. Here, we conducted a…
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…
Efficient algorithms for solving optimal transport problems are important for measuring and optimizing distances between functions. In the $L^2$ semi-discrete context, this problem consists of finding a map from a continuous density…
This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…
This paper analyzes the survivability of a physical network against earthquakes and proposes spatial network design rules to make a network robust against earthquakes. The disaster area model used is fairly generic and bounded. The proposed…
The structure of pipe networks minimizing the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can be built with a given total pipe volume (or pipe lateral surface area), the network which…
We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal…
Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…
Internet traffic continues to grow relentlessly, driven largely by increasingly high resolution video content. Although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, they nonetheless…
We introduce an optimal transport topology on the space of probability measures over a fiber bundle, which penalizes the transport cost from one fiber to another. For simplicity, we illustrate our construction in the Euclidean case…
In several important routing contexts it is required to identify a set of routes, each of which optimizes a different criterion. For instance, in the context of vehicle routing, one route would minimize the total distance traveled, while…
Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme does not necessarily preserve the most fairness. In this paper, we establish a…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
We consider a network of nodes distributed in physical space without physical links communicating through message broadcasting over specified distances. Typically, communication using smaller distances is desirable due to savings in energy…
Semidiscrete optimal transport is a challenging generalization of the classical transportation problem in linear programming. The goal is to design a joint distribution for two random variables (one continuous, one discrete) with fixed…
We give a characterization of optimal transport plans for a variant of the usual quadratic transport cost introduced in [33]. Optimal plans are composition of a deterministic transport given by the gradient of a continuously differentiable…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
The evolution of complex transport networks is investigated under three strategies of link removal: random, intentional attack and "Pseudo-Darwinian" strategy. At each evolution step and regarding the selected strategy, one removes either a…
Given the efficiency and equity concerns of a cordon toll, this paper proposes a few alternative distance-dependent area-based pricing models for a large-scale dynamic traffic network. We use the Network Fundamental Diagram (NFD) to monitor…