Xinyuan Li

Mr. Xinyuan Li

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 February 2025 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
YSYuqian Song
Yuqian Song
JZjingli zhou
jingli zhou
XLXinyuan Li
Xinyuan Li
JLJun Liu
Jun Liu
Packet routing in modern communication networks faces increasing challenges due to evolving network dynamics and stringent quality-of-service (QoS) requirements. Traditional rule-based and model-based routing methods, constrained by pre-defined rules and static network assumptions, often fail to address these complexities. This paper presents an experience-driven, model-free routing algorithm grounded in deep reinforcement learning (DRL), offering adaptive and efficient forwarding decisions. For practical deployment, we incorporate GraphTransformer networks into the DRL decision framework to enhance generalization under diverse and unseen network conditions. Specifically, we explore two element-level mapping paradigms, node-based and edge-based, to identify the optimal configuration. In addition, we design a hybrid action space that effectively incorporates domain-specific knowledge, thereby contributing to a more robust DRL agent in dynamic routing environments. Simulation results indicate that our proposed algorithms demonstrate significant robustness and generalization capabilities, revealing key principles for designing an optimal GNN-enhanced DRL-based routing algorithm.

24 January 2025 in Electronics
Verified
Journal Article
Open access
PDF file
XLXinyuan Li
Xinyuan Li
JLJunze Li
Junze Li
JZjingli zhou
jingli zhou
JLJun Liu
Jun Liu
Deep Reinforcement Learning (DRL) has demonstrated promising capabilities for routing optimization in Software-Defined Networks (SDNs). However, existing DRL-based routing algorithms are struggling to extract graph-structured information and constrained to a fixed topology, suffering from the lack of robustness. In this paper, we strengthen the advantages of Graph Neural Networks (GNNs) for DRL-based routing optimization and propose a novel algorithm named Graph Transformer Star Routing (GTSR) to enhance robustness against topology changes. GTSR utilizes the multi-agent architecture to enable each node to make routing decisions independently, and introduces a Graph Transformer to equip agents with the capabilities of handling topology changes. Furthermore, we carefully design a global message-passing mechanism with a virtual star node and a path-based readout method, enhancing the long-range perception of traffic and the detection of potential congestion for routing decision-making. Moreover, we construct a multi-agent cooperation mechanism to facilitate the learning of universal perceptual strategies and reduce the amount of computation. Extensive experiments on multiple real-world network topologies demonstrate that GTSR is capable of adapting to unseen topology changes without retraining and decreases end-to-end latency by at least 47% and packet loss rate by at least 10% compared to all baselines, highlighting strong robustness.