EDBT 2026 Demo / reviewers in the wild / expert
Qiaoyin Gan
dblp:398/8689
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 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
1 paper |
Routing and switching · 91% Network performance modeling · 9% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
adaptive routing |
0.9 | 1 | 2025 | Adaptive and Low-Cost Traffic Engineering: A Traffic Matrix Clustering Perspective · IEEE J. Sel. Areas Commun. 2025 |
Routing and switching › traffic engineering
routing optimization |
0.9 | 1 | 2025 | Adaptive and Low-Cost Traffic Engineering: A Traffic Matrix Clustering Perspective · IEEE J. Sel. Areas Commun. 2025 |
Routing and switching
traffic engineering |
0.9 | 1 | 2025 | Adaptive and Low-Cost Traffic Engineering: A Traffic Matrix Clustering Perspective · IEEE J. Sel. Areas Commun. 2025 |
Hardware accelerators and domain-specific architectures › network accelerator
SmartNIC |
0.9 | 1 | 2025 | SNARY: A High-Performance and Generic SmartNIC-accelerated Retrieval System · USENIX ATC 2025 |
Information retrieval
search engines |
0.3 | 1 | 2025 | SNARY: A High-Performance and Generic SmartNIC-accelerated Retrieval System · USENIX ATC 2025 |
Network performance modeling › traffic modeling
traffic matrix |
0.3 | 1 | 2025 | Adaptive and Low-Cost Traffic Engineering: A Traffic Matrix Clustering Perspective · IEEE J. Sel. Areas Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
SmartNIC offloading · 1.7machine learning classifier · 0.9clustering · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SNARY: A High-Performance and Generic SmartNIC-accelerated Retrieval System
Qiaoyin Gan, Hongtao Guan, Zhaohua Wang, Zhenyu Li 0001, Gaogang Xie |
USENIX ATC | 1 |
| 2025 | Adaptive and Low-Cost Traffic Engineering: A Traffic Matrix Clustering PerspectiveabstractTraffic engineering (TE) has attracted extensive attention over the years. Operators expect to design a TE scheme that accommodates traffic dynamics well and achieves good TE performance with little overhead. Some approaches like oblivious routing compute an optimal static routing based on a large traffic matrix (TM) range, which usually leads to much performance loss. Many approaches compute routing solutions based on one or a few representative TMs obtained from observed historical TMs. However, they may suffer from performance degradation for unexpected TMs and usually induce much overhead of system operating. In this paper, we propose ALTE, an adaptive and low-cost TE scheme based on TM classification. We develop a novel clustering algorithm to properly group a set of historical TMs into several clusters and compute a candidate routing solution for each TM cluster. A machine learning classifier is trained to infer the proper candidate routing solution online based on the features extracted from some easily measured statistics. We implement a system prototype of ALTE and do extensive simulations and experiments using both real and synthetic traffic traces. The results show that ALTE achieves near-optimal performance for dynamic traffic and introduces little overhead of routing updates. Nan Geng, Mingwei Xu 0001, Yuan Yang 0001, Enhuan Dong, Chenyi Liu, Qiaoyin Gan, Qing Li 0006 |
IEEE J. Sel. Areas Commun. | 7 |