Probe Station Placement for Robust Monitoring of Networks

Abstract

We address the problem of selecting probe station locations from where probes can be sent to monitor all the nodes in the network. Probe station placement involves instrumentation overhead. Hence, the number of probe stations should be minimal to reduce the deployment cost. Also, probe station placement should be such that the network can be monitored even in the presence of failures. We present algorithms to select locations of probe stations so that the entire network can be monitored for computing various performance metrics. We aim to find a minimal set of probe station nodes so as to minimize the instrumentation overhead. The algorithm presented provides robust monitoring in presence of node failures. We then present algorithms to make the solution resilient to probe station failures, and to deal with weakly connected nodes. We provide an experimental evaluation of the proposed algorithms through simulation results.

Probe station placement algorithm for probe set reduction in network fault localization

“…These algorithms play a vital role in the development of optimal solution for fault detection ad localization in networks. Many researchers work on the problem of efficient probe station placement M. Natu and A.S. Sethi [11] proposed the SNR algorithm; the algorithms in this paper ensure the k independent probe paths but do not aim to optimize probe traffic or the localization time. Deepak Jaswani, et al [17] Proposed Minimum Hitting Set algorithm and Yongin Liu, Yan Wang and Fangping Li [14] presented the Greedy Approximation algorithm.…”

“…Probe Station Selection: find the set Q ⊆ V of least cardinality such that every node u ∈ {V -Q} has k independent paths from the nodes in Q [11].…”

Efficient probe selection algorithms for fault diagnosis

“…We build a deterministic dependency model to represent the dependencies between the nodes and probes. For each probe selection experiment, we first ran a probe station selection algorithm (Algorithm SNR) [23]. This identified a set of nodes as probe stations from where probes can be sent to monitor the network.…”

Flow Monitoring in Wireless MESH Networks

“…Section 6 provides the evaluation of the proposed monitoring system, and the conclusions end the paper in section 7. [10,12] and [5] all present active approaches towards monitoring the state of the network. In [10], K. Kim introduces a scheme for accurate measurement of link quality in a wireless mesh network.…”

“…The proposed architecture, EAR (Efficient and Accurate link-quality monitoR) uses distributed and periodic measurement of unicast-based unidirectional data probes by dynamically choosing one of three schemes: passive, cooperative and active to measure link quality. In [12], a greedy solution to probe station placement in a network is provided, to detect all node failures in the network. At each step of the algorithm, a node is added to the probe station set such that the set of shadow nodes (the set of the nodes in the networks that can not be reached by k independent paths from the probe stations, where k is the maximum number of node failures) is minimized.…”