Single-path routing of stochastic flows in networks

The paper revisits a very simple network routing and dimensioning model, with two specific assumptions: the traffic amounts to be routed are Gaussian random variables, and each commodity must use one single route in the network. The need to control congestion leads naturally to probabilistic constraints. The impact of stochastic assumptions on solution algorithms is investigated, when compared to the usual deterministic case.