CN113709876B

CN113709876B - Satellite service resource allocation method and electronic equipment

Info

Publication number: CN113709876B
Application number: CN202110775432.XA
Authority: CN
Inventors: 赵永利; 李林; 刘一恺; 何芯逸; 王伟; 郁小松; 张�杰
Original assignee: Beijing University of Posts and Telecommunications
Current assignee: Beijing University of Posts and Telecommunications
Priority date: 2021-07-08
Filing date: 2021-07-08
Publication date: 2023-06-20
Anticipated expiration: 2041-07-08
Also published as: CN113709876A; AU2021104939A4

Abstract

The disclosure provides a satellite service resource allocation method and electronic equipment, wherein the method in an uplink comprises the following steps: acquiring uplink service flow to be allocated reaching an uplink target gateway station; determining an uplink between an uplink target gateway station and a downlink feed satellite according to topology information of the whole network node; constructing an uplink residual resource matrix based on the connection relation of each node in the uplink and the residual resources among each connected node in the uplink; determining at least one uplink service path of an uplink target gateway station reaching a downlink feed satellite according to the uplink connection path; and determining the allocable residual resources corresponding to at least one uplink service path based on the uplink residual resource matrix, and allocating resources for the uplink service to be allocated, wherein the downlink is similar to the uplink. And allocating resources for the corresponding service according to the corresponding residual resource matrix, effectively utilizing link resources among nodes, improving the transmission efficiency of the service and reducing the service accumulation.

Description

Satellite service resource allocation method and electronic equipment

Technical Field

The disclosure relates to the technical field of satellite data transmission, and in particular relates to a satellite service resource allocation method and electronic equipment.

Background

The satellite communication has important application prospect, is an indispensable important component in celestial body integrated information network construction, and plays an important role in information technology, space science exploration and national defense safety. The satellite network has global visibility and bandwidth allocation capability, can bear services such as voice, data, video and broadband multimedia, and the rapid development of the services brings about the multiple increase of data traffic, and has higher requirements on the bandwidth utilization rate of satellite or satellite-to-ground links of the satellite network.

When multiple types of service requests are forwarded through the satellite network in the future, the satellite network is in face of the demands of service convergence and flow surge, and service accumulation is caused because of limited satellite bandwidth resources, the existing service transmission scheme only considers that service transmission is performed under the condition of sufficient bandwidth resources, and the service resource allocation mode is low in efficiency and cannot fully utilize the resources of the satellite network.

Disclosure of Invention

In view of the above, the present disclosure aims to provide a satellite service resource allocation method and an electronic device, which can solve or partially solve the above technical problems.

Based on the above object, a first aspect of the present disclosure provides a satellite service resource allocation method, including:

Acquiring uplink service flow to be allocated reaching an uplink target gateway station;

determining an uplink between the uplink target gateway station and a downlink feed satellite according to topology information of a full network node, wherein the full network node comprises: each gateway node and each satellite node;

constructing an uplink residual resource matrix based on the connection relation of each node in the uplink and the residual resources among each connected node in the uplink;

determining at least one uplink service path of the uplink target gateway station reaching a downlink feed satellite according to the uplink connection path;

and determining the allocable residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix, and performing resource allocation for the uplink service to be allocated.

A second aspect of the present disclosure provides a satellite service resource allocation method, including:

acquiring downlink service flow to be distributed reaching a downlink feed satellite;

determining a downlink between the downlink feed satellite and a downlink target gateway station according to topology information of the whole network node;

constructing a downlink residual resource matrix based on the connection relation of each node in the downlink and the residual resources among each connected node in the downlink;

Determining at least one downlink service path of the downlink feed satellite reaching a downlink target gateway station according to the downlink connection path;

and determining the allocable residual resources corresponding to the at least one downlink service path based on the downlink residual resource matrix, and performing resource allocation for the downlink service to be allocated.

A third aspect of the present disclosure provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of the first or second aspect when executing the program.

From the above, it can be seen that the satellite service resource allocation method and the electronic device provided by the present disclosure can construct a corresponding uplink residual resource matrix or a corresponding downlink residual resource matrix according to the residual resources when uplink service transmission or downlink service transmission is performed in the nodes of the whole network, so that resource allocation can be performed for the corresponding uplink service or downlink service directly according to the uplink residual resource matrix or the downlink residual resource matrix, so that the link resources between the nodes in the network are effectively utilized, the service transmission efficiency can be improved, and the service accumulation can be reduced while the residual resources are fully utilized.

Drawings

In order to more clearly illustrate the technical solutions of the present disclosure or related art, the drawings required for the embodiments or related art description will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.

FIG. 1 is a flow chart of a satellite service resource allocation method according to one embodiment of the present disclosure;

FIG. 2 is a flow chart of a satellite service resource allocation method according to another embodiment of the present disclosure;

fig. 3 is a schematic diagram of construction of an uplink residual resource matrix according to an embodiment of the disclosure;

fig. 4 is a schematic distribution diagram of service flows with the same quality of service priority according to an embodiment of the disclosure;

fig. 5 is a schematic distribution diagram of service flows with different service quality priorities according to an embodiment of the disclosure;

fig. 6A is a path transmission schematic diagram of path 1 according to an embodiment of the present disclosure;

FIG. 6B is a path transmission schematic of path 2 according to an embodiment of the present disclosure;

FIG. 6C is a schematic diagram of path transmission for path 3 according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of an uplink path sequence ordering according to an embodiment of the disclosure;

Fig. 8 is a schematic diagram of path selection and uplink residual resource matrix update according to an embodiment of the disclosure;

fig. 9 is a schematic diagram of an updated uplink path sequence according to an embodiment of the disclosure;

fig. 10 is a schematic diagram of downlink resource allocation according to an embodiment of the present disclosure;

FIG. 11 is a schematic diagram of a satellite service resource allocation system according to one embodiment of the present disclosure;

FIG. 12 is a schematic diagram of a satellite service resource distribution system according to another embodiment of the present disclosure;

fig. 13 is a schematic diagram of an electronic device according to an embodiment of the disclosure.

Detailed Description

For the purposes of promoting an understanding of the principles and advantages of the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same.

It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present disclosure should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in embodiments of the present disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect.

1. Satellite laser networking

The whole-network satellite forms a satellite laser networking, and compared with microwave communication, laser communication has unique advantages, such as higher laser frequency than microwave, so that the communication data rate of laser is extremely high, which can reach tens of gigabits per second or higher, and meanwhile, the volume, the quality and the power consumption of a laser terminal are very small. Therefore, when the requirement on the data transmission rate of the link is high, for example, the high-resolution earth observation image data acquired by satellites in space are required to be transmitted to the command terminal in real time in case of serious earthquake disasters or war, and the advantages of the laser communication link are reflected. Meanwhile, the laser inter-satellite link and the satellite-ground link have good anti-interference and confidentiality, and the ground station can be reduced by using the relay satellite, so that the space laser communication is an important development direction of future space communication. However, satellite laser networking has a large bandwidth, and simultaneously, the amount in the ground network is rapidly increased, and the problems of low link utilization rate in the networking and the like can cause a large burden on the satellite laser networking network.

2. Satellite traffic classification

Satellite fixed communication service: video distribution, broadband network, internet service, satellite news collection and other services, and in recent years, the services are rapidly growing;

Satellite mobile communication service: broadband services are rapidly evolving and global coverage of personal communications demands is increasing;

satellite broadcast communication service: a television receiving terminal is adopted to receive television broadcasting service and sound broadcasting service, and the demand in remote areas is larger;

satellite tracking and data relay services: the system has the advantages of full-track continuous coverage, all-weather data collection, high-speed data transmission capability, high stability and increased demands in the fields of military communication and the like;

satellite mobile broadcast service: miniaturization and mobility of the receiving end bring about an increase in the number of users.

3. Satellite snapshot routing technique

The snapshot technology can acquire the topology condition of the satellite network, and the service transmission interruption caused by the inter-satellite link interruption can be effectively avoided by calculating the route through the stored snapshot. The snapshot approximation process is to divide the dynamic topology of a satellite network into a series of loops of topology snapshots, by taking advantage of the predictability and periodicity of satellite motion, the network topology within each snapshot being considered to be fixed. And uploading the pre-calculated routing table of each snapshot to the satellite node by the snapshot routing algorithm, and updating the routing table by the satellite node at the snapshot switching moment. However, the snapshot routing algorithm has the defects of frequent switching of routes, low real-time performance and the like.

4. Traffic Engineering (TE)

Traffic engineering is in fact a set of tools and methods that extract the best service from a given infrastructure, both in the case of normal and failure of network equipment and transmission lines. That is, it optimizes the installed resources. In fact, it is a complementary and perfecting measure to network engineering or network planning. Traffic engineering attempts to have the actual network traffic exist in the physical network in an optimal manner.

The satellite service resource allocation method provided by the present disclosure, as shown in fig. 1, includes:

step 100, obtaining the uplink service flow to be distributed reaching the uplink target gateway station.

In the step, each time window of the uplink target gateway station belongs to an asymmetric time window, the uplink service flow request to be allocated arrives uniformly in the corresponding time window, and when the time windows are switched, the transmission of the uplink service flow to be allocated is interrupted.

Step 200, determining an uplink between an uplink target gateway station and a downlink feed satellite according to topology information of a whole network node, wherein the whole network node comprises: each gateway node and each satellite node.

And 300, constructing an uplink residual resource matrix based on the connection relation of each node in the uplink and the residual resources among each connected node in the uplink.

Step 400, determining at least one uplink traffic path for the uplink target gateway station to reach the downlink feed satellite according to the uplink connection path.

And 500, determining the allocable residual resources corresponding to at least one uplink service path based on the uplink residual resource matrix, and allocating the resources for the uplink service to be allocated.

In the above step, the topology information of the nodes of the whole network is read at the initial time of the time window of the uplink target gateway station, and the uplink between the uplink target gateway station and the downlink feed satellite is passed through the topology information. And then, arranging an uplink residual resource matrix according to the residual resources connected with each other among the nodes, the positions and the corresponding numbers of all the nodes.

And then, determining n uplink service paths for the uplink target gateway station to reach the downlink feed satellite, and determining the minimum residual resources among all the connection nodes in each uplink service path according to the uplink residual resource matrix. Since the transmission capacity of a traffic path is determined by the minimum remaining resources in the satellite link, the minimum remaining resources are considered as allocatable remaining resources for the uplink traffic path. Therefore, the resource allocation can be carried out on the uplink service flow to be allocated according to the allocable residual resources of each uplink service path.

Through the scheme, the corresponding uplink residual resource matrix can be constructed according to the residual resources in the whole network node when uplink service transmission is performed, so that resource allocation can be performed for the corresponding uplink service directly according to the uplink residual resource matrix, the link resources among all nodes in the network can be effectively utilized, the service transmission efficiency can be improved, and the residual resources are fully utilized while service accumulation is reduced.

In some embodiments, the specific construction process of the uplink residual resource matrix includes:

and step A, determining transmission data of a current time window among all the connecting nodes in the uplink, and calculating uplink residual resources among all the connecting nodes in the uplink by using the transmission data of the current time window.

The method comprises the following steps:

step A1, determining the remaining time t of the current time window between the connection nodes in the uplink and the transmission rate v of the current time window.

And step A2, determining the link residual bandwidth b between each connected node in the uplink.

And step A3, calculating uplink residual resources among all the connection nodes in the uplink according to a formula min (t x v, b).

And B, constructing an uplink residual resource matrix according to the connection relation of each node in the uplink and uplink residual resources among each connection node in the uplink.

In the above steps, the remaining time, the transmission rate and the remaining bandwidth of the time window are comprehensively considered to measure the uplink remaining resources during satellite service transmission, and the uplink remaining resource matrix is constructed based on the uplink remaining resources, so that the effective utilization of the link resources can be realized, and meanwhile, the possibility of interruption of service traffic transmission is avoided.

By the scheme, the constructed uplink residual resource matrix not only can embody the connection relation among all nodes of the uplink, but also can embody the residual resources of links among the nodes, so that the residual resources among all nodes in the uplink can be quickly known according to the uplink residual resource matrix, and the corresponding service flow is quickly allocated with resources, so that the congestion reduction transmission rate of the service is slow, and the situation of deferred accumulation of the service is reduced.

In some embodiments, step 400 specifically includes: and (3) finding at least one uplink service path of the uplink target gateway station reaching the downlink feed satellite from the connection path of the uplink by using a KSP algorithm, and storing the at least one uplink service path into an uplink path sequence.

The step 500 specifically includes:

step 510, obtaining at least one uplink residual resource corresponding to each uplink service path in the uplink path sequence from the uplink residual resource matrix, and determining an allocable residual resource of each uplink service path.

Step 520, sorting at least one uplink traffic path according to the value of the allocable residual resources, and deleting the uplink traffic path with the allocable residual resources of 0 from the uplink path sequence.

And step 530, performing resource allocation for the uplink service flow to be allocated based on the ordering sequence of at least one uplink service path in the uplink path sequence and the corresponding allocable residual resources.

First, a KSP (k-shortest paths) algorithm is used to find k shortest paths between an uplink target gateway station and a downlink feed satellite, and the k value is limited by service tolerance delay (k generally takes a value of 3-4). The resulting k paths are then placed in an uplink traffic path sequence and ordered (from small to large) by the smallest remaining link resources in the path.

And then, selecting a first path from the path sequence, if the condition that the link residual resource is 0 exists in the path, removing the path, and repeating the path selecting operation until the condition that the link resource is 0 does not exist in the path. And taking the path in the last uplink service path sequence as an allocable resource.

Through the scheme, the KSP algorithm can be utilized to search the path, the path capable of carrying out service transmission can be found more accurately and rapidly, and the condition that the residual resources in the found path are 0 is deleted, so that the residual resources corresponding to the uplink service path with the residual resources not being 0 can be allocated, and the uplink service path can be utilized to carry out service transmission rapidly.

In the related art, the lack of an efficient service resource allocation method in a satellite laser network results in low service transmission efficiency and link utilization rate, and most of service resource allocation methods do not consider the problems of inconsistent uplink and downlink time windows and service allocation caused by satellite dynamic switching, so that efficient and reliable service transmission is difficult to realize. Because the satellite network topology changes periodically along with the time, the satellite-to-earth links of the satellite are continuously disassembled and built along with the movement of the satellite, and the distribution method in the related art cannot adapt to the dynamic property of the satellite, so that the service transmission rate and the link utilization rate of the satellite network service transmission cannot be improved.

In some embodiments, the uplink traffic to be allocated includes: the current uplink service flow to be allocated of the current time window of the uplink target gateway station and/or the residual uplink service flow to be allocated of the last time window of the uplink target gateway station.

Based on the foregoing, step 530 specifically includes:

and 531, determining the corresponding priority for the current uplink service flow to be allocated and/or the residual uplink service flow to be allocated.

And step 532, sequentially selecting corresponding target uplink service paths from the uplink path sequence according to the sorting order, and distributing the allocable residual resources corresponding to the target uplink service paths according to the current uplink service flow to be distributed and/or the priority of the residual uplink service flow to be distributed.

And 533, deleting the allocated target uplink service path from the uplink path sequence, and updating the uplink residual resource matrix.

And taking the minimum value of the residual resources among all nodes in the uplink as the allocable resources of the target uplink service path, dividing the allocable resources of the target uplink service path according to the corresponding priority, and preferentially allocating the allocable resources of the target uplink service path to the service flow with high priority. After allocation is complete, the path is removed from the sequence of upstream traffic paths. And updating the link residual resources among all nodes in the target uplink service path in the uplink residual resource matrix according to the occupied broadband value of the service flow with high allocated priority level and the satellite related number on the target uplink service path.

And updating the allocable residual resources corresponding to the residual uplink service paths in the uplink path sequence based on the updated uplink residual resource matrix.

By the scheme, the corresponding priority is set for the remaining uplink service flow to be allocated and/or the current uplink service flow to be allocated, so that resource allocation processing is performed according to the ordering condition of the priority, firstly, resources are allocated with high priority, then resources are allocated with low priority, and the resource allocation is performed according to the priority, so that the service flows needing to be sent preferentially can be ensured to be allocated resources in time, and the service quality is improved.

In some embodiments, step 531 specifically includes:

in step 5311, a corresponding first distribution priority value is set for the remaining uplink traffic to be distributed, and a corresponding second distribution priority value is set for the current uplink traffic to be distributed.

In step 5312, a corresponding first service priority value is set according to the service quality of the remaining uplink service flows to be allocated, and a corresponding second service priority value is set according to the service quality of the current uplink service flows to be allocated.

In step 5313, a first priority value=λ first allocation priority value+μ first service priority value of the remaining uplink traffic to be allocated and a second priority value=λ second allocation priority value+μ second service priority value of the current uplink traffic to be allocated are determined, wherein 0< λ+μ <1.

In the above steps, the remaining uplink traffic to be allocated in the previous time window is classified, the allocation priority is set, the allocation priority of the remaining uplink traffic to be allocated is set to F-PRI1, and the allocation priority of the current uplink traffic to be allocated is set to F-PRI2, so as to ensure that the remaining traffic allocation request in the previous time window can be allocated resources in time and transmitted to the satellite network.

And secondly, classifying all the uplink service flows to be allocated according to the service quality, and setting the service quality priority of the uplink service flows. The service priority of the real-time traffic is set as QOS-PRI1, and the service priority of the non-real-time traffic is set as QOS-PRI2, because the non-real-time traffic can tolerate a certain delay for transmission. Finally, the PRI=lambda F-PRIx+mu QOS-PRIx is calculated to integrate the two priorities, the priorities of the residual uplink service flow to be allocated and the current uplink service flow to be allocated are calculated according to the proportion (0 < lambda+mu < 1), the priority of the residual uplink service flow to be allocated and the current uplink service flow to be allocated are set, and the residual service flow to be allocated and/or the current service flow to be allocated are ordered according to the sequence of the first priority value and the second priority value obtained by calculation.

At least one of the remaining uplink service flows to be allocated is included, at least one of the current uplink service flows to be allocated is included, at least one of the first priority values is calculated correspondingly, and at least one of the second priority values is calculated correspondingly. And therefore, when the sorting is performed, the at least one first priority value and the at least one second priority value are sorted, and then the resource allocation is performed according to the sorting order according to the sorting result.

By the scheme, the corresponding priority is set for the residual uplink service flow to be allocated and/or the current uplink service flow to be allocated, so that resource allocation processing is carried out according to the ordering condition of the priority, and the allocated resource with high priority is allocated firstly and then the allocated resource with low priority is allocated, so that the residual service flow of the last time window can be ensured to be allocated timely, real-time service with strict service quality requirements can be ensured to be allocated timely, and further the service quality is ensured.

In some embodiments, step 530 further comprises:

in step 534, in response to determining that there is currently an uplink traffic to be allocated and/or there is still an unallocated uplink traffic in the remaining uplink traffic to be allocated, allocating resources for the unallocated uplink traffic according to the ordering order of the remaining uplink traffic paths of the uplink path sequence and the allocable remaining resources corresponding to the remaining uplink traffic paths, and repeating the process until no uplink traffic paths are allocated in the uplink path sequence or all the unallocated uplink traffic is allocated.

In the step, after the allocation of the allocable residual resources of one uplink service path is completed each time, whether the current uplink service flow to be allocated and/or the residual uplink service flow to be allocated still exist or not is judged.

And if so, allocating the uplink service traffic according to the priority of the unallocated uplink service traffic according to the allocable residual resources corresponding to the residual uplink service paths in the updated uplink path sequence until no uplink service paths exist in the uplink path sequence or the unallocated uplink service traffic is completely allocated.

Otherwise, the complete allocation is proved, the traffic flow transmission is carried out according to the resource allocation condition, and the downlink allocation process is continued, and the arrival of the next time window of the uplink is waited.

And/or the number of the groups of groups,

step 535, in response to determining that there is no uplink traffic path in the uplink path sequence, the current uplink traffic to be allocated and/or the remaining uplink traffic to be allocated still have unallocated uplink traffic, sending the unallocated uplink traffic to the adjacent uplink gateway station of the target uplink gateway station for resource allocation, and/or allocating the unallocated uplink traffic to the next time window of the target uplink gateway station for resource allocation.

In this step, when no uplink traffic path is available for allocation in the uplink path sequence, if there is no uplink traffic to be allocated currently and/or there is no uplink traffic to be allocated remaining. And forwarding the service flow which needs to be transmitted in real time in the unassigned uplink service flow to an adjacent uplink gateway station for uploading, and dividing the rest of the service flow which is transmitted in non-real time into the next time window to wait for assignment.

In the process of carrying out uplink traffic distribution and transmission in the current time window, the distribution priority of the traffic divided into the next time window is set to be the lowest, so that the uplink traffic to be distributed which is already divided in the current time window is ensured to be transmitted preferentially. The traffic divided into the next time window belongs to the remaining uplink traffic to be allocated after entering the next time window, so that the distribution priority is increased after entering the next time window. Thus, the priority division of the traffic under the condition of multiple accumulation is guaranteed, and the highest distribution priority of the traffic in the last time window is always guaranteed.

Based on the satellite service resource allocation method in the uplink described in the above embodiment, the satellite service resource allocation method of the present embodiment is applied to downlink service traffic transmission. The satellite service resource allocation method of the present embodiment may be completed based on the foregoing embodiments, and the beneficial effects of the method described in the foregoing embodiments are correspondingly provided, which is not repeated herein.

As shown in fig. 2, the satellite service resource allocation method of the present embodiment includes the following steps:

and 100', acquiring the downlink service flow to be distributed reaching the downlink feed satellite.

In the step, each time window of the downlink feed satellite belongs to an asymmetric time window, the downlink service flow request to be distributed uniformly arrives in the corresponding time window, and when the time windows are switched, the transmission of the downlink service flow to be distributed is interrupted.

And 200', determining a downlink between the downlink feed satellite and the downlink target gateway station according to the topology information of the nodes of the whole network. Wherein, the full network node includes: each gateway node and each satellite node.

And 300', constructing a downlink residual resource matrix based on the connection relation of each node in the downlink and the residual resources between each connected node in the downlink.

The specific construction process of the downlink residual resource matrix comprises the following steps:

and step A', determining transmission data of a current time window among all the connecting nodes in the downlink, and calculating downlink residual resources among all the connecting nodes in the downlink by using the transmission data of the current time window.

The method comprises the following steps:

Step A1', determining the remaining time t of the current time window between the connected nodes in the downlink and the transmission rate v of the current time window.

Step A2', determining the link residual bandwidth b between the individual connected nodes in the downlink.

Step A3', calculating the downlink residual resources between the connection nodes in the downlink according to the formula min (t x v, b).

And B', constructing a downlink residual resource matrix according to the connection relation of each node in the downlink and the downlink residual resources among each connection node in the downlink.

Step 400' determines at least one downlink traffic path for the downlink feed satellite to reach the downlink target gateway station based on the downlink connection path.

Specifically, a KSP algorithm is utilized to find at least one downlink service path from a downlink connection path to a downlink feed satellite, and the at least one downlink service path is stored in a downlink path sequence.

And 500', determining the allocable residual resources corresponding to at least one downlink service path based on the downlink residual resource matrix, and allocating the resources for the downlink service to be allocated.

Through the scheme, the corresponding downlink residual resource matrix can be constructed according to the residual resources in the whole network node when downlink service transmission is performed, so that resource allocation can be performed for the corresponding downlink service directly according to the downlink residual resource matrix, the link resources among all nodes in the network can be effectively utilized, the service transmission efficiency can be improved, and the residual resources are fully utilized while service accumulation is reduced.

In some embodiments, step 500' specifically includes:

and step 510', storing at least one downlink service path into the downlink path sequence, and sequencing according to the downlink residual resources corresponding to the at least one downlink service path.

The method comprises the following steps:

step 511' obtains at least one downlink residual resource corresponding to each downlink traffic path in the downlink path sequence from the downlink residual resource matrix, and determines an allocable residual resource for each downlink traffic path.

Step 512', sorting at least one downlink service path according to the value of the allocable residual resources, and deleting the downlink service path with the allocable residual resources of 0 from the downlink path sequence.

Step 513', performing resource allocation for the downlink traffic to be allocated based on the ordering order of at least one downlink traffic path in the downlink path sequence and the corresponding allocable remaining resources.

And step 520', selecting a target downlink service path from the downlink path sequence according to the sorting order, and carrying out resource allocation for the downlink service flow to be allocated according to the allocable residual resources corresponding to the target downlink service path.

The downlink service flow to be allocated includes: the current downlink service flow to be allocated of the current time window of the downlink target gateway station and/or the residual downlink service flow to be allocated of the last time window of the downlink target gateway station.

Based on the foregoing, step 520' specifically includes:

step 521', determining the corresponding priority for the current downlink traffic to be allocated and/or the remaining downlink traffic to be allocated.

And 522', sequentially selecting corresponding target downlink service paths from the downlink path sequence according to the sorting order, and distributing the allocable residual resources corresponding to the target downlink service paths according to the current downlink service flow to be distributed and/or the priority of the residual downlink service flow to be distributed.

And step 523', deleting the allocated target downlink service path from the downlink path sequence, and updating the downlink residual resource matrix.

And taking the minimum value of the residual resources among all nodes in the downlink as the allocable resources of the target downlink service path, dividing the allocable resources of the target downlink service path according to the corresponding priority, and preferentially allocating the allocable resources of the target downlink service path to the service flow with high priority. After allocation is completed, the path is removed from the sequence of downlink traffic paths. And updating the link residual resources among all nodes in the target downlink service path in the downlink residual resource matrix according to the occupied broadband value of the service flow with high assigned priority level and the satellite related number on the target downlink service path.

By the scheme, the corresponding priority is set for the residual downlink service flow to be allocated and/or the current downlink service flow to be allocated, so that resource allocation processing is performed according to the ordering condition of the priority, firstly, resources are allocated with high priority, then resources are allocated with low priority, and the resource allocation is performed according to the priority, so that the service flows needing to be sent preferentially can be ensured to be allocated resources in time, and the service quality is improved.

Step 521' specifically includes:

and 5211', setting a corresponding third distribution priority value for the rest downlink service flow to be distributed, and setting a corresponding fourth distribution priority value for the current downlink service flow to be distributed.

In step 5212', a corresponding third service priority value is set according to the service quality of the remaining downlink service flows to be allocated, and a corresponding fourth service priority value is set according to the service quality of the current downlink service flows to be allocated.

Step 5213' determining a third priority value=λ third distribution priority value+μ third service priority value for remaining downstream traffic to be distributed and a fourth priority value=λ fourth distribution priority value+μ fourth service priority value for current downstream traffic to be distributed, wherein 0< λ+μ <1.

And step 530', deleting the allocated target downlink service path from the downlink path sequence, and updating the downlink residual resource matrix.

The method comprises the steps of,

step 540', in response to determining that there is no downlink traffic flow to be allocated, allocating resources for the downlink traffic flow according to the ordering sequence of the remaining downlink traffic paths of the downlink path sequence and the allocable remaining resources corresponding to the remaining downlink traffic paths, and repeating the process until no downlink traffic paths are available in the downlink path sequence or all the unallocated downlink traffic flows are allocated.

The method comprises the steps of,

step 550', in response to determining that there is no downlink service path in the downlink path sequence, the downlink to-be-allocated service flow has no downlink service flow, transmitting the unallocated downlink service flow to the downlink feed satellite of the adjacent downlink gateway station of the downlink target gateway station for resource allocation, and/or allocating the unallocated downlink service flow to the next time window of the downlink feed satellite for resource allocation.

In the above scheme, when the traffic flow reaches the downlink feed satellite, the downlink residual resource matrix is updated, k downlink traffic paths (where the ground downlink gateway station may be connected to multiple feed satellites) are found, the k downlink traffic paths are put into the downlink path sequence, and the k downlink traffic paths are ordered (from large to small) according to the downlink residual resources.

And selecting the downlink service path with the largest residual link resources as a target downlink service path, and performing flow distribution on downlink service flow to be distributed at the downlink feed satellite according to the residual link resources of the target downlink service path. After the allocation is completed, judging whether the downlink service flow to be allocated is completely allocated or not. If not, the link resource of the downlink feed satellite is insufficient (the residual quantity of the resource in the time window can not meet the traffic distribution requirement on the feed satellite), the feed satellite which is not distributed with the downlink traffic flow and enters the next time window is divided to carry out resource distribution, or the feed satellite of the adjacent downlink gateway station of the destination downlink gateway station (the next downlink gateway station which is connected with the destination downlink gateway station) is distributed with the resource.

The uplink and downlink resource allocation procedure is described in detail in one embodiment as follows:

at t ₀ And (3) reading topology information of the whole network at any time, updating a link part residual time window of an uplink satellite and calculating satellite residual resources, wherein the residual resources from a No.1 gateway station to a No.2 user satellite are 50% currently as shown on the left side of the figure 3, and then updating an uplink residual resource matrix as shown on the right side of the figure 3. And placing the calculation result into an uplink residual resource matrix, wherein the uplink residual resource matrix is a symmetric matrix, and (1, 2) (2, 1) refers to a bidirectional communication link between two nodes.

2. Service at t ₀ To t ₁ The time window (i.e., the current time window) is reached uniformly.

When the quality of service priority of the last time window remaining traffic (i.e., remaining traffic to be allocated for the last time window) and the current time window even arriving traffic (i.e., current traffic to be allocated for the current time window) are the same, i.e., QOS-pri1=qos-pri2, the PRI (priority) depends only on the distribution priority, i.e., F-PRI1>F-PRI2. So at t ₀ To t ₁ The priority (i.e., first priority value) of the remaining traffic in the previous time window is pri=λf-pri1+μqos-PRI1, and the priority (i.e., second priority value) pri=λf-pri2+μqos-PRI2 of the evenly arriving traffic in the present time window. As shown in fig. 4, the PRI is ordered in sequence, the first pri.1 is the remaining traffic in the last time window, the second pri.2 is the uniform arrival traffic in the present time window, and the priority is at t ₀ To t ₁ Allocating traffic of pri.1 and partial streams of pri.2 within a time windowQuantity, the remaining flow of PRI.2 is distributed to t ₁ To t ₂ Time window, such that at t ₁ To t ₂ And when the time window arrives, the priorities of all the parts are reassigned, and the assignment is carried out according to the sequence of the corresponding priorities. Thus, the remaining service traffic to be allocated in the last time window can be guaranteed to be prioritized.

When the service quality priority of the residual traffic of the last time window is greater than that of the uniformly arrived traffic of the current time window, namely QOS-PRI1>QOS-PRI2, computing the integrated prioritization of both (i.e., the first priority value and the second priority value) by the PRI calculation formula, to comprehensively prioritize traffic (i.e., resource allocation according to the ordering of the first priority value and the second priority value). As shown in fig. 5, since the ordering of the fractional priority F-PRI1 and F-PRI2 is unknown, the ordering order of the first priority value and the second priority value calculated according to the PRI calculation formula is unknown. Thus, the first pri.1 may be a first priority value or a second priority value, and in fig. 5, the "dots" of different densities and different shapes are replaced, and are allocated in order of priority. FIG. 5 shows that at t ₀ To t ₁ The traffic of PRI.1 and PRI.2 is fully allocated within the time window, and therefore, at t ₁ To t ₂ The time window only transmits t ₁ To t ₂ The time window reaches the traffic uniformly.

Two prioritized pri.1 and pri.2 prioritized traffic to be allocated for the last time window are both the remaining traffic to be allocated for the preceding time window, then at t ₀ To t ₁ The remaining traffic to be allocated is transmitted first in a time window, at t ₁ To t ₂ Time window transfer at t ₀ To t ₁ The time window evenly reaches the traffic to ensure time and quality of service considerations.

3. The shortest 3 paths from the upstream gateway station to the downstream satellites are found according to the k algorithm, namely path 1, path 2 and path 3, where k=3 is limited by the traffic tolerant delay, as shown in fig. 6A to 6C. The resulting 3 paths are put into the uplink path sequence and path 1 (minimum link remaining resource is 0), path 2 (minimum link remaining resource is 30%) and path 3 (minimum link remaining resource is 40%) are sequentially ordered (from small to large) as shown in fig. 7.

4. Path 1 is first selected in order, and the smallest remaining link resource in its path is found to be 0, at which point path 1 is removed. Then selecting path 2 in sequence, confirming that the minimum remaining link resource is not 0, dividing the arriving traffic (i.e. the remaining traffic to be allocated in the last time window and/or the current traffic to be allocated in the current time window) according to the minimum remaining link resource 30% in path 2, and then planning the path for the traffic, and simultaneously removing the path in the uplink path sequence. After the allocation of path 2 is completed, the uplink remaining resource matrix is partially updated (i.e., only the values corresponding to the links traversed in path 2 are updated).

As shown in fig. 8, since the allocation occupies 30% of the resources in the path 2, the resources between No.1 to No.2 are reduced from 50% to 20%, and thus the partial matrix update cases corresponding to No.1 and No.2 are shown in the lower right side of fig. 8. At the same time, the resource information of the path 3 remaining in the uplink path sequence is updated synchronously, as shown in fig. 9.

5. Now 90% of the traffic remains, path 3 is selected as the routing path, the allocable resources in path 3 are 20%, and the traffic is further divided according to the 20% allocable resources. Until it is determined that there is no path in the uplink path sequence or that all the allocable resources in the path are 0, it is indicated that there are not enough resources available for allocation within the current time window. And forwarding the real-time traffic with higher service priority in the unassigned uplink service traffic to the adjacent gateway station of the destination gateway station for resource allocation, and dividing the rest residual traffic in the unassigned uplink service traffic into the next time window of the destination gateway station for resource allocation.

And setting the distribution priority of the part which is not allocated with the uplink service flow to be the lowest when the resource allocation is carried out in the current time window, and ensuring that the service flow which is already allocated is preferentially distributed in the current time window. When the part of unassigned uplink service flow is transferred to the next time window, the next time window is used as the current time window, the unassigned uplink service flow is used as the residual flow of the previous time window, and the corresponding priority is repartitioned for resource allocation. This ensures that the current time window and the next time window arrive at traffic with a prioritized progression between each other.

The uplink operation section is completed after the above operations are completed.

Downlink part (feeder satellite No.3 to downlink gateway station No. 6):

6. after the uplink operation is completed, as shown in fig. 10, 50% of the traffic (i.e., the downlink traffic to be allocated) is routed to the feeder satellite No.3, the feeder satellite No.3 calculates that the link remaining resources are only 30%, updates the downlink remaining resource matrix, and allocates the traffic to the 50% at the feeder satellite according to the division result, which is divided into (30%, 20%), wherein the 30% of the traffic is distributed within the current time window of the downlink, and the 20% of the traffic (i.e., the unallocated downlink traffic) is directly forwarded to the feeder satellite No.4 of the adjacent downlink gateway station No.5 of the downlink gateway station No.6 for distribution.

After the above operation, all downlink operations are completed and the next traffic division of the uplink portion is continued to be awaited.

It should be noted that the method of the embodiments of the present disclosure may be performed by a single device, such as a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of embodiments of the present disclosure, the devices interacting with each other to accomplish the methods.

It should be noted that the foregoing describes some embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

Based on the same inventive concept, the present disclosure also provides a satellite service resource allocation system, corresponding to the method of any embodiment, which is applied to an uplink.

Referring to fig. 11, a satellite service resource allocation system includes:

the uplink acquisition module 21 is configured to acquire uplink traffic to be allocated that arrives at the uplink target gateway station.

An uplink determining module 22, configured to determine an uplink between the uplink target gateway station and the downlink feed satellite according to topology information of a whole network node, where the whole network node includes: each gateway node and each satellite node.

The uplink matrix construction module 23 is configured to construct an uplink residual resource matrix based on the connection relationship of each node in the uplink and the residual resources between each connected node in the uplink.

The uplink path determining module 24 is configured to determine at least one uplink traffic path for the uplink target gateway station to reach the downlink feed satellite according to the uplink connection path.

The uplink resource allocation module 25 is configured to determine, based on the uplink remaining resource matrix, an allocable remaining resource corresponding to at least one uplink service path, and allocate resources for the uplink service to be allocated.

In some embodiments, the uplink matrix construction module 23 is specifically configured to: determining transmission data of a current time window among all the connection nodes in the uplink, and calculating uplink residual resources among all the connection nodes in the uplink by using the transmission data of the current time window; and constructing an uplink residual resource matrix according to the connection relation of each node in the uplink and uplink residual resources among each connection node in the uplink.

In some embodiments, the uplink matrix construction module 23 is specifically further configured to: determining the remaining time t of a current time window between each connected node in the uplink and the transmission rate v of the current time window; determining a link residual bandwidth b between each connected node in the uplink; the remaining uplink resources between the respective connected nodes in the uplink are calculated according to the formula min (t x v, b).

In some embodiments, the uplink path determining module 24 is specifically configured to: and (3) finding at least one uplink service path of the uplink target gateway station reaching the downlink feed satellite from the connection path of the uplink by using a KSP algorithm, and storing the at least one uplink service path into an uplink path sequence.

The uplink resource allocation module 25 is specifically configured to:

acquiring at least one uplink residual resource corresponding to each uplink service path in the uplink path sequence from the uplink residual resource matrix, and determining the allocable residual resources of each uplink service path; sequencing at least one uplink service path according to the value of the allocable residual resources, and deleting the uplink service path with the allocable residual resources of 0 from the uplink path sequence; and performing resource allocation for the uplink service flow to be allocated based on the ordering sequence of at least one uplink service path in the uplink path sequence and the corresponding allocable residual resources.

The uplink resource allocation module 25 is specifically further configured to:

determining corresponding priority for the current uplink service flow to be allocated and/or the residual uplink service flow to be allocated; sequentially selecting corresponding target uplink service paths from the uplink path sequence according to the sorting order, and distributing the allocable residual resources corresponding to the target uplink service paths according to the current uplink service flow to be distributed and/or the priority of the residual uplink service flow to be distributed; and deleting the allocated target uplink service path from the uplink path sequence, and updating the uplink residual resource matrix.

In some embodiments, the uplink resource allocation module 25 is specifically further configured to:

setting a corresponding first distribution priority value for the remaining uplink service flow to be distributed, and setting a corresponding second distribution priority value for the current uplink service flow to be distributed; setting a corresponding first service priority value according to the service quality of the remaining uplink service flow to be allocated, and setting a corresponding second service priority value according to the service quality of the current uplink service flow to be allocated; and determining a first priority value of the remaining uplink traffic to be allocated = lambda first allocation priority value + mu first service priority value and a second priority value of the current uplink traffic to be allocated = lambda second allocation priority value + mu second service priority value.

and responding to the current uplink traffic to be allocated and/or the residual uplink traffic to be allocated, and carrying out resource allocation on the unallocated uplink traffic according to the sorting sequence of the residual uplink traffic paths of the uplink path sequence and the allocable residual resources corresponding to the residual uplink traffic paths, and continuously repeating the process until no uplink traffic paths exist in the uplink path sequence or the unallocated uplink traffic is completely allocated.

The uplink resource allocation module 25 is specifically further configured to:

and after determining that no uplink service path exists in the uplink path sequence, the current uplink service flow to be allocated and/or the remaining uplink service flow to be allocated still have unallocated uplink service flow, and sending the unallocated uplink service flow to an adjacent uplink gateway station of the target uplink gateway station for resource allocation, and/or allocating the unallocated uplink service flow to a next time window of the target uplink gateway station for resource allocation.

For convenience of description, the above system is described as being functionally divided into various modules, respectively. Of course, the functions of the various modules may be implemented in the same one or more pieces of software and/or hardware when implementing the present disclosure.

The system of the foregoing embodiment is configured to implement the corresponding uplink satellite service resource allocation method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, the present disclosure also provides a satellite service resource allocation system, corresponding to the method of any embodiment, which is applied to downlink.

Referring to fig. 12, a satellite service resource allocation system includes:

and the downlink acquisition module 31 is configured to acquire downlink traffic to be allocated, which arrives at the downlink feed satellite.

A downlink determining module 32, configured to determine a downlink between the downlink satellite and the downlink target gateway station according to topology information of the nodes of the whole network.

The downlink matrix construction module 33 is configured to construct a downlink residual resource matrix based on the connection relationship of each node in the downlink and the residual resources between each connected node in the downlink.

The downlink path determining module 34 is configured to determine at least one downlink service path for the downlink feed satellite to reach the downlink target gateway station according to the downlink connection path.

The downlink resource allocation module 35 is configured to determine, based on the downlink remaining resource matrix, an allocable remaining resource corresponding to at least one downlink service path, and allocate resources for a downlink service to be allocated.

In some embodiments, the downlink resource allocation module 35 is specifically configured to:

storing at least one downlink service path into a downlink path sequence, and sequencing according to downlink residual resources corresponding to the at least one downlink service path; selecting a target downlink service path from the downlink path sequence according to the ordering sequence, and performing resource allocation for downlink service flow to be allocated according to the allocable residual resources corresponding to the target downlink service path; deleting the allocated target downlink service path from the downlink path sequence, and updating a downlink residual resource matrix;

the method comprises the steps of,

responding to the fact that the downlink service flow to be allocated still has unallocated downlink service flow, allocating resources for the unallocated downlink service flow according to the ordering sequence of the remaining downlink service paths of the downlink path sequence and the allocable remaining resources corresponding to the remaining downlink service paths, and continuously repeating the process until no downlink service paths exist in the downlink path sequence or the unallocated downlink service flow is completely allocated;

the method comprises the steps of,

and in response to determining that no downlink service path exists in the downlink path sequence, the downlink service flow to be allocated still has unallocated downlink service flow, sending the unallocated downlink service flow to a downlink feed satellite of an adjacent downlink gateway station of the downlink target gateway station for resource allocation, and/or allocating the unallocated downlink service flow to a next time window of the downlink feed satellite for resource allocation.

The system of the foregoing embodiment is configured to implement the corresponding downlink satellite service resource allocation method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, the present disclosure also provides an electronic device corresponding to the method of any embodiment, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor implements the method for allocating satellite service resources of uplink or downlink according to any embodiment when executing the program.

Fig. 13 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 implement communication connections therebetween within the device via a bus 1050.

The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit ), microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided in the embodiments of the present disclosure.

The Memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 1020 may store an operating system and other application programs, and when the embodiments of the present specification are implemented in software or firmware, the associated program code is stored in memory 1020 and executed by processor 1010.

The input/output interface 1030 is used to connect with an input/output module for inputting and outputting information. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.

Communication interface 1040 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).

Bus 1050 includes a path for transferring information between components of the device (e.g., processor 1010, memory 1020, input/output interface 1030, and communication interface 1040).

It should be noted that although the above-described device only shows processor 1010, memory 1020, input/output interface 1030, communication interface 1040, and bus 1050, in an implementation, the device may include other components necessary to achieve proper operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.

The electronic device of the foregoing embodiment is configured to implement the corresponding satellite service resource allocation method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, corresponding to any of the above embodiments of the method, the present disclosure further provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the satellite service resource allocation method according to any of the above embodiments.

The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.

The storage medium of the foregoing embodiment stores computer instructions for causing the computer to execute the satellite service resource allocation method according to any one of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described herein.

Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined under the idea of the present disclosure, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in details for the sake of brevity.

Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present disclosure. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present disclosure, and this also accounts for the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform on which the embodiments of the present disclosure are to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.

While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

The disclosed embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Accordingly, any omissions, modifications, equivalents, improvements, and the like, which are within the spirit and principles of the embodiments of the disclosure, are intended to be included within the scope of the disclosure.

Claims

1. A satellite service resource allocation method comprises the following steps:

acquiring uplink service flow to be distributed reaching an uplink target gateway station, wherein the uplink service flow to be distributed comprises the following components: the current uplink service flow to be allocated of the current time window of the uplink target gateway station and/or the residual uplink service flow to be allocated of the last time window of the uplink target gateway station;

determining the allocable residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix, and performing resource allocation for the uplink service to be allocated;

the determining, according to the uplink connection path, at least one uplink service path for the uplink target gateway station to reach the downlink feed satellite specifically includes:

finding at least one uplink service path of the uplink target gateway station reaching a downlink feed satellite from the connection path of the uplink by using a KSP algorithm, and storing the at least one uplink service path into an uplink path sequence;

the determining, based on the uplink remaining resource matrix, the allocable remaining resources corresponding to the at least one uplink service path, and allocating resources for the uplink service traffic to be allocated specifically includes:

acquiring at least one uplink residual resource corresponding to each uplink service path in the uplink path sequence from the uplink residual resource matrix, and determining the allocable residual resources of each uplink service path;

Sorting the at least one uplink service path according to the value of the allocable residual resources, and deleting the uplink service path with the allocable residual resources of 0 from the uplink path sequence;

performing resource allocation for the uplink service flow to be allocated based on the ordering sequence of at least one uplink service path in the uplink path sequence and the corresponding allocable residual resources;

the allocating the resources for the uplink service flow to be allocated based on the ordering sequence of at least one uplink service path in the uplink path sequence and the corresponding allocable residual resources specifically includes:

determining a corresponding priority for the current uplink service flow to be allocated and/or the residual uplink service flow to be allocated;

sequentially selecting corresponding target uplink service paths from the uplink path sequence according to the sorting order, and distributing the allocable residual resources corresponding to the target uplink service paths according to the current uplink service flow to be distributed and/or the priority of the residual uplink service flow to be distributed;

and deleting the allocated target uplink service path from the uplink path sequence, and updating the uplink residual resource matrix.

2. The method according to claim 1, wherein the constructing an uplink residual resource matrix based on the connection relation of each node in the uplink and uplink residual resources between each connected node specifically includes:

determining transmission data of a current time window among all the connecting nodes in the uplink, and calculating uplink residual resources among all the connecting nodes in the uplink by using the transmission data of the current time window;

and constructing an uplink residual resource matrix according to the connection relation of each node in the uplink and uplink residual resources among each connection node in the uplink.

3. The method according to claim 2, wherein the determining the transmission data of the current time window between the connection nodes in the uplink, and calculating the uplink remaining resources between the connection nodes in the uplink using the transmission data of the current time window specifically includes:

determining the remaining time t of a current time window between all the connecting nodes in the uplink and the transmission rate v of the current time window;

determining a link residual bandwidth b between each connection node in the uplink;

And calculating uplink residual resources between each connecting node in the uplink according to a formula min (t.v, b).

4. The method of claim 1, wherein the determining the corresponding priority for the current uplink traffic to be allocated and/or the remaining uplink traffic to be allocated specifically includes:

setting a corresponding first distribution priority value for the residual uplink service flow to be distributed, and setting a corresponding second distribution priority value for the current uplink service flow to be distributed;

setting a corresponding first service priority value according to the service quality of the remaining uplink service flow to be allocated, and setting a corresponding second service priority value according to the service quality of the current uplink service flow to be allocated;

and determining a first priority value=lambda first distribution priority value+mu first service priority value of the residual uplink service flow to be distributed, and a second priority value=lambda second distribution priority value+mu second service priority value of the current uplink service flow to be distributed.

5. The method of claim 1, wherein the method further comprises:

responding to the current uplink service flow to be allocated and/or the residual uplink service flow to be allocated still has unallocated uplink service flow, allocating resources for the unallocated uplink service flow according to the sorting sequence of the residual uplink service paths of the uplink path sequence and the allocable residual resources corresponding to the residual uplink service paths, and continuously repeating the process until no uplink service paths exist in the uplink path sequence or the unallocated uplink service flow is completely allocated;

And/or the number of the groups of groups,

and in response to determining that no uplink service path exists in the uplink path sequence, the current uplink service flow to be allocated and/or the remaining uplink service flow to be allocated still have unallocated uplink service flow, sending the unallocated uplink service flow to an adjacent uplink gateway station of the uplink target gateway station for resource allocation, and/or allocating the unallocated uplink service flow to a next time window of the uplink target gateway station for resource allocation.

6. A satellite service resource allocation method comprises the following steps:

determining the allocable residual resources corresponding to the at least one downlink service path based on the downlink residual resource matrix, and performing resource allocation for the downlink service to be allocated;

The determining, based on the downlink residual resource matrix, the allocable residual resources corresponding to the at least one downlink service path, and allocating resources for the downlink service to be allocated, specifically includes:

storing the at least one downlink service path into a downlink path sequence, and sequencing according to downlink residual resources corresponding to the at least one downlink service path;

selecting a target downlink service path from a downlink path sequence according to the ordering sequence, and performing resource allocation for the downlink service flow to be allocated according to the allocable residual resources corresponding to the target downlink service path;

deleting the allocated target downlink service path from the downlink path sequence, and updating the downlink residual resource matrix;

the method comprises the steps of,

The method comprises the steps of,

and in response to determining that the downlink service path does not exist in the downlink path sequence, the downlink service flow to be allocated still has unallocated downlink service flow, sending the unallocated downlink service flow to a downlink feed satellite of an adjacent downlink gateway station of the downlink target gateway station for resource allocation, and/or allocating the unallocated downlink service flow to a next time window of the downlink feed satellite for resource allocation.

7. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any one of claims 1 to 5 when the program is executed and/or the method of claim 6 when the program is executed by the processor.