Finding investigator tours in telecommunication networks using genetic algorithms
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Connected Vertex Covers in Dense Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
| Hi-index | 0.00 |
Presents several techniques for locating faults in a network which is modeled as an undirected graph. The novelty of these techniques lies in combining the process of collecting status information (from each network element) with the process of locating a fault, which is completely different from the existing techniques in which fault location begins after all the status information has been collected. The techniques presented in the paper have different characteristics and hence they are applicable in different networking environments. However, an intelligent combination of the techniques can be used in a large scale heterogeneous network in an efficient manner for locating faults.