Demo Data from VLDB 2026 / reviewers in the wild / expert
Dan Wang 0024
dblp:23/2060-24
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0001-6572-2894ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 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
2 papers |
Network measurement and analytics · 89% Software-defined and programmable networks · 11% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics › traffic analysis
traffic pattern detection |
1.0 | 1 | 2026 | PatternSketch: General and Runtime Reconfigurable Time-series Network Traffic Pattern Detection · EuroSys 2026 |
Network measurement and analytics › heavy hitter detection
elephant flow detection |
0.8 | 1 | 2024 | Jigsaw-Sketch: a fast and accurate algorithm for finding top-k elephant flows in high-speed networks · Sci. China Inf. Sci. 2024 |
Network measurement and analytics
traffic measurement |
0.8 | 1 | 2024 | Jigsaw-Sketch: a fast and accurate algorithm for finding top-k elephant flows in high-speed networks · Sci. China Inf. Sci. 2024 |
Software-defined and programmable networks
programmable data plane |
0.3 | 1 | 2026 | PatternSketch: General and Runtime Reconfigurable Time-series Network Traffic Pattern Detection · EuroSys 2026 |
Methods — techniques the papers use, named apart from their topics
sketch · 1.8pattern automaton · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PatternSketch: General and Runtime Reconfigurable Time-series Network Traffic Pattern DetectionabstractNetwork traffic measurement is indispensable for many network management tasks. Time-series traffic pattern detection extends the benefits of traditional single-period flow measurement by revealing dynamic flow behaviors, but also yields higher complexity. When multiple patterns must be monitored simultaneously, building a separate sketch for each pattern is prohibitive since programmable switches typically allow only one resource-intensive sketch. In this paper, we propose PatternSketch, which enables general and dynamically reconfigurable time-series pattern detection within a single sketch. PatternSketch unifies the detection of diverse patterns with a Pattern Automaton and decomposes the pattern detection process into two phases in the data plane, while allowing operators to reconfigure the active set of monitoring patterns at runtime without taking the switch offline. Our implementation on an Intel Tofino switch demonstrates that PatternSketch can operate at line rate, detecting multiple patterns concurrently while using only tens of kilobytes of SRAM. This significantly reduces both computational and storage resource consumption compared to deploying multiple, pattern-specific sketches. Evaluations on four real-world datasets show that the hardware version of PatternSketch maintains over 90% F1 scores while simultaneously detecting six time-series patterns (three representative and three newly proposed) with as little as 200KB of memory. Yang Du 0006, Dan Wang 0024, He Huang 0001, Hanwen Zhang 0030, Jianzhi Tang, Fu Xiao 0001, Yu-e Sun |
EuroSys | 2 |
| 2025 | Multiscale Sketch: Finding Heavy Spread Changes in High-Speed Networks Over Sliding Windows
Dan Wang 0024, Yang Du 0006, He Huang 0001, Yu-e Sun, Guoju Gao |
ICIC (20) | 1 |
| 2024 | Jigsaw-Sketch: a fast and accurate algorithm for finding top-k elephant flows in high-speed networks
He Huang 0001, Yu-e Sun, Yang Du 0006, Dan Wang 0024 |
Sci. China Inf. Sci. | 5 |