# An Efficient Satellite Resource Cooperative Scheduling Method on Spatial Information Networks
## 4 Resource Request Queue Reconstruction and Collaborative Scheduling Method
### Link Resource Competition Optimization  
As mentioned above, the spatial information network resource scheduling problem can be decomposed into the network link optimization and the network resource cooperative allocation. In this section, we focus on modeling and algorithm design for the network model link optimization problem, aiming to solve the high delay of data transmission and incomplete data caused by dynamic links changes in the process of time-varying network resource scheduling. In addition, it is commonly recognized that inter-satellite links in space information networks are dynamically changing, and the maximum amount of data that can be accommodated on the network changes continuously over time \(t\). Therefore, we need to calculate the maximum amount of data that can be accommodated on the current network before allocating satellite resources. Without exceeding the maximum capacity, we transmit the tasks \(r\) on each satellite to the satellite with free resources, thus reducing the resource request load on the original satellite. The Formula (3) can be constructed for the contention of inter-satellite link resources. It shows the time consumption of calculation, storage, or antenna switching delay within the satellite. As shown in Formula (3), the model describes the minimum time cost of interstellar link data transmission. Where \(U^{r}_{s}(t)f^{r}_{s}(t)L_{s,s^{\prime}}(t)\xi^{r}_{s}(t)\) denotes the time cost consumed for data transmission on the satellite link, \(\Phi\) denotes the waiting delay for data transmission over the inter-satellite link and the corner time sum of the antenna equipment. C1 indicates that once the link resource is occupied, it is not allowed by other jobs until the job transfer is finished or the visible time window disappears. The constraint is defined because the link resources between satellites are relatively precious, and we are only concerned with the contention of link resources. Therefore, if we want the task execution time to become shorter, link resource utilization needs to be maximized. Thus, frequent switching operations consume link resources while causing more severe time loss. \(C2-C10\) are the same with the Formula (2), C11 in \(\sum_{u\in V}f^{r}_{u,u}(t)<f^{r}_{u,v}(t)\) shows that the actual flow transmitted between satellites is less than the inter-satellite link capacity. \(l^{\min}_{s,s^{\prime}}\leqslant f^{r}_{u,v}(t)\leqslant l^{\max}_{s,s^{ \prime}}\) exhibits that the total flow to be transmitted between the satellites \(f^{r}_{u,v}(t)\) is greater than the minimum flow allowed to be transmitted \(l^{\min}_{s,s^{\prime}}\) and less than the maximum flow \(l^{\max}_{s,s^{\prime}}\) allowed to be transmitted on the inter-satellite, C12 denotes that the flow sent by the original satellite needs to be transmitted to the target satellite in its entirety. C13 indicates that the total flow transmitted on the space information network is less than what the satellite network is allowed to send. \[\min\sum_{t=1}^{\tau}\sum_{s\in S_{new}}\sum_{r\in R_{new}}\log\Bigl{(} U_{s}^{r}(t)f_{s}^{r}(t)L_{s,s^{\prime}}(t)\sigma_{\text{s}}^{r}(t)+\Phi \Bigr{)}\] \[s.t.\] \[C1:\sum_{r\in R_{new}}\xi_{\text{s}}^{r}(t)=1,\xi_{\text{s}}^{r} (t)\in\{0,1\},r\in R_{new},s\in S_{new},t\in\tau.\] \[C2:L_{s,s^{\prime}}(t)=1,\forall t\in\Bigl{\{}W_{s,s^{\prime}}^{ start},W_{s,s^{\prime}}^{end}\Bigr{\}},\] \[C3:\min_{s,s^{\prime}}\leqslant f_{s}^{r}(t)\leqslant l_{s,s^{ \prime}}^{max},\] \[C4:0<u_{s}^{r}(t)\leqslant\zeta,\] \[C5:b_{s}^{r}(t)\in\{0,1\},\] \[C6:\theta_{s}(r)-\theta_{s}(r^{\prime})=\gamma,\ \gamma>0, \tag{3}\] \[C7:s^{ant}\in N^{*},\] \[C8:L_{\text{s}}^{ant}\in N^{*},\] \[s.t.\]0 \[s.t.\]1 \[s.t.\]2 \[s.t.\]3 \[s.t.\]4  
Therefore, we mainly consider the problem of link utilization in the model (3). In the task execution process, the resource utilization rate of the inter-satellite link directly affects the overall resource scheduling time.