VLDB 2026 Research / reviewers in the wild / expert
Liangcheng Yu
dblp:227/7188
· DBLP profile ↗
12ranked-venue papers
5as first author
9since 2021 · last 2026
0000-0001-7010-2529ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 10 · 3 first-author · 7 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FAST: An Efficient Scheduler for All-to-All GPU Communication
Yiran Lei, Dongjoo Lee 0001, Liangyu Zhao, Daniar Kurniawan, Chanmyeong Kim, Heetaek Jeong, Changsu Kim 0004, Hyeonseong Choi, Liangcheng Yu, Arvind Krishnamurthy, Justine Sherry, Eriko Nurvitadhi |
NSDI | 9 |
| 2026 | Honey, I Shrunk the Headers With Flow.ZIPabstractPacket header overhead is a persistent source of inefficiency in packet-switched networks, reducing goodput and increasing network load. Trends like tunneling further increase this overhead, significantly impacting flow completion times. While, in principle, it is possible to compress these headers, existing methods require specialized hardware on every hop to compress/decompress the packet to/from custom header formats. Yinda Zhang 0002, Liangcheng Yu, Gianni Antichi, Ran Ben-Basat, Vincent Liu 0001 |
SIGCOMM | 2 |
| 2025 | Cuttlefish: A Fair, Predictable Execution Environment for Cloud-Hosted Financial Exchanges
Liangcheng Yu, Prateesh Goyal, Ilias Marinos, Vincent Liu 0001 |
AFT | 1 |
| 2025 | Enabling Silent Telemetry Data Transmission with InvisiFlow
Yinda Zhang 0002, Liangcheng Yu, Gianni Antichi, Ran Ben-Basat, Vincent Liu 0001 |
NSDI | 2 |
| 2024 | Beaver: Practical Partial Snapshots for Distributed Cloud Services
Liangcheng Yu, Haoran Zhang 0009, John Sonchack, Dan R. K. Ports, Vincent Liu 0001 |
OSDI | 1 |
| 2023 | Cowbird: Freeing CPUs to Compute by Offloading the Disaggregation of MemoryabstractMemory disaggregation allows applications running on compute servers to expand their pool of available memory capacity by leveraging remote resources through low-latency networks. Unfortunately, in existing software-level disaggregation frameworks, the simple act of issuing requests to remote memory---paid on every access---can consume many CPU cycles. This overhead represents a direct cost to disaggregation, not only on the throughput of remote memory access but also on application logic, which must contend with the framework's CPU overheads. Xinyi Chen 0004, Liangcheng Yu, Vincent Liu 0001, Qizhen Zhang 0001 |
SIGCOMM | 2 |
| 2022 | OrbWeaver: Using IDLE Cycles in Programmable Networks for Opportunistic Coordination
Liangcheng Yu, John Sonchack, Vincent Liu 0001 |
NSDI | 1 |
| 2022 | PrintQueue: performance diagnosis via queue measurement in the data planeabstractWhen diagnosing performance anomalies, it is often useful to reason about why a packet experienced the queuing that it did. To that end, we observe that queuing is both a result of historical effects and the current state of the network. Further, both factors involve short and long timescales by nature. Existing work fails to provide insight that satisfies all of these needs. Yiran Lei, Liangcheng Yu, Vincent Liu 0001, Mingwei Xu 0001 |
SIGCOMM | 2 |
| 2022 | Cebinae: scalable in-network fairness augmentationabstractFor public networks like the Internet and those of many clouds, end-host applications can use any congestion control protocol they wish. This protocol diversity and application autonomy are only increasing over time. While in-network support for fairness is an attractive solution for reigning in the inequity, existing solutions still have difficulty scaling to today's networks using today's devices. In this paper, we present Cebinae, a mechanism for augmenting existing networks of legacy hosts with penalties for flows that exceed their max-min fair share. Cebinae is compatible with all of the congestion control protocols in today's Internet, is deployable on commodity programmable switches, and scales orders of magnitude beyond existing alternatives. Liangcheng Yu, John Sonchack, Vincent Liu 0001 |
SIGCOMM | 1 |
| 2020 | Mantis: Reactive Programmable SwitchesabstractFor modern data center switches, the ability to---with minimum latency and maximum flexibility--- react to current network conditions is important for managing increasingly dynamic networks. The traditional approach to implementing this type of behavior is through a control plane that is orders of magnitude slower than the speed at which typical data center congestion events occur. More recent alternatives like programmable switches can remember statistics about passing traffic and adjust behavior accordingly, but unfortunately, their capabilities severely limit what can be done. Liangcheng Yu, John Sonchack, Vincent Liu 0001 |
SIGCOMM | 1 |
| 2020 | ZigFi: Harnessing Channel State Information for Cross-Technology CommunicationabstractCross-technology communication (CTC) is a technique that enables direct communication among different wireless technologies. Recent works in this area have made substantial progress, but CTC from ZigBee to WiFi remains an open problem. In this paper, we propose ZigFi, a novel CTC framework that enables communication from ZigBee to WiFi. ZigFi carefully overlaps ZigBee packets with WiFi packets. Through experiments we show that Channel State Information (CSI) of the overlapped packets can be used to convey data from ZigBee to WiFi. Based on this finding, we propose a receiver-initiated protocol and translate the decoding problem into a problem of CSI classification with Support Vector Machine. We further build a generic model through experiments, which describes the relationship between the Signal to Interference and Noise Ratio (SINR) and the symbol error rate (SER). Moreover, we extend ZigFi to multiple-to-one concurrent transmissions. We implement ZigFi on commercial-off-the-shelf WiFi and ZigBee devices. We evaluate the performance of ZigFi under different experimental settings. The results demonstrate that ZigFi achieves a throughput of 215.9bps, which is 18X faster than the state of the arts. Xiuzhen Guo, Yuan He 0004, Xiaolong Zheng 0002, Liangcheng Yu, Omprakash Gnawali |
IEEE/ACM Trans. Netw. | 4 |
| 2018 | ZIGFI: Harnessing Channel State Information for Cross-Technology CommunicationabstractCross-technology communication (CTC) is a technique that enables direct communication among different wireless technologies. Recent works in this area have made positive progress, but high-throughput CTC from ZigBee to WiFi remains an open problem. In this paper, we propose ZigFi, a novel CTC framework that enables direct communication from ZigBee to WiFi. Without impacting the ongoing WiFi transmissions, ZigFi carefully overlaps ZigBee packets with WiFi packets. Through experiments we show that Channel State Information (CSI) of the overlapped packets can be used to convey data from ZigBee to WiFi. Based on this finding, we propose a receiver-initiated protocol and translate the decoding problem into a problem of CSI classification with Support Vector Machine. We further build a generic model through experiments, which describes the relationship between the Signal to Interference and Noise Ratio (SINR) and the symbol error rate (SER). We implement ZigFi on commercial-off-the-shelf WiFi and ZigBee devices. We evaluate the performance of ZigFi under different experimental settings. The results demonstrate that ZigFi achieves a throughput of 215.9bps, which is 18X faster than the state-of-the-art. Xiuzhen Guo, Yuan He 0004, Xiaolong Zheng 0002, Liangcheng Yu, Omprakash Gnawali |
INFOCOM | 4 |