Multi-Service Distributed Routing Algorithm Based on Multi-Agent Reinforcement Learning
Satellite routing faces challenges such as highly dynamic changes in network topology and various user demands. To adapt to this dynamic environment and diverse services, we propose a Multi-Service distributed routing algorithm based on Multi-Agent Reinforcement Learning (MS-MARL). We schedule the priority of different types of service based on priority queuing. Then, we model the routing process as a partially observable Markov decision process and optimize routing decisions based on spherical distance and the QMIX model. The simulation results show that MS-MARL can reduce the packet loss rate by 11% and 38% for delay-sensitive services, and 5.5% and 33% for bandwidth-sensitive services, while maintaining end-to-end delay and throughput.
Authors
- Zhongsheng Zhai (ORCID: https://orcid.org/0000-0001-6420-1790)
- Chuanhong Liu (ORCID: https://orcid.org/0000-0001-9620-1816)
- Yang Yang (ORCID: https://orcid.org/0009-0001-5752-0264)
- Zihan Xu (ORCID: https://orcid.org/0009-0008-9669-476X)
Institutions
- Beijing University of Posts and Telecommunications (CN)
- System Equipment (China) (CN)
Publication Details
- Published
- 2025-06-20
- DOI
- https://doi.org/10.1109/dmcis65888.2025.11138372
- Primary Topic
- Wireless Sensor Networks and IoT
- Type
- article
- Field-Weighted Citation Impact
- 0.00