DocumentCode
1855621
Title
Probe station selection algorithms for fault management in computer networks
Author
Jeswani, Deepak ; Korde, Nakul ; Patil, Dinesh ; Natu, Maitreya ; Augustine, John
Author_Institution
Tata Res. Dev. & Design Centre, Pune, India
fYear
2010
fDate
5-9 Jan. 2010
Firstpage
1
Lastpage
9
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.
Keywords
computer network management; failure analysis; fault diagnosis; set theory; computer networks; diagnosis capability; failure detection; fault management; instrumentation overhead; link failures; minimum hitting set problem; probe station placement; probe station selection algorithms; Algorithm design and analysis; Availability; Computer network management; Condition monitoring; Fault detection; Instruments; Probes; Research and development management; Routing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Systems and Networks (COMSNETS), 2010 Second International Conference on
Conference_Location
Bangalore
Print_ISBN
978-1-4244-5487-7
Type
conf
DOI
10.1109/COMSNETS.2010.5431990
Filename
5431990
Link To Document