摘要：AbstractIn this paper the importance of network components is analyzed by combining sensitivity techniques and several network performance functions, like the shortest-route problem or the maximum-flow problem. The uncertainty of each network component is modeled by a known probabilistic distribution. Hence the network performance is considered as a non-deterministic variable and in turn, the sensitivity analysis allows ranking the importance of each element. An example related to different importance measures in a network illustrates the approach.
