%0 Report
%T Evaluating Network Vulnerability with the Mincuts Frequency Vector
%+ Modeling Random Systems (MODEL)
%A Bulteau, Stéphane
%A Rubino, Gerardo
%N RR-3125
%I INRIA
%8 1997
%D 1997
%K COMMUNICATION NETWORKS
%K VULNERABILITY
%K RELIABILITY
%K NETWORK DESIGN
%Z Computer Science [cs]/Other [cs.OH]Reports
%X We consider the problem of evaluating the behavior of a communication network face to the possible disruption of some of its components. We) are interested in the case when there is no available statistical information about the dependability properties of the network components. Instead of working with reliability metrics in a stochastic context, we analyze vulnerability measures in a deterministic framework. This approach allows us to propose a solution to other classes of problems (not easily handled in reliability theory). For instance, we can consider the problem of evaluating the capacity of a network to resist to external attacks. We can also address the problem of quantifying the network ability to satisfy some capacity constraints in transporting information. In the paper, we propose a definition of vulnerability allowing the numerical evaluation of these aspects of a communication system. We show that it verifies some intuitively desirable properties, which is not the case of previously proposed means of vulnerability analysis. Last, we discuss the algorithmic issues related with the evaluation of the proposed metric.
%G English
%2 https://inria.hal.science/inria-00073564/document
%2 https://inria.hal.science/inria-00073564/file/RR-3125.pdf
%L inria-00073564
%U https://inria.hal.science/inria-00073564
%~ EC-PARIS
%~ UNIV-RENNES1
%~ CNRS
%~ INRIA
%~ INSA-RENNES
%~ INRIA-RENNES
%~ IRISA
%~ INRIA-RRRT
%~ IRISA_SET
%~ LORIA2
%~ TESTALAIN1
%~ INRIA2
%~ UR1-HAL
%~ LARA
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ INRIA-RENGRE
%~ INSA-GROUPE
%~ UR1-MATH-NUM