Yahui Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yahui Li has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Han Zhang
Tsinghua University, Beijing, Beijing, China and Zhongguancun Laboratory, Beijing, Beijing, China
15 shared publications - Xingang Shi
Tsinghua University, Beijing, Beijing, China and Zhongguancun Laboratory, Beijing, Beijing, China
12 shared publications - Xia Yin
Tsinghua University, Beijing, Beijing, China and Zhongguancun Laboratory, Beijing, Beijing, China
11 shared publications - Jilong Wang
Tsinghua University, Beijing, China
9 shared publications - Zhiliang Wang
Tsinghua University, Beijing, China
8 shared publications - Tianyu Zhang
Tsinghua University, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2148-2162
Parade: Unified and Data-Driven Prefix-AS Semantics for BGP Anomaly Detection
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2148-2162
Open AccessParade: Unified and Data-Driven Prefix-AS Semantics for BGP Anomaly Detection
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1282-1298
Towards High-Performance Intrusion Detection with Robustness Guarantees on Programmable Switches at ISP Scale
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1282-1298
Open AccessTowards High-Performance Intrusion Detection with Robustness Guarantees on Programmable Switches at ISP Scale
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5588-5600
Efficient Slice-Parallel Distributed Probing in SRv6 Networks
Segment Routing over IPv6 (SRv6) is widely deployed, where operators construct numerous parallel SR-based network slices. An accurate diagnosis of latency bottlenecks in SRv6 tunnels is essential to maintain service-level objectives. However, building a distributed, at-scale probing system is non-trivial: SRv6 priority policies, SR-aware multipath forwarding, and slice isolation collectively invalidate assumptions made by existing diagnostic methods. In this paper, we present SRmesh, a distributed system for diagnosing latency bottleneck links in SRv6 networks. First, we adopt distributed SR-based probing agents to control routing paths and ensure that probe packets emulate per-slice production traffic. Second, we employ a latency-based multipath inference that runs in parallel across slices to resolve SR-induced routing ambiguities. Third, we introduce a sliceparallel progressive diagnosis that incrementally reuses probe results to reduce redundant measurements, optimizing diagnostic overhead for large-scale SRv6 overlay networks. We implement a prototype of SRmesh and conduct extensive evaluations on 247 real network topologies. The results indicate that SRmesh achieves high diagnostic accuracy with a 93.4% reduction in probe overhead, demonstrating its practicality and scalability in large-scale SRv6 environments.
- 21 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5588-5600
Efficient Slice-Parallel Distributed Probing in SRv6 Networks
Segment Routing over IPv6 (SRv6) is widely deployed, where operators construct numerous parallel SR-based network slices. An accurate diagnosis of latency bottlenecks in SRv6 tunnels is essential to maintain service-level objectives. However, building a distributed, at-scale probing system is non-trivial: SRv6 priority policies, SR-aware multipath forwarding, and slice isolation collectively invalidate assumptions made by existing diagnostic methods. In this paper, we present SRmesh, a distributed system for diagnosing latency bottleneck links in SRv6 networks. First, we adopt distributed SR-based probing agents to control routing paths and ensure that probe packets emulate per-slice production traffic. Second, we employ a latency-based multipath inference that runs in parallel across slices to resolve SR-induced routing ambiguities. Third, we introduce a sliceparallel progressive diagnosis that incrementally reuses probe results to reduce redundant measurements, optimizing diagnostic overhead for large-scale SRv6 overlay networks. We implement a prototype of SRmesh and conduct extensive evaluations on 247 real network topologies. The results indicate that SRmesh achieves high diagnostic accuracy with a 93.4% reduction in probe overhead, demonstrating its practicality and scalability in large-scale SRv6 environments.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7576-7587
GlassMiner: Mining Looking Glass Services via Structure-Semantics Fusion for Web Observability
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7576-7587
Open AccessGlassMiner: Mining Looking Glass Services via Structure-Semantics Fusion for Web Observability
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1661-1673
FlowScope: Non-Intrusive Distributed Tracing with Method-Level Delay Estimation for Microservices Troubleshooting
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1661-1673
Open AccessFlowScope: Non-Intrusive Distributed Tracing with Method-Level Delay Estimation for Microservices Troubleshooting
- Open Access
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 46-48
Poster: Quantifying the Cross-Layer Reliance of DNS on the Submarine Cable Network
- 30 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 46-48
Open AccessPoster: Quantifying the Cross-Layer Reliance of DNS on the Submarine Cable Network
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-25
Scalable and Interpretable Overlay Network Checking via Ensemble Verification
Overlay/underlay architecture is increasingly prevalent in modern networks but also introduces greater complexity and error-proneness. Existing control plane verifiers for underlay networks face scalability and interpretability challenges when extended to overlay/underlay networks due to methodological limitations. This paper presents MEV, the first control plane verifier designed for overlay/underlay networks. MEV introduces ensemble verification, a novel verification paradigm enabling independent reasoning for behaviors within each routing instance or protocol and forwarding behaviors within each virtual network. We implement and deploy MEV on a real nationwide overlay/underlay network, FITI, where it successfully identifies 22 misconfigurations that could cause isolation and reachability issues. Furthermore, we evaluate MEV against Batfish + on FITI and a range of synthetic networks with diverse scales, and find that it achieves up to a 10 2 × speedup over Batfish + .
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3 (CoNEXT4) , 1-25
Open AccessScalable and Interpretable Overlay Network Checking via Ensemble Verification
Overlay/underlay architecture is increasingly prevalent in modern networks but also introduces greater complexity and error-proneness. Existing control plane verifiers for underlay networks face scalability and interpretability challenges when extended to overlay/underlay networks due to methodological limitations. This paper presents MEV, the first control plane verifier designed for overlay/underlay networks. MEV introduces ensemble verification, a novel verification paradigm enabling independent reasoning for behaviors within each routing instance or protocol and forwarding behaviors within each virtual network. We implement and deploy MEV on a real nationwide overlay/underlay network, FITI, where it successfully identifies 22 misconfigurations that could cause isolation and reachability issues. Furthermore, we evaluate MEV against Batfish + on FITI and a range of synthetic networks with diverse scales, and find that it achieves up to a 10 2 × speedup over Batfish + .
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4731-4733
Poster: ERIS: Evaluating ROV via ICMPv6 Rate Limiting Side Channels
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4731-4733
Open AccessPoster: ERIS: Evaluating ROV via ICMPv6 Rate Limiting Side Channels
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1056-1069
Low-Overhead Distributed Application Observation with DeepTrace: Achieving Accurate Tracing in Production Systems
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1056-1069
Open AccessLow-Overhead Distributed Application Observation with DeepTrace: Achieving Accurate Tracing in Production Systems
- Open Access
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1254-1256
Achieving High-Speed and Robust Encrypted Traffic Anomaly Detection with Programmable Switches
- 27 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1254-1256
Open AccessAchieving High-Speed and Robust Encrypted Traffic Anomaly Detection with Programmable Switches