(1. College of Information Science and Engineering, Hunan Univ,Changsha, Hunan410082, China; 2. School of Software, Hunan Univ, Changsha, Hunan410082, China) 在知网中查找 在百度中查找 在本站中查找
Affiliation:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
Abstract:
Under the constraint condition of vertex coverage, a probe station deployment method supporting multiple fault localization was proposed, which aims at minimizing the number of probe stations. This method is based on the traditional k -path algorithm, and uses an improved algorithm, which gets independent paths from weakly connected nodes, to select probe stations. Simulation experiments have shown that, compared with k -path algorithm, the method has fewer probe stations while keeping stronger fault localizing capability when used in multiple fault localization. So, the faults in networks can be localized sooner and cost-effectively by using this method to deploy probe stations and implement active probing.