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

Cheng Zhang 0012

dblp:82/6384-12 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2020
—ORCID · conflict

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

Computer networks · 8 · 4 first-author

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
5 papers
Software-defined and programmable networks · 57% Network management and operations · 33% Internet of things and sensor networks · 9%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
1.852020
HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries · IEEE J. Sel. Areas Commun. 2020
P4DB: On-the-Fly Debugging for Programmable Data Planes · IEEE/ACM Trans. Netw. 2019
HyperVDP: High-Performance Virtualization of the Programmable Data Plane · IEEE J. Sel. Areas Commun. 2019
Network management and operations › fault management
fault diagnosis
0.832020
P4DB: On-the-Fly Debugging for Programmable Data Planes · IEEE/ACM Trans. Netw. 2019
P4DB: On-the-fly debugging of the programmable data plane · ICNP 2017
HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries · IEEE J. Sel. Areas Commun. 2020
Software-defined and programmable networks › programmable data plane
p4
0.522019
HyperVDP: High-Performance Virtualization of the Programmable Data Plane · IEEE J. Sel. Areas Commun. 2019
P4DB: On-the-Fly Debugging for Programmable Data Planes · IEEE/ACM Trans. Netw. 2019
Internet of things and sensor networks › wireless sensor network
network diagnosis
0.412020
HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries · IEEE J. Sel. Areas Commun. 2020
Network management and operations
network monitoring
0.412020
HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries · IEEE J. Sel. Areas Commun. 2020
Software-defined and programmable networks › programmable data plane
data plane virtualization
0.412019
HyperVDP: High-Performance Virtualization of the Programmable Data Plane · IEEE J. Sel. Areas Commun. 2019
Cloud and datacenter computing › computation offloading
network function offloading
0.112019
HyperVDP: High-Performance Virtualization of the Programmable Data Plane · IEEE J. Sel. Areas Commun. 2019

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

hypervisor design · 0.8hitless reconfiguration · 0.8watch-break-next primitives · 0.7streaming processing · 0.4declarative query language · 0.4bloom filter · 0.4match-action table decomposition · 0.4packet equivalence class abstraction · 0.3behavior tracking algorithms · 0.3runtime debugging primitives · 0.3
YearPublicationVenuePosition
2020 FlexMesh: Flexibly Chaining Network Functions on Programmable Data Planes at Runtime
Yu Zhou 0008, Jun Bi, Cheng Zhang 0012, Mingwei Xu 0001, Jinaping Wu
Networking3
2020 HyperSight: Towards Scalable, High-Coverage, and Dynamic Network Monitoring Queries
abstract
Performing fine-grained and real-time network monitoring is the core logic of various data center operation applications, such as traffic engineering, network troubleshooting, and anomaly detecting. However, the state-of-the-art network monitoring solutions either fall short of completely detecting all network incidents (i.e., congestion), yielding limited monitoring coverage, or introduce large overheads, yielding limited scalability. In this paper, we present HyperSight, a network traffic monitor with both high coverage and low overheads. The key idea of HyperSight is to monitor networks at the behavior level via tracking packet behavior changes. HyperSight proposes three designs for behavior-level monitoring. First, to facilitate expressing various network monitoring tasks, HyperSight presents a declarative query language based on the streaming processing model. Second, HyperSight proposes Bloom Filter Queue (BFQ), a memory-efficient algorithm to empower in-network capability for monitoring packet behavior changes. BFQ can be implemented on commodity programmable switches. Third, to support dynamic deployment and execution of packet behavior change monitoring tasks without interrupting on-service switches, HyperSight proposes virtual BFQ to support dynamic query compilation. We build a prototype of HyperSight and deploy it on commodity programmable switches. Evaluation results show that HyperSight supports a wide range of network event queries and can monitor over 99% packet behavior changes while keeping remarkably low overheads.
Yu Zhou 0008, Jun Bi, Tong Yang 0003, Kai Gao 0001, Jiamin Cao, Yangyang Wang 0001, Cheng Zhang 0012
IEEE J. Sel. Areas Commun.8
2019 HyperVDP: High-Performance Virtualization of the Programmable Data Plane
abstract
With the advent of P4-specific programmable data plane (PDP), network functions (NFs) can be offloaded into the PDP to achieve high performance guaranteed by hardware. Meanwhile, CPU powers consumed by NFs can be released to user applications. However, as more and more NFs can be offloaded, several problems rooted inside the PDP severely hinder it from facilitating this offloading trend. 1) The existing PDP provides the exclusive data plane abstraction where different NFs cannot operate the same data plane. 2) The PDP is hardly able to deploy NFs in a “hitless” manner. In this paper, we propose HyperVDP as a high-performance data plane hypervisor to provision non-exclusive abstraction and uninterrupted reconfigurability on the P4-specific PDP. To achieve virtualization, we design several innovative techniques to equally express functions of all programmable elements in the P4-specific PDP. We implement the prototype of HyperVDP on different target platforms, and evaluate different target-based prototypes by comparing with their counterparts. Results show that BMv2-target HyperVDP averagely prevails over its counterpart 2.5× in performance and 4× in resource efficiency. DPDK-target HyperVDP performs comparably to its counterparts while offering virtualization features which neither of its counterparts could provide.
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008
IEEE J. Sel. Areas Commun.1
2019 P4DB: On-the-Fly Debugging for Programmable Data Planes
abstract
While extending network programmability to a more considerable extent, P4 raises the difficulty of detecting and locating bugs, e.g., P4 program bugs and missed table rules, in runtime. These runtime bugs, without prompt disposal, can ruin the functionality and performance of networks. Unfortunately, the absence of efficient debugging tools makes runtime bug troubleshooting intricate for operators. This paper is devoted to on-the-fly debugging of runtime bugs for programmable data planes. We propose P4DB, a general debugging platform that empowers operators to debug P4 programs in three levels of visibility with rich primitives. By P4DB, operators can use the watch primitive to quickly narrow the debugging scope from the network level or the device level to the table level, then use the break and next primitives to decompose match-action tables and finely locate bugs. We implement a prototype of P4DB and evaluate the prototype on two widely-used P4 targets. On the software target, P4DB merely introduces a small throughput penalty (1.3% to 13.8%) and a little delay increase (0.6% to 11.9%). Notably, P4DB almost introduces no performance overhead on Tofino, the hardware P4 target.
Yu Zhou 0008, Jun Bi, Cheng Zhang 0012, Bingyang Liu, Zhaogeng Li, Yangyang Wang 0001, Mingli Yu
IEEE/ACM Trans. Netw.3
2018 KeySight: Troubleshooting Programmable Switches via Scalable High-Coverage Behavior Tracking
abstract
The rise of programmable switches and P4 brings much flexibility to networks, but this flexibility comes with increased risks of bugs. Diagnosing these bugs is essential for network operation but is non-trivial. A potential approach is to track packet behaviors through postcards, but existing tools either generate substantial postcards (limited scalability) or only track a small proportion of packet behaviors (low coverage). In this paper, we present KeySight, a platform that troubleshoots programmable switches with high scalability and high coverage. The key idea is based on the Packet Equivalence Class (PEC) abstraction that aggregates packets with identical behaviors and generates one postcard per behavior. The PEC abstraction minimizes the number of postcards while tracking all packet behaviors. We design novel algorithms to analyze PECs of P4 programs and to implement the PEC abstraction on programmable switches. We deploy KeySight on Tofino and SmartNIC, and evaluate it against 80 P4 programs and real packet traces of over 5TB. Results show that in the premise of overseeing over 99.9% packet behaviors, KeySight reduces the number of postcards by one to two orders of magnitude when comparing with NetSight.
Yu Zhou 0008, Jun Bi, Tong Yang 0003, Kai Gao 0001, Cheng Zhang 0012, Jiamin Cao, Yangyang Wang 0001
ICNP5
2018 B-Cache: A Behavior-Level Caching Framework for the Programmable Data Plane
abstract
By enabling operators to program behaviors of the packet processing pipeline, P4, a domain-specific language, unleashes new opportunities for offloading network functions onto the programmable data plane (PDP) and enhancing network performance. However, recent research shows that as P4 programs and the corresponding packet processing pipeline grow in size and complexity, the performance of the PDP will decrease significantly, which compromises the programmability and flexibility brought by P4. To overcome this performance degradation, we propose B-Cache, a general behavior-level caching framework for both stateful and stateless behaviors on the PDP. The basic idea of B-Cache is to compile packet processing behaviors that were once distributed across multiple tables into one synthetic cache table, thus guarantee the performance on various P4 targets. Our experiment results indicate that B-Cache comparably yields significant performance benefits including a 49% delay decrease and a 200% throughput increase on the software target, and a 60% throughput increase on the hardware target.
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008, Keyao Zhang, Zijun Ma
ISCC1
2017 HyperV: A High Performance Hypervisor for Virtualization of the Programmable Data Plane
abstract
P4 is a domain specific language designed to define the behavior of a programmable data plane. It facilitates offloading hardware-suitable Network Functions (NFs) to a data plane. Consequently, NFs can maximally benefit from high performance of hardware devices, meanwhile more CPU power can be reserved for user applications. However, since the programmable data plane provides an NF with an exclusive network context, different NFs cannot operate on the same data plane simultaneously. Besides, it is hardly possible to dynamically reconfigure programmable network devices without interrupting the operation of a data plane. Therefore, we propose HyperV, a high performance hypervisor for virtualization of a P4 specific data plane, to provide both non-exclusive and uninterrupted features.We implemented HyperV based on a P4-BMv2 target and a DPDK target respectively. Then we evaluated BMv2-target HyperV by comparing with Hyper4, a recently proposed hypervisor, and evaluated DPDK- target HyperV by comparing with PISCES and Open vSwitch. Results show that BMv2- target HyperV averagely prevails over Hyper4 2.5x in performance while reducing resource usage by 4x. DPDK-target HyperV performs comparably to Open vSwitch and PISCES, with the worst case of a throughput penalty in less than 7\%, while providing a powerful capability of virtualization which neither of them provides.
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008, Abdul Basit Dogar
ICCCN1
2017 P4DB: On-the-fly debugging of the programmable data plane
abstract
While extending network programmability to a larger degree, P4 also raises the risks of incurring runtime bugs after the deployment of P4 programs. These runtime bugs, if not handled promptly and properly, can ruin the functionality and performance of networks. Unfortunately, the absence of runtime debuggers makes troubleshooting of P4 program bugs challenging and intricate for operators. This paper is devoted to the on-the-fly debugging of runtime bugs in P4-enabled networks. We propose P4DB, a general debugging platform that empowers operators to debug P4 programs in three levels of visibility by provisioning operator-friendly primitives. By P4DB, operators can use the watch primitive to quickly narrow the debugging scope from network level or device level to table level, then use the break and next primitives to decompose the match-action table into three steps and troubleshoot the runtime bugs step by step. We implemented a prototype of P4DB and evaluated the performance in terms of the data plane, control plane and control channel. On P4-specific programmable data plane, P4DB merely introduces a small throughput penalty (1.3%~13.8%) and imposes a little-increased delay (0.6%~11.9%).
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008, Bingyang Liu, Zhaogeng Li, Abdul Basit Dogar, Yangyang Wang 0001
ICNP1