Network monitoring: Probe-subset selection using the constrained coverage problem Conference Paper

To predict the delay between a source and destination as well as to identify anomalies in a network, it is crucial to continuously monitor the network by sending probes between all sources and destinations. It is of prime importance to reduce the number of probes drastically and yet be able to reasonably predict the delays and identify anomalies. In this paper we state and solve a graph-theoretic problem to optimally select a subset of traceroute-type probes to monitor networks.

Overview