Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fanxuan Sun

dblp:439/4071 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—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
Vehicular, aerial and satellite networks · 50% Routing and switching · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › routing
distributed routing
1.012026
TRACE: A Graph-Constrained Transformer for Communication-Efficient Distributed Routing in LEO Constellations · IEEE Trans. Commun. 2026
Vehicular, aerial and satellite networks
satellite communication
1.012026
TRACE: A Graph-Constrained Transformer for Communication-Efficient Distributed Routing in LEO Constellations · IEEE Trans. Commun. 2026

Methods — techniques the papers use, named apart from their topics

self-distillation · 1.0monte carlo episodes · 1.0graph-constrained transformer · 1.0
YearPublicationVenuePosition
2026 TRACE: A Graph-Constrained Transformer for Communication-Efficient Distributed Routing in LEO Constellations
abstract
Large-scale Low Earth Orbit (LEO) constellations often experience high node failure rates caused by dynamic environmental factors (random failures), such as satellite maneuvers, or by cyber or physical attacks on critical nodes (targeted attacks), which pose unique challenges for routing optimization. Traditional algorithms such as Dijkstra suffer from limited parallel scalability on GPUs due to irregular neighbor distributions, while deep learning methods lack generalization ability. To address these challenges, we propose TRACE (Topology-aware Routing via Adjacent-Constraint Encoding), a graph-constrained Transformer architecture equipped with a cascaded multi-head attention decoder for distributed dynamic routing in LEO domains. To improve algorithm throughput and resilience against random failures and targeted attacks, we further design NFD (Navigator–Follower Distillation), a self-distillation framework which enables each agent to learn routing policies from Monte Carlo episodes. Furthermore, a hierarchical distributed routing architecture is developed to extend the proposed method to multi-domain scenarios. Simulation results demonstrate that TRACE with NFD achieves near-optimal routing accuracy with controllable inter-domain errors, while significantly improving throughput compared with mainstream routing algorithms.
Qiuchao Dai, Zhongyuan Jiang, Fanxuan Sun, Xinghua Li 0001, Jianfeng Ma 0001
IEEE Trans. Commun.3