Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yunhang Pu

dblp:394/2978 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0001-9632-8101ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network management and operations · 100%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › fault management
fault diagnosis
0.812024
XNV: Explainable Network Verification · IEEE/ACM Trans. Netw. 2024
Network management and operations
network verification
0.812024
XNV: Explainable Network Verification · IEEE/ACM Trans. Netw. 2024
Network management and operations › fault management › fault diagnosis
root cause analysis
0.812024
XNV: Explainable Network Verification · IEEE/ACM Trans. Netw. 2024
Knowledge graphs
knowledge graph querying
0.212024
XNV: Explainable Network Verification · IEEE/ACM Trans. Netw. 2024

Methods — techniques the papers use, named apart from their topics

minimum cut set matching · 1.5knowledge graph · 1.5fault tree analysis · 1.5
YearPublicationVenuePosition
2024 XNV: Explainable Network Verification
abstract
Network verification has recently made strides, focusing on the satisfiability of configurations and policies or the performance and versatility of their methods. However, they generally ignore explainability, which is the ability to explain why a network violates or satisfies a certain forwarding policy. In this paper, we propose an explainable network verification framework XNV, which uses a novel interpretable fault analysis method to construct an effective explainable network verifier using knowledge graph (KG). XNV provides appropriate explanations to help operators understand the verification results, improving the transparency and trustworthiness of the verification system. First, XNV uses the KG as an intermediate representation of the configuration semantic level, storing the configuration semantics and routing protocol states. Then, XNV constructs human-logical fault trees for policies and implements root-cause analysis of policy violations based on KG queries and minimum cut set matching. Experiments and case evaluations show that our system provides good interpretability while balancing performance, accelerated understanding, and handling of misconfigurations.
Fuliang Li, Minglong Li, Yunhang Pu, Xingwei Wang 0001, Jiannong Cao 0001
IEEE/ACM Trans. Netw.3