Demo Data from EDBT 2026 / reviewers in the wild / expert
Hanglong Lv
dblp:337/2574
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0009-3696-581XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 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 · 78% Software-defined and programmable networks · 22% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics
sketch data structures |
1.5 | 2 | 2025 | PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement · IMC 2025 ChameleMon: Shifting Measurement Attention as Network State Changes · SIGCOMM 2023 |
Network measurement and analytics
network telemetry |
0.9 | 1 | 2025 | PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement · IMC 2025 |
Software-defined and programmable networks › programmable data plane
programmable switch |
0.9 | 1 | 2025 | PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement · IMC 2025 |
Network measurement and analytics › traffic measurement
flow measurement |
0.7 | 1 | 2023 | ChameleMon: Shifting Measurement Attention as Network State Changes · SIGCOMM 2023 |
Algorithms and data structures › priority queues
heap |
0.3 | 1 | 2025 | PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement · IMC 2025 |
Methods — techniques the papers use, named apart from their topics
sketch · 1.7fermat's little theorem · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PipHeap: Approximate Heap in the Pipeline Empowering Network MeasurementabstractNetwork telemetry has seen an increasing trend of deploying approximate measurement algorithms (e.g., sketches) on programmable switches due to their ability to provide line-rate speed, high measurement accuracy, and low memory cost.Heap, a vital component of many of measurement algorithms, hinders their deployment because of the difficulties in incorporating it into pipelines.In this paper, we introduce PipHeap, a pipeline-friendly, binary-tree-based min heap that can enhance existing sketches without introducing additional errors.Through evaluation with real-world datasets, we demonstrate that PipHeap can reduce the error of these integrated algorithms by 33% to 97% (78% on average) under the same memory allocation.We have successfully implemented PipHeap and its combination with six different sketches in our testbed, and successfully extended other approximate algorithms (e.g.Space-Saving) onto programmable switch platforms.We have made all code associated available as open-source. Yuhan Wu 0001, Fenghao Dong, Aomufei Yuan, Kaicheng Yang 0001, Hanglong Lv, Tong Yang 0003, Wenrui Liu 0006, Gaogang Xie |
IMC | 6 |
| 2023 | ChameleMon: Shifting Measurement Attention as Network State ChangesabstractNetwork measurement is critical to many network applications. There are mainly two kinds of flow-level measurement tasks: 1) packet accumulation tasks and 2) packet loss tasks. In practice, the two kinds of tasks are often required at the same time, but existing works seldom handle both. In this paper, we design ChameleMon to support the two kinds of tasks simultaneously. The key design of ChameleMon is to shift measurement attention as network state changes, through two dimensions of dynamics: 1) dynamically allocating memory between the two kinds of tasks; 2) dynamically monitoring the flows of importance. To realize the key design, we propose a key technique, leveraging Fermat's little theorem to devise a flexible data structure, namely FermatSketch. FermatSketch is dividable, additive, and subtractive, supporting the two kinds of tasks. We have implemented a ChameleMon prototype on a testbed with a Fat-tree topology. We conduct extensive experiments and the results show ChameleMon supports the two kinds of tasks with low memory/bandwidth overhead, and more importantly, it can automatically shift measurement attention as network state changes. Kaicheng Yang 0001, Yuhan Wu 0001, Ruijie Miao, Tong Yang 0003, Zirui Liu 0002, Zicang Xu, Yikai Zhao 0001, Hanglong Lv, Zhigang Ji, Gaogang Xie |
SIGCOMM | 9 |