Minimizing the number of detectors in poll-based link failure detection and identification

Link failure is one of the most critical network fault conditions. Relying solely on SNMP traps to detect and identify link failures is not a complete solution. To supplement the SNMP-trap mechanism, one or more detectors can be placed in the network to periodically poll the devices using the ping or traceroute utilities such that all links are under the surveillance of the detectors. The goal is to place the smallest number of detectors to have all of the links under surveillance such that the cost of placing detectors in the network is reduced. In this paper, this problem is formulated as a minimum set covering problem. A new heuristic algorithm is proposed for this problem. Simulations are performed to study the performance of the proposed heuristic algorithm.