Revive Our Hearts

Node selection for network-wide monitoring through node connectivity

The volume of traffic on a large network is often such that monitoring all traffic is not practical. In this paper we consider a selective monitoring approach that observes traffic from a small subset of nodes to keep the deployment and maintenance cost at a minimum. We consider node-based monitoring where a selected node observes all passing flows and assume that we have the freedom of choosing any node as a monitor. The flows may use any path between two nodes provided by the routing protocol. Assuming the network can have various failure scenarios, a chosen path between any two nodes should be a shortest path in terms of hop counts given the available links in the network. Our objective is to find a minimum set of monitor nodes such that all possible flows in the network can be observed under any single link or single node failure. The problem is shown to be NP-complete. We devise two heuristics for the problem and evaluate their performance on real and synthetic topologies.

Database: Elsevier - ScienceDirect (ساینس دایرکت)

Journal: Journal of Network and Computer Applications - Volume 36, Issue 2, March 2013, Pages 790–798

Alper Demir, Cevdet Aykanat, Buse Gökçen Gönen,