Demo Data from EDBT 2026 / reviewers in the wild / expert
Anbang Pei
dblp:334/2106
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer 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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching › source routing
segment routing |
0.6 | 1 | 2022 | Behavior-decoupled Labeling Mechanism in Generalized SRv6 · ICNP 2022 |
Routing and switching › source routing › segment routing
SRv6 |
0.6 | 1 | 2022 | Behavior-decoupled Labeling Mechanism in Generalized SRv6 · ICNP 2022 |
Routing and switching
routing policy |
0.2 | 1 | 2022 | Behavior-decoupled Labeling Mechanism in Generalized SRv6 · ICNP 2022 |
Methods — techniques the papers use, named apart from their topics
mathematical optimization · 0.6LSTM · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Behavior-decoupled Labeling Mechanism in Generalized SRv6abstractIn this paper, we study the problem of compression efficiency of SRH (Segment Routing Header) in G-SRv6 (Generalized SRv6). We propose the Function-decoupled Segment Routing Mechanism (FDSRM) to optimize the SID list in SRH while ensuring that the routing policy decision would not be affected. FDSRM logically decouples the functions of SID/G-SID according to the function in routing decision and instruction indication. Based on FDSRM, we propose a mathematical optimization framework that leverages the LSTM neural network to optimize the SID allocation to adapt to future traffic. Simulation results indicate that FDSRM can improve the probability of SRH compression by 50.86%, and compress more than 24.50 bytes when the hop count is greater than 20. Weihong Wu, Anbang Pei, Tao Huang 0005 |
ICNP | 3 |