Chenyang Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chenyang Zhao has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Haifeng Sun
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Jianxin Liao
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Jingyu Wang
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China
3 shared publications - Qi Qi
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publications - Zirui Zhuang
Beijing University of Posts and Telecommunications
3 shared publications - Bo He
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4621-4636
Region Partitioning-Based Scalable Real-Time Network Verification via Native Distributed Architecture
Data plane verification (DPV) is critical in ensuring correct network operation, but practical deployment demands solutions that simultaneously achieve real-time responsiveness and massive scalability. Conventional centralized DPV approaches fundamentally struggle with these requirements due to inherent architectural constraints: the single verification server becomes both a computational bottleneck during rapid verification cycles and a collection bottleneck when gathering real-time data plane updates across large-scale networks. As network scale increases, these limitations manifest as either unacceptable verification latency or incomplete data plane visibility—precisely when robust DPV is essential for preventing packet loss and security violations. This paper introduces Atlas*, a novel distributed data plane verification (DPV) system designed to address fundamental scalability and real-time performance challenges in network verification. Atlas* achieves this through a hierarchical architecture that strategically distributes verification tasks across specialized components, combined with innovative parallel processing techniques to maximize computational efficiency. Simultaneously, Atlas* optimizes communication latency between distributed components through a region partitioning algorithm. Extensive evaluations in simulated environments and production deployments demonstrate Atlas*’s capability to perform fast, scalable verification while maintaining lightweight resource allocation. Empirical results show Atlas* achieves 2-7x speedup compared to existing state-of-the-art solutions, with performance advantages progressively increasing as network scale expands.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4621-4636
Region Partitioning-Based Scalable Real-Time Network Verification via Native Distributed Architecture
Data plane verification (DPV) is critical in ensuring correct network operation, but practical deployment demands solutions that simultaneously achieve real-time responsiveness and massive scalability. Conventional centralized DPV approaches fundamentally struggle with these requirements due to inherent architectural constraints: the single verification server becomes both a computational bottleneck during rapid verification cycles and a collection bottleneck when gathering real-time data plane updates across large-scale networks. As network scale increases, these limitations manifest as either unacceptable verification latency or incomplete data plane visibility—precisely when robust DPV is essential for preventing packet loss and security violations. This paper introduces Atlas*, a novel distributed data plane verification (DPV) system designed to address fundamental scalability and real-time performance challenges in network verification. Atlas* achieves this through a hierarchical architecture that strategically distributes verification tasks across specialized components, combined with innovative parallel processing techniques to maximize computational efficiency. Simultaneously, Atlas* optimizes communication latency between distributed components through a region partitioning algorithm. Extensive evaluations in simulated environments and production deployments demonstrate Atlas*’s capability to perform fast, scalable verification while maintaining lightweight resource allocation. Empirical results show Atlas* achieves 2-7x speedup compared to existing state-of-the-art solutions, with performance advantages progressively increasing as network scale expands.
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1350-1364
Atlas: Towards Real-Time Verification in Large-Scale Networks via a Native Distributed Architecture
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1350-1364
Open AccessAtlas: Towards Real-Time Verification in Large-Scale Networks via a Native Distributed Architecture
- Open Access
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (3) , 1279-1294
Fast and Scalable Data Plane Verification for Burst Updates With Edge-Predicate
There is an increasing interest in data plane verification, which is designed to automatically verify network correctness through directly analyzing the data plane. Recent data plane verifiers have been able to do real-time sub-millisecond per rule verification. However, we observe that in real-world networks, individual data plane updates rarely occur. On the contrary, there are always a certain number of updates generated in a short period of time, called as burst updates, due to high-level user intend or uncertain network events. When it comes to this real-life scenario, yet, the current equivalence class (EC) based methods are unable to solve the model-wide changes problem caused by the EC itself, which significantly slows down the verification speed of burst updates. To overcome this limitation, we present EPVerifier, a fast, scalable data plane verifier accelerating burst updates verification with edge-predicate (EP). Instead of classifying packets into ECs according to global forwarding behavior, the EPVerifier uses one EP per edge to represent all packets that can pass through. Furthermore, with EPs that clearly have localized properties, we introduce a rule type extension that does not require a change in the granularity of the network model to support ACLs and NATs that are prevalent in real devices, and obtain better-performing parallelism by dividing the verification task based on switches. Experiments on both dataset simulations and real-life deployments show that EPVerifier achieves 2-10$\times$ faster data plane verification than the state-of-the-art and such advantage expand with the data plane’s complexity and update scale growth.
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (3) , 1279-1294
Open AccessFast and Scalable Data Plane Verification for Burst Updates With Edge-Predicate
There is an increasing interest in data plane verification, which is designed to automatically verify network correctness through directly analyzing the data plane. Recent data plane verifiers have been able to do real-time sub-millisecond per rule verification. However, we observe that in real-world networks, individual data plane updates rarely occur. On the contrary, there are always a certain number of updates generated in a short period of time, called as burst updates, due to high-level user intend or uncertain network events. When it comes to this real-life scenario, yet, the current equivalence class (EC) based methods are unable to solve the model-wide changes problem caused by the EC itself, which significantly slows down the verification speed of burst updates. To overcome this limitation, we present EPVerifier, a fast, scalable data plane verifier accelerating burst updates verification with edge-predicate (EP). Instead of classifying packets into ECs according to global forwarding behavior, the EPVerifier uses one EP per edge to represent all packets that can pass through. Furthermore, with EPs that clearly have localized properties, we introduce a rule type extension that does not require a change in the granularity of the network model to support ACLs and NATs that are prevalent in real devices, and obtain better-performing parallelism by dividing the verification task based on switches. Experiments on both dataset simulations and real-life deployments show that EPVerifier achieves 2-10$\times$ faster data plane verification than the state-of-the-art and such advantage expand with the data plane’s complexity and update scale growth.
- Open Access
- 3 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 81-87
Scaling Data Plane Verification via Parallelization
The data plane verification of networks in hyperscale environments is challenging due to the complexity and size of modern networks. In this paper, we introduce Medusa, a novel verifier that efficiently analyzes large data plane models using parallel processing on multi-core CPUs. First, we propose a new data structure called RANGESET, which overcomes the parallelism limitations of existing popular data structures such as Binary Decision Diagrams (BDD) used in data plane verifiers. Next, we leverage multi-core processing by dividing the network into distinct groups and assigning each group to a separate thread for computation. The results are then integrated for comprehensive verification. By optimizing the use of multi-core systems, we enhance computational efficiency and accelerate the verification process. Experimental results demonstrate that Medusa outperforms existing tools in terms of speed and memory. For instance, in a network with O(10K) devices and O(1M) forwarding rules, Medusa can detect loops in approximately 5 seconds, outperforming other Data Plane Verifiers (DPVs) where some cannot model and analyze the network. Moreover, in networks that we could compare with other state-of-the-art DPVs, Medusa provides a substantial improvement, with speedups up to 600X, 4000X, and 800X compared to alternatives like Flash, APKeep, and Tulkun, respectively.
- 3 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 81-87
Open AccessScaling Data Plane Verification via Parallelization
The data plane verification of networks in hyperscale environments is challenging due to the complexity and size of modern networks. In this paper, we introduce Medusa, a novel verifier that efficiently analyzes large data plane models using parallel processing on multi-core CPUs. First, we propose a new data structure called RANGESET, which overcomes the parallelism limitations of existing popular data structures such as Binary Decision Diagrams (BDD) used in data plane verifiers. Next, we leverage multi-core processing by dividing the network into distinct groups and assigning each group to a separate thread for computation. The results are then integrated for comprehensive verification. By optimizing the use of multi-core systems, we enhance computational efficiency and accelerate the verification process. Experimental results demonstrate that Medusa outperforms existing tools in terms of speed and memory. For instance, in a network with O(10K) devices and O(1M) forwarding rules, Medusa can detect loops in approximately 5 seconds, outperforming other Data Plane Verifiers (DPVs) where some cannot model and analyze the network. Moreover, in networks that we could compare with other state-of-the-art DPVs, Medusa provides a substantial improvement, with speedups up to 600X, 4000X, and 800X compared to alternatives like Flash, APKeep, and Tulkun, respectively.