NETWORK FAILURE DETECTION AND GRAPH CONNECTIVITY.

We consider a model for monitoring the connectivity of a network subject to node or edge failures. In particular, we are concerned with detecting (ϵ, k)-failures: events in which an adversary deletes up to k network elements (nodes or edges), after which there are two sets of nodes A and B, each at least an ϵ fraction of the network, that are disconnected from one another. We say that a set D of nodes is an (ϵ, k)-detection set if, for any (ϵ, k)-failure of the network, some two nodes in D are no longer able to communicate; in this way, D "witnesses" any such failure. Recent results show that for any graph G, there is an (ϵ, k)-detection set of size bounded by a polynomial in k and ϵ, independent of the size of G. In this paper, we expose some relationships between bounds on detection sets and the edge-connectivity λ and node-connectivity K of the underlying graph. Specifically, we show that detection set bounds can be made considerably stronger when parameterized by these connectivity values. We show that for an adversary that can delete kλ edges, there is always a detection set of size O( k/ϵ log 1/ϵ) which can be found by random sampling. Moreover, an (ϵ, λ)-detection set of minimum size (which is at most 1/ϵ ) can be computed in polynomial time. A crucial point is that these bounds are independent not just of the size of G but also of the value of λ. Extending these bounds to node failures is much more challenging. The most technically difficult result of this paper is that a random sample of O( 1/ϵ log 1/ϵ) nodes is a detection set for adversaries that can delete a number of nodes up to λ, the node-connectivity. For the case of edge-failures we use VC-dimension techniques and the cactus representation of all minimum edge-cuts of a graph; for node failures, we develop a novel approach for working with the much more complex set of all minimum node-cuts of a graph. [ABSTRACT FROM AUTHOR]