20 May 2022 in International Journal of Fuzzy Systems
26 October 2022 in Security and Communication Networks
The exact computation of network k-terminal reliability is an NP-hard problem, and many approximation methods have been proposed as alternatives, among which the neural network-based approaches are believed to be the most effective and promising. However, the existing neural network-based methods either ignore the local structures in the network topology or process the local structures as Euclidean data, while the network topology represented by the graph is in fact non-Euclidean. Seeing that the Graph Convolution Neural network (GCN) is a generalization of convolution operators onto non-Euclidean data structure, in an effort to fill in the gap, this paper proposes a GCN-based framework for the estimation of communication network reliability. First, a dataset with sufficient sample size is constructed, by calculating the k-terminal reliability via the exact contraction-deletion method for the generated network samples. Then, an estimation model based on GCN is built, where several graph convolution layers process input information and extract node-level structural features from the network topology, a concatenation layer fuses the structural features into a graph-level representation feature, and a multi-layer perceptron computes the k-terminal reliability as output. To demonstrate the practicality and rationality of our proposed model, comparative experiments are carried out on 12 datasets, the results of which show that our proposed GCN model has an average of 59.60 and 57.52 improvement over existing methods on homogeneous datasets and heterogeneous datasets, respectively.
30 June 2026 in Proceedings of the ACM on Software Engineering
In large-scale microservice systems, multi-root-cause failures often intertwine, significantly increasing overall system risk and triggering a deluge of cascading alerts that pose serious challenges to fault diagnosis and recovery. Existing root-cause localization techniques remain largely passive, relying on rule-based pattern recognition or graph-based propagation inference, and thus falter when faced with the complexity of multi–root-cause failures. To address these challenges, this paper introduces a novel active-intervention-based framework for root-cause localization. This framework uses Hierarchical Reinforcement Learning (HRL) to infer root causes and employs an Intervention-enhanced Graph ATtention network (IGAT) to predict the fault scenarios each cause may trigger. By iteratively comparing these predicted scenarios against the system’s real-time state, the framework dynamically refines its localization model. Experimental results on two public datasets and a constructed dataset show that our method outperforms the second-best method by at least 22% on the PR@1 metric in single root cause scenarios and leads by 51.7% on the RE@3 metric in multiple root cause scenarios. These results indicate that the method may offer certain advantages in the field of fault root cause analysis.