Adaptive Real-Time Transmission in Large-Scale Satellite Networks Through Software-Defined-Networking-Based Domain Clustering and Random Linear Network Coding

Shangpeng Wang, Chenyuan Zhang, Yuchen Wu, Limin Liu and Jun Long ()
Additional contact information
Shangpeng Wang: School of Computer Science and Engineering, Central South University, Changsha 410083, China
Chenyuan Zhang: School of Computer Science and Engineering, Central South University, Changsha 410083, China
Yuchen Wu: School of Computer Science and Engineering, Central South University, Changsha 410083, China
Limin Liu: School of Computer Science and Engineering, Central South University, Changsha 410083, China
Jun Long: School of Computer Science and Engineering, Central South University, Changsha 410083, China

Mathematics, 2025, vol. 13, issue 7, 1-36

Abstract: Network flow task management involves the efficient allocation and scheduling of data flow tasks within dynamic satellite networks, aiming to effectively address frequent changes in network topology and dynamic traffic fluctuations. Existing research primarily emphasizes traffic prediction and scheduling using spatiotemporal models and machine learning. However, these approaches often depend on extensive historical data for training, making real-time adaptation to rapidly changing network topologies and traffic patterns challenging in dynamic satellite environments. Additionally, their high computational complexity and slow convergence rates hinder their efficiency in large-scale networks. To address these issues, this paper proposes a collaborative optimization framework based on Coding Multi-Path Theory (CMPT). The framework utilizes a Nash bargaining game model to simulate resource competition among the different participants, ensuring fair resource distribution and load balancing. It also integrates real-time network state monitoring with optimization algorithms, within a multi-path scheduling strategy, enabling the dynamic selection of optimal transmission paths to accommodate frequent network topology changes and traffic variations. Experimental results indicate that the proposed method reduced resource allocation task execution time by at least 18.03% compared to traditional methods and enhanced task scheduling efficiency by at least 14.01%. Although CMPT exhibited a slightly higher task latency on certain small-scale datasets compared to some baseline algorithms, its performance remains exceptional in large-scale and high-dimensional scenarios.

Keywords: network flow; task scheduling; multi-path transmission; network coding; game theory (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/7/1069/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/7/1069/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:7:p:1069-:d:1620262

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().