ADAPTIVE REAL-TIME TRANSMISSION IN LARGE-SCALE SATELLITE NETWORKS THROUGH SOFTWARE-DEFINED-NETWORKING-BASED DOMAIN CLUSTERING AND RANDOM LINEAR NETWORK CODING

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

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

Blog Article

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 Bong Bowls 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 Spacecraft Model Kit higher task latency on certain small-scale datasets compared to some baseline algorithms, its performance remains exceptional in large-scale and high-dimensional scenarios.

Report this page