Demo Data from EDBT 2026 / reviewers in the wild / expert
Zirong Wei
dblp:419/9564
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0001-3382-1943ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 since 2021
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
3 papers |
Network measurement and analytics · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data stream processing · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics › per-flow measurement
flow estimation |
1.9 | 2 | 2026 | Achieving Differentiated Flow Estimation With Priority-Adaptive Sketch · IEEE Trans. Netw. 2026 Borrow Counter: A Generic Sketch Framework for Non-uniform Flow Estimation · ICNP 2025 |
Network measurement and analytics
sketch-based measurement |
1.0 | 1 | 2026 | Achieving Differentiated Flow Estimation With Priority-Adaptive Sketch · IEEE Trans. Netw. 2026 |
Network measurement and analytics
traffic measurement |
0.9 | 1 | 2025 | SplitSketch: Achieving Accurate Quantile Estimation under Highly Dynamic Traffic Distribution · ICNP 2025 |
Data stream processing › sketch
sketch-based estimation |
0.3 | 1 | 2025 | SplitSketch: Achieving Accurate Quantile Estimation under Highly Dynamic Traffic Distribution · ICNP 2025 |
Methods — techniques the papers use, named apart from their topics
sketch · 2.6priority-aware sampling · 2.0priority-aware hashing · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Achieving Differentiated Flow Estimation With Priority-Adaptive SketchabstractSketch has gained wide deployment and application for approximate flow estimation, because of its ability to maintain good accuracy and high throughput with limited memory resources. However, most existing sketch approaches ignore the distinctions between flow priorities, though the high-priority flows are relatively scarce but hold significant information. Therefore, a class of priority-aware sketches has appeared recently to provide differentiated measurement accuracy for flows with different priorities. Unfortunately, it is challenging for these priority-aware sketches to strike a good balance between accuracy and throughput. To address this issue, we propose a priority-adaptive architecture PA-Sketch, which utilizes priority-aware hash to dynamically allocate appropriate numbers of hash functions for different flows according to their priorities. Moreover, to further achieve good accuracy in extremely small memory space, we introduce the priority-aware sampling into PA-Sketch. The test results show that PA-Sketch significantly improves accuracy while minimizing the hash overhead. Compared to the state-of-the-art priority-aware sketches, PA-Sketch reduces the ARE of high-priority flows by 86% and improves the F1 score by 1.83 times, meanwhile maintaining slight accuracy loss for low-priority flows. Jiawei Huang 0001, Sitan Li, Zirong Wei, Jin Ye 0003 |
IEEE Trans. Netw. | 4 |
| 2025 | Borrow Counter: A Generic Sketch Framework for Non-uniform Flow Estimation
Jiawei Huang 0001, Sitan Li, Zirong Wei, Shengwen Zhou, Wenlu Zhang, Jin Ye 0003 |
ICNP | 4 |
| 2025 | SplitSketch: Achieving Accurate Quantile Estimation under Highly Dynamic Traffic DistributionabstractQuantiles over data stream have been recognized to be an essential feature in network traffic. To provide accurate estimation results, current quantile estimation approaches are preconfigured according to traffic distributions such as log-normal and Pareto distributions. In most practical applications, however, the traffic distributions are not known a priori or are highly dynamic, disturbing estimation results. In this paper, we propose SplitSketch, a sketch-based mechanism that aims to accurately estimate quantiles over data stream without any prior knowledge of traffic distributions. SplitSketch adjusts its estimation granularity according to the changing process of the traffic distribution. The granularities with denser distribution will be recorded with the finer granularity to provide more accurate estimation results. Experimental results demonstrate that, compared to existing approaches, SplitSketch reduces the absolute error in quantile estimation by 59.1% for heavy-tailed distributions and 79.2% for general distributions. Jin Ye 0003, Zirong Wei, Huilin Hu, Sitan Li, Jiawei Huang 0001 |
ICNP | 2 |