Demo Data from EDBT 2026 / reviewers in the wild / expert
Xianshi Su
dblp:371/4153
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0007-9601-5192ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 58% Internet of things and sensor networks · 42% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet of things and sensor networks › RFID systems
cardinality estimation |
1.0 | 1 | 2026 | Cardinality is Not Enough: Super Host Detection via Segmented Cardinality Estimation · WWW 2026 |
Network measurement and analytics › traffic measurement
flow measurement |
0.9 | 1 | 2025 | Aion: A Memory-Efficient Approach for Long-Term Periodic Flow Detection · ICNP 2025 |
Network measurement and analytics › sketch-based measurement
memory-efficient sketch |
0.3 | 1 | 2025 | Aion: A Memory-Efficient Approach for Long-Term Periodic Flow Detection · ICNP 2025 |
Network measurement and analytics
sketch-based measurement |
0.3 | 1 | 2025 | Aion: A Memory-Efficient Approach for Long-Term Periodic Flow Detection · ICNP 2025 |
Methods — techniques the papers use, named apart from their topics
sketch-based estimation · 2.0halved-segment hashing · 2.0sketch · 0.9sidon sequence · 0.9p4 · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Cardinality is Not Enough: Super Host Detection via Segmented Cardinality EstimationabstractAccurately detecting super host that establishes connections to a large number of distinct peers is significant for mitigating web attacks and ensuring high quality of web service. Existing sketch-based approaches estimate the number of distinct connections called flow cardinality according to full IP addresses, while ignoring the fact that a malicious or victim super host often communicates with hosts within the same subnet, resulting in high false positive rates and low accuracy. Though hierarchical-structure based approaches could capture flow cardinality in subnet, they inherently suffer from high memory usage. To address these limitations, we propose SegSketch, a segmented cardinality estimation approach that employs a lightweight halved-segment hashing strategy to infer common prefix lengths of IP addresses, and estimates cardinality within subnet to enhance detection accuracy under constrained memory size. Experiments driven by real-world traces demonstrate that, SegSketch improves F1-Score by up to 8.04× compared to state-of-the-art solutions, particularly under small memory budgets. Jiawei Huang 0001, Xianshi Su, Weihe Li, Qichen Su, Jin Ye 0003, Wanchun Jiang, Jianxin Wang 0001 |
WWW | 3 |
| 2026 | Intrusion detection for low-altitude wireless networks: Diffusion-enhanced spatiotemporal graph network with dual self-attention
Zijian Li 0007, Xianshi Su, Munan Li, Tony Q. S. Quek |
Comput. Networks | 3 |
| 2025 | Aion: A Memory-Efficient Approach for Long-Term Periodic Flow DetectionabstractSketch-based measurement approaches have recently become a promising solution for detecting periodic flows. However, current sketch approaches struggle to achieve accurate detection of periodic flows due to their short-sighted record of the flow arrival information. Recording the long-term information of flow arrivals could mitigate this issue, while the large memory consumption will hurt the detection accuracy. Consequently, achieving a satisfactory trade-off between memory efficiency and detection accuracy remains a tough challenge. To address this issue, we propose Aion for periodic flow detection. Specifically, Aion uses the Sidon sequence to compress historical flow arrival information in multiple time windows into very small size. Based on the periodicity information from successive time windows, Aion updates the estimated frequencies of periodic flows and promptly evicts non-periodic ones to enable accurate detection of frequent periodic flows. We implement Aion on a P4-based testbed and demonstrate that it achieves superior resource efficiency compared to state-of-the-art approaches. Trace-driven evaluations show that Aion improves F1-Score by up to 9.88×, particularly under small memory conditions. Jiawei Huang 0001, Xianshi Su, Yijun Li 0002, Sitan Li |
ICNP | 3 |
| 2025 | Bandwidth Prediction Within Playback-Time of Buffer Duration Based on Frame-Level Stable Segment for Live Streaming
Xianshi Su, Wanchun Jiang, Danfeng Shan |
WASA (2) | 2 |