A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Branching in flow networks with linear congestion
2022
Physical Review Research
In our modern world, we rely on the proper functioning of a variety of networks with complex dynamics. Many of them are prone to congestion due to high loads, which determines their operation and resilience to failures. In this article, we propose a fundamental model of congestion where travel times increase linearly with the load. We show that this model interpolates between shortest path and Ohmic flow dynamics, which both have a broad range of applications. We formulate the model as a
doi:10.1103/physrevresearch.4.043208
fatcat:h7dtzbbrr5g65dm6uodwrlw64i