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.
Task offloading in satellite networks, which involves distributing computational tasks among heterogeneous satellite nodes, is crucial for optimizing resource utilization and minimizing system latency. However, existing approaches such as static offloading strategies and heuristic-based offloading methods neglect dynamic topologies and uncertain conditions that hinder adaptability to sudden changes. Furthermore, current collaborative computing strategies inadequately address satellite platform heterogeneity and often overlook resource fluctuations, resulting in inefficient resource sharing and inflexible task scheduling. To address these issues, we propose a dynamic gradient descent-based task offloading method. This method proposes a collaborative optimization framework based on dynamic programming. By constructing delay optimization and resource efficiency models and integrating dynamic programming with value iteration techniques, the framework achieves real-time updates of system states and decision variables. Then, a distributed gradient descent algorithm combined with Gradient Surgery techniques is employed to optimize task offloading decisions and resource allocation schemes, ensuring a precise balance between delay minimization and resource utilization maximization in dynamic network environments. Experimental results demonstrate that the proposed method enhances the global optimizing result by at least 1.97%, enhances resource utilization rates by at least 3.91%, and also reduces the solution time by at least 191.91% in large-scale networks.