JZJiaqi Zheng

Jiaqi Zheng

*This is an algorithmically generated author record based on publicly available information.

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


Jiaqi Zheng has a total of 209 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    End-to-End Delayed Matching Learning for Micro-View Order Dispatching in Ride-Hailing

    by Rongxiao Huang, Hao Zhou, Jiaqi Zheng, Jiecheng Guo, Guobin Wu, Qun Li, Guihai Chen

  • Open Access

    UBEP: Re-architecting Expert Parallelism Communication Library for Production Superpods

    by Yipeng Liu, Chang Liu, Si Shen, Jiaqi Zheng, Mingfan Li, Yuyang Yang, Guanhua Li, Yuquan Zhang, Yimeng Xu, Zhongzhe Hu, et al.

  • Open Access

    CubeTrace: Microscopic Network Tracing for Heterogeneous Cloud Gateways

    by Yunming Xiao, Yinchao Yang, Jiaqi Zheng, Xuqian Li, Dongbo Gu, Jun Zhang, Miantao Wan, Chao Pei, Chen Tian, Mingwei Xu, et al.

    Modern cloud gateways have evolved to include diverse network functions and heterogeneous hardware, such as programmable switches and FPGAs, to handle increasing workloads and minimize forwarding latency. Existing network tracing tools, however, operate primarily at device granularity and cannot pinpoint which function on which hardware component causes packet losses or latency spikes. To bridge this gap, we present CubeTrace, a unified, function-level flow tracing system that enables microscopic tracing inside heterogeneous cloud gateways. CubeTrace standardizes tracing units as cubes across different hardware platforms, regardless of their varied underlying implementations, and operates at flow granularity for reliability reasons. This introduces a new tracing abstraction for heterogeneous gateways while maintaining low overhead. Moreover, the collected flow-cube data by CubeTrace can be decoded into packet-level representations and integrated with well-established distributed tracing frameworks, enabling the use of off-the-shelf analysis tools. Our evaluations demonstrate that CubeTrace introduces minimal overhead, consuming less than 1% of memory resources and adding less than 1% to forwarding latency. Having been deployed in a large-scale cloud gateway, CubeTrace has significantly improved problem localization, reducing resolution times from hours or even days to just minutes.

  • CDNProbe: Towards accurate and comprehensive CDN identification

    by Minyuan Zhou, Zixuan Yang, Jiaqi Zheng, Wanchun Dou, Guihai Chen

  • Open Access

    Mitigating CDN Cache Misses with Scheduling: An Origin Shield for Billion-QPS Social Platforms

    by Zixuan Yang, Yimeng Xu, Jiaqi Zheng, Boxi Liu, Guihai Chen, Quan Xia, He Lin, Zhihai Huang, Shangce Yuan

    The explosive growth of modern short-video platforms like WeChat Channels — approaching 1.4 billion monthly active users (MAU) while serving over one billion queries per second (QPS) — has exposed fundamental limitations in conventional content delivery network (CDN) architectures, particularly their inability to handle highly dynamic content popularity patterns. The traditional cache-centric approach proves to be catastrophic when faced with ephemeral content exhibiting a "million-item waist" distribution. This phenomenon results in severe cache pollution (manifesting as 5–40% origin miss ratios) and introduces prohibitive back-to-origin bandwidth costs. Our TritonFlow overcomes these challenges by introducing access point scheduling as a novel origin traffic compensator, which reduces the operational cost of back-to-origin fetches by enhancing CDN cache affinity. Through analysis of production traces (peak >1B QPS), we demonstrate that TritonFlow reduces scheduling fluctuations by 96% and decreases back-to-origin traffic caused by non-compulsory cache misses by 35%, all while maintaining sub-200ms fetch latency.

  • Handling Traffic Uncertainty in Failure-Tolerant Traffic Engineering

    by Shiju Zhao, Jiaqi Zheng, Guihai Chen

    Network failure uncertainty and traffic demand uncertainty pose a series of challenges to efficiently solve network traffic engineering (TE) problems in the production wide-area networks (WANs). Prior works especially predict-then-optimize paradigm in TE systems encounter a significant mismatch between the upstream prediction task and the downstream optimization task, leading to potential demand loss risk and further degrading the performance of customer-facing applications in the cloud. In this paper, we present TUFTTE, a risk-driven TE optimization framework, where the objective function and constraints can be flexibly specified by the network operators. We employ a differentiable optimization layer to guide the prediction model with the objective of minimizing the network risks. When the network risk is defined as the demand loss, our approach can provably converge to the global optimum. Experimental results on real-world topology demonstrate that TUFTTE reduces the demand loss by 11.59% on average compared to the state-of-the- art algorithm. We believe that our paper deeply explores the potential of prediction and promotes the understanding on how to develop and deploy a general learning module into the commercial TE optimization.


  • F-PFC: Enabling Fine-Grained PFC in Lossless Data Center Networks

    by Xin He, Yan Li, Jiaqi Zheng, Weibei Fan, Lei Han, Guihai Chen, Fu Xiao

    Data centers rely on Priority-based Flow Control (PFC) to achieve lossless data transmission in Ethernet networks. To avoid buffer overflow, PFC pauses flows in a coarse-grained manner, which brings potential problems, e.g., Head-of-Line (HoL) blocking, and PFC deadlock. Although the state-of-the-art approach BFC with per-flow backpressure tackles some of the limitations of PFC, it faces implementation challenges due to the need for a large number of queues. In this paper, we present F-PFC, a fine-grained flow control scheme that only leverages a small amount of queues to address the limitations of PFC. Specifically, F-PFC first designs a fine-grained flow backpressure scheme to adjust the intensity of flow control adaptively. With different levels of flow backpressure, F-PFC ensures high throughput and low latency simultaneously. Then, F-PFC presents an accurate flow identification scheme to locate flows that really contribute to congestion. Finally, F-PFC presents a dynamic queue assignment and scheduling scheme to isolate congestion flows with limited queues. We theoretically analyze the performance of F-PFC and present the implementation of F-PFC. Extensive testbed experiments and large-scale simulations verify the performance of F-PFC. The experimental results show that F-PFC reduces tail latency by at least 33% and queue occupancy by 46% compared with state-of-the-art approaches.


  • Analysis of Pyrrha: Congestion-Root-Based Flow Control Is Most Cost-Effective to Eliminate Head-of-Line Blocking

    by Zhaochen Zhang, Kexin Liu, Peirui Cao, Chang Liu, Yizhi Wang, Vamsi Addanki, Stefan Schmid, Qingyue Wang, Wei Chen, Xiaoliang Wang, et al.

    In modern datacenters, the effectiveness of end-to-end congestion control (CC) is quickly diminishing with the rapid bandwidth evolution. Per-hop flow control (FC) can react to congestion more promptly. However, a coarse-grained FC can result in Head-Of-Line (HOL) blocking. A fine-grained, per-flow FC can eliminate HOL blocking caused by flow control, however, it does not scale well. This paper presents Pyrrha, a scalable flow control approach that provably eliminates HOL blocking while using a minimum number of queues. In Pyrrha, flow control first takes effect on the root of the congestion, i.e., the port where congestion occurs. And then flows are controlled according to their contributed congestion roots. A prototype of Pyrrha is implemented on Tofino2 switches. Compared with state-of-the-art approaches, the average FCT of uncongested flows is reduced by 42%-98%, and 99th-tail latency can be $1.6\times $ - $215\times $ lower, without compromising the performance of congested flows.


  • Parallel Wormhole Filters: High-Performance Approximate Membership Query Data Structures for Persistent Memory

    by Hancheng Wang, Haipeng Dai, Shusen Chen, Meng Li, Rong Gu, Youyou Lu, Chengxun Wu, Jiaqi Zheng, Lexi Xu, Guihai Chen

    Approximate membership query (AMQ) data structures can approximately determine whether an element exists in a given dataset. They are widely used in parallel and distributed systems (e.g., high-performance databases, distributed cache systems, and bioinformatics systems) to avoid unnecessary dataset accesses, thereby accelerating massive data processing. For AMQ data structures used in the above systems, achieving high throughput, low false positive rate, and large capacity objectives simultaneously is critical but challenging. Porting AMQ data structures from DRAM to persistent memory makes it possible to achieve the above three objectives simultaneously, but this porting is not a trivial task. Specifically, existing AMQ data structures generate numerous random accesses and/or sequential writes on persistent memory, resulting in poor throughput. Therefore, in the conference version of this paper, we proposed a novel AMQ data structure called wormhole filter, which achieves high throughput on persistent memory, thereby achieving the above three objectives simultaneously. In this journal version, we extend our prior work by introducing parallel wormhole filters to enhance parallel performance. Additionally, we integrate parallel wormhole filters into the LevelDB database system to show that porting AMQ data structures to persistent memory significantly improves system endto-end throughput. Theoretical analysis and experimental results show that wormhole filters significantly outperform state-of-theart AMQ data structures. For example, wormhole filters achieve 12.06× insertion throughput, 1.98× positive lookup throughput, and 8.82× deletion throughput of the best competing baseline.