Probe station selection algorithms for fault management in computer networks

  • Authors:
  • Deepak Jeswani;Nakul Korde;Dinesh Patil;Maitreya Natu;John Augustine

  • Affiliations:
  • Tata Research Development and Design Centre, Pune, India;Tata Research Development and Design Centre, Pune, India;Tata Research Development and Design Centre, Pune, India;Tata Research Development and Design Centre, Pune, India;School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

  • Venue:
  • COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we address the problem of probe station selection. Probe station nodes are the nodes that are instrumented with the functionality of sending probes and analyzing probe results. The placement of probe stations affects the diagnosis capability of the probes sent by the probe stations. The probe station placement also involves the overhead of instrumentation. Thus it is important to minimize the required number of probe stations without compromising on the required diagnosis capability of the probes. In this paper, we address the problem of selection of probe stations to detect failures in the network. We present an algorithm for probe station selection using a reduction of the probe station selection problem to the Minimum Hitting Set problem.We address several issues involved while selecting probe stations such as link failures and probe station failures. We present experimental evaluation to show the effectiveness of the proposed approach.