Demo Data from SIGIR 2026 / reviewers in the wild / expert
Shunlong Hao
dblp:440/2203
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 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 |
Internet architecture and protocols · 77% Network measurement and analytics · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols
IPv6 |
1.0 | 1 | 2026 | 6Massive: An Efficient IPv6 Large-Scale Target Generation Framework · INFOCOM 2026 |
Network measurement and analytics › internet measurement
address space scanning |
0.3 | 1 | 2026 | 6Massive: An Efficient IPv6 Large-Scale Target Generation Framework · INFOCOM 2026 |
Methods — techniques the papers use, named apart from their topics
target generation framework · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | 6Massive: An Efficient IPv6 Large-Scale Target Generation Framework
Shunlong Hao, Liancheng Zhang, Ruosi Cheng, Lanxin Cheng, Wenhao Xia, Jichang Wang |
INFOCOM | 1 |
| 2024 | 6DoubleTree: IPv6 Address Prediction Algorithm Based on Double Space TreeabstractThe discovery and management of network assets are crucial for network security. Faced with the vast IPv6 address space, traditional IP scanning methods are no longer applicable. Existing IPv6 address prediction algorithms suffer from low hit rates and insufficient sub-prefix coverage. Therefore, the paper proposes 6DoubleTree, an IPv6 address prediction algorithm that adopts a prefix and suffix partition tree structure. 6DoubleTree divides IPv6 addresses into prefix (high 64-bit) and suffix (low 64-bit) parts, and performs IPv6 address pattern mining and refinement on the BGP prefix space to generate IPv6 target addresses. Comparative experiments were conducted in a real IPv6 network environment, and experimental results on 3 IPv6 seed sets of 25k, 50k, and 0.1M showed that under the same budget conditions, compared to 7 algorithms based on seed address structural information, such as 6Forest and 6Graph, 6DoubleTree averagely increased the number of active addresses by 54.92% and the number of active /64 prefixes by 60.25%. Mingyue Ren, Liancheng Zhang, Shunlong Hao |
HPCC | 4 |