Wenrui Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenrui Liu has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Tong Yang
Peking University, Beijing, China
4 shared publications - Kaicheng Yang
Peking University, Beijing, China
3 shared publications - Bin Cui
Peking University
2 shared publications - Fenghao Dong
Peking University, Beijing, China
2 shared publications - Zirui Liu
Peking University, Beijing, China
2 shared publications - Aomufei Yuan
Peking University, Beijing, China
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- p. 1
Network-wide Measurement on Anomalies
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- p. 1
Network-wide Measurement on Anomalies
- Open Access
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 793-807
PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 793-807
Open AccessPipHeap: Approximate Heap in the Pipeline Empowering Network Measurement
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5004-5019
SteadySketch: A High-Performance Algorithm for Finding Steady Flows in Data Streams
In this paper, we study steady flows in data streams, which refers to the flows whose arrival rate is always non-zero and around a fixed value for several consecutive time windows. To find steady flows in real time, we propose a novel sketch-based algorithm, aiming to accurately report steady flows with limited memory. To the best of our knowledge, this is the first work to define and find steady flows in data streams. The key novelty of is our proposed reborn technique, which reduces the memory requirement by 75%. Our theoretical proofs show that the negative impact of the reborn technique is small. Experimental results show that, compared with the two comparison schemes, improves the Precision Rate (PR) by around 79.5% and 82.8%, and reduces the Average Relative Error (ARE) by around 905.9 $\times$ and 657.9 $\times$ , respectively. Finally, we provide three concrete cases: cache prefetch, Redis and P4 implementation. As we will demonstrate, SteadySketch can effectively improve the cache hit ratio while achieving satisfying performance on both Redis and Tofino switches. All related codes of are available at GitHub.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5004-5019
SteadySketch: A High-Performance Algorithm for Finding Steady Flows in Data Streams
In this paper, we study steady flows in data streams, which refers to the flows whose arrival rate is always non-zero and around a fixed value for several consecutive time windows. To find steady flows in real time, we propose a novel sketch-based algorithm, aiming to accurately report steady flows with limited memory. To the best of our knowledge, this is the first work to define and find steady flows in data streams. The key novelty of is our proposed reborn technique, which reduces the memory requirement by 75%. Our theoretical proofs show that the negative impact of the reborn technique is small. Experimental results show that, compared with the two comparison schemes, improves the Precision Rate (PR) by around 79.5% and 82.8%, and reduces the Average Relative Error (ARE) by around 905.9 $\times$ and 657.9 $\times$ , respectively. Finally, we provide three concrete cases: cache prefetch, Redis and P4 implementation. As we will demonstrate, SteadySketch can effectively improve the cache hit ratio while achieving satisfying performance on both Redis and Tofino switches. All related codes of are available at GitHub.
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 967-980
P4LRU: Towards An LRU Cache Entirely in Programmable Data Plane
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 967-980
Open AccessP4LRU: Towards An LRU Cache Entirely in Programmable Data Plane