Bounds on expected performance of networks with links subject to failure
- 1 September 1984
- Vol. 14 (3) , 439-456
- https://doi.org/10.1002/net.3230140307
Abstract
Upper and lower bounds on the expected maximum flows and benefits in capacitated networks with links subject to random failure are presented. Such bounds are of interest both because of the high or prohibitive cost of computing the exact expected values, and because the exact values will depend on the extent to which management avails itself of the opportunities for rerouting of flows in response to link failures. Algorithms for computing these bounds are discussed. These algorithms are sufficiently efficient to be applied to large networks having numerous possible failure states. An application to water‐network seismic risk analysis is described.Keywords
This publication has 5 references indexed in Scilit:
- Maximal expected flow in a network subject to arc failuresNetworks, 1980
- The Concept of Economic Surplus and Its Use in Economic AnalysisThe Economic Journal, 1971
- Bounds on the average terminal capacity of probabilistic nets (Corresp.)IEEE Transactions on Information Theory, 1968
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958