Satellite beam outbound scheduling method and device, program product and storage medium

Abstract

The invention discloses a satellite beam outbound scheduling method and device, a program product and a storage medium, and the method comprises the steps: determining N first scheduling schemes based on outbound rates of a plurality of user frames and outbound rates of a plurality of outbound frames, the first scheduling schemes being used for indicating an allocation mode of allocating an outbound frame to each user frame, in the first scheduling scheme, the outbound rate of the first user frame is greater than or equal to the outbound rate of a first outbound frame allocated for the first user frame, the first user frame is any frame in a plurality of user frames, the first outbound frame is any frame in a plurality of outbound frames, and N is a positive integer; determining a target scheduling scheme from the N first scheduling schemes based on the outbound resource of each first scheduling scheme; and outbound is carried out on the plurality of user frames according to the target scheduling scheme. Through application of the method and the device, the technical problem that the user communication experience is influenced in related technologies is solved, and the effect of improving the user experience is further achieved.

Description

Technical Field

[0001] This application relates to the field of satellite communications, and more specifically, to a satellite beam outbound scheduling method and apparatus, program product, and storage medium. Background Technology

[0002] In the field of satellite communications, especially in short message satellite communication services, optimizing outbound scheduling schemes is crucial for improving system performance and ensuring user service quality. However, related technologies currently only use "buffer size" as the basis for beam selection and "full frame arrangement" as the basis for rate selection when generating scheduling schemes. This single-dimensional decision-making approach fails to consider multi-dimensional service quality objectives. Consequently, some user service requests may fail to have their corresponding user frames outbound in a timely manner due to long waiting times for full frame arrangement or resource imbalances, resulting in "service starvation" and severely impacting user communication experience. This fails to meet the timeliness and reliability requirements of short message communication services. Summary of the Invention

[0003] This application provides a satellite beam outbound scheduling method and apparatus, program product, storage medium, and electronic device to at least solve technical problems affecting user communication experience in related technologies.

[0004] According to one aspect of the embodiments of this application, a satellite beam outbound scheduling method is provided, comprising: determining N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, wherein the first scheduling schemes are used to indicate the allocation method of allocating the outbound frames to each user frame, in the first scheduling schemes, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame allocated to the first user frame, the first user frame is any frame among the multiple user frames, the first outbound frame is any frame among the multiple outbound frames, and N is a positive integer; determining a target scheduling scheme from the N first scheduling schemes based on the outbound resources of each of the first scheduling schemes, wherein the target outbound resources of the target scheduling scheme are greater than a first preset resource threshold, and the outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after allocating the outbound frames according to the allocation method indicated by the first scheduling scheme; and performing outbound scheduling on the multiple user frames according to the target scheduling scheme.

[0005] In an exemplary embodiment, determining N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames includes: obtaining N initial scheduling schemes based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames, wherein the redundant beam is used to carry outbound frames capable of carrying the user frames outbound, and the outbound resources of the initial scheduling schemes are less than the outbound resources of the first scheduling schemes; and determining N first scheduling schemes based on the N initial scheduling schemes, the outbound rates of the multiple user frames, and the outbound rates of the multiple outbound frames.

[0006] In an exemplary embodiment, determining N first scheduling schemes based on N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames includes: repeatedly performing the following iterative operation until a preset condition is met, and determining the scheduling scheme obtained from the last iteration as N first scheduling schemes: adjusting M of the N initial scheduling schemes according to a first adjustment method based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, and generating M additional adjusted scheduling schemes while retaining M scheduling schemes, wherein after adjustment, the beam of the outbound frame assigned to the same user frame changes, and the outbound rate remains unchanged, and M is an integer less than or equal to N; adjusting Q of the N initial scheduling schemes according to a second adjustment method based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, and generating Q additional adjusted scheduling schemes while retaining Q scheduling schemes. The subsequent scheduling scheme, wherein after adjustment, the beam in which the outgoing frames allocated to the same user frame are located remains unchanged, and the outgoing rate is reduced, Q is an integer less than or equal to N; K scheduling schemes from the N initial scheduling schemes are adjusted according to the third adjustment method, and K additional adjusted scheduling schemes are generated while retaining K scheduling schemes, wherein after adjustment, the outgoing duration of at least one user frame in a scheduling scheme is delayed by a predetermined duration, N is an integer less than or equal to N; Y scheduling schemes satisfying preset rules are determined from the first set, wherein the first set includes any P scheduling schemes from the M+Q+K adjusted scheduling schemes and N initial scheduling schemes, Y is an integer less than N; the Y scheduling schemes and any NY scheduling schemes included in the second set are determined as N initial scheduling schemes in the next iteration operation, wherein the second set includes N initial scheduling schemes and N+PY scheduling schemes from the P scheduling schemes excluding the Y scheduling schemes.

[0007] In an exemplary embodiment, determining Y scheduling schemes that satisfy preset rules from a first set includes: determining Y scheduling schemes whose outbound resources are greater than a second resource threshold from the first set based on the outbound resources of each of the adjusted scheduling schemes, wherein the outbound resources of each adjusted scheduling scheme are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the adjusted scheduling scheme.

[0008] In one exemplary embodiment, the preset conditions include at least one of the following: the number of times the above iterative operation is executed reaches a target number; the plurality of the above outbound frames include a target outbound frame whose outbound time is greater than a preset time; and the total duration of executing the above iterative operation reaches a target duration.

[0009] In an exemplary embodiment, N initial scheduling schemes are obtained based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames. This includes: performing the following operations sequentially on each user frame obtained from the outbound buffer to obtain the N initial scheduling schemes: determining an outbound rate combination based on the outbound rates of multiple outbound frames, wherein the outbound rate combination includes the outbound rates of multiple second outbound frames, all of which belong to different target beams, and the target beams include the redundant beam; and allocating a third outbound frame to the user frame when the waiting time of the user frame in the outbound buffer is less than or equal to a first preset time, the multiple outbound frames include a third outbound frame, and the third outbound frame can carry the user frame, wherein the third outbound frame belongs to any one of the beams included in the redundant beams, the outbound rate of the third outbound frame is less than or equal to the outbound rate of the user frame, and the outbound rate combination includes the outbound rate of the third outbound frame.

[0010] In an exemplary embodiment, if the waiting time of the user frame in the outbound buffer is greater than the first preset time, the user frame is added to the fourth outbound frame so that the user frame can be outbound through the fourth outbound frame. The fourth outbound frame belongs to any one of the target beams, and the outbound rate of the fourth outbound frame is less than or equal to the outbound rate of the user frame.

[0011] In an exemplary embodiment, determining a target scheduling scheme with a target outbound resource greater than a first preset resource threshold from N first scheduling schemes based on the outbound resources of each of the first scheduling schemes includes: determining a first outbound resource, a second outbound resource, a third outbound resource, and a fourth outbound resource for each of the first scheduling schemes, wherein the first outbound resource is determined based on the number of user frames included in each outbound frame of the first scheduling scheme, the second outbound resource is determined based on the amount of data outbound per unit time of each outbound frame of the first scheduling scheme, the third outbound resource is determined based on the average outbound waiting time of the user frames in the outbound frames of the first scheduling scheme, and the fourth outbound resource is determined based on the number of bits in each outbound frame of the first scheduling scheme; determining the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource; and determining the first scheduling scheme corresponding to the target outbound resource as the target scheduling scheme.

[0012] In one exemplary embodiment, the first outbound resource is determined by the following formula. : Among them, the above The above-mentioned number and value of user frames transmitted per unit time for all outbound frames in the first scheduling scheme described above. This represents the minimum number and value of user frames transmitted per unit time for all outbound frames in N of the above-mentioned first scheduling schemes. The maximum number and value of user frames transmitted per unit time for all outbound frames in N of the first scheduling schemes described above; the second outbound resource is determined by the following formula. : Among them, the above This is used to represent the amount and value of outbound data transmitted by all outbound frames within a unit of time in the first scheduling scheme described above. This is used to represent the minimum data volume and value of all outgoing frames transmitted per unit time in N of the above first scheduling schemes. This represents the maximum data volume and value transmitted per unit time for all outbound frames in the N first scheduling schemes described above; the third outbound resource is determined by the following formula. : Among them, the above The reciprocal of the average of the average departure waiting times for all the aforementioned outbound frames in the first scheduling scheme described above. The minimum average of the average outbound waiting times for all outbound frames in the N first scheduling schemes described above is used to represent the fourth outbound resource; the fourth outbound resource is determined by the following formula. : Among them, the above The above It is the first scheduling scheme mentioned above. The number of bits in the aforementioned outbound frames. For the expected number of bits in all the aforementioned outbound frames in the first scheduling scheme described above, the aforementioned It is determined based on the number of bits in the outbound frames of the above-mentioned N first scheduling schemes and the expected standard deviation.

[0013] In an exemplary embodiment, determining the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource includes: determining the target outbound resource using the following formula: ,in, , These are the weights of the first, second, third, and fourth outbound resources, respectively.

[0014] According to another aspect of the embodiments of this application, a satellite beam outbound scheduling device is provided, comprising: a memory, a processor, and a computer program stored in the memory and executable on the memory. When the processor executes the computer program, it performs the following operations: determining N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, wherein the first scheduling schemes are used to indicate the allocation method of assigning the outbound frames to each user frame, and in the first scheduling schemes, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame assigned to the first user frame. The first user frame is any frame among the plurality of user frames, and the first outbound frame is any frame among the plurality of outbound frames, where N is a positive integer; based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme is determined from the N of the first scheduling schemes, wherein the target outbound resources of the target scheduling scheme are greater than a first preset resource threshold, and the outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each of the user frames and the load status of each of the outbound frames after the outbound frames are allocated according to the allocation method indicated by the first scheduling scheme; the plurality of user frames are outbound according to the target scheduling scheme.

[0015] According to another aspect of the embodiments of this application, a computer-readable storage medium is also provided, wherein a computer program is stored therein, wherein the computer program is configured to perform the steps in any of the above method embodiments when executed by a processor.

[0016] According to another aspect of the embodiments of this application, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, causing the computer device to perform the steps in any of the method embodiments described above.

[0017] According to another aspect of the embodiments of this application, an electronic device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to perform the steps of any of the above method embodiments through the computer program.

[0018] This application addresses several key issues. First, when generating N first scheduling schemes, it explicitly limits the outbound rate of the first user frame to be greater than or equal to the outbound rate of the first outbound frame allocated to the first user frame, thus avoiding rate incompatibility problems. Second, it determines the final target scheduling scheme based on the outbound waiting time and load status of each user frame. For user frames, this avoids issues such as "excessive delay" and "large delay fluctuations," ensuring timely communication. For outbound frames, load status optimization avoids resource waste and indirectly provides more available resources for user frame scheduling. Therefore, it solves technical problems affecting user communication experience in related technologies, thereby improving user experience. Attached Figure Description

[0019] Figure 1 This is a schematic diagram illustrating an application scenario of a satellite beam outbound scheduling method according to an embodiment of this application;

[0020] Figure 2 This is a flowchart illustrating an optional satellite beam outbound scheduling method according to an embodiment of this application;

[0021] Figure 3 This is a flowchart illustrating another optional satellite beam outbound scheduling method according to an embodiment of this application. Figure 1 ;

[0022] Figure 4 This is a schematic diagram of a satellite beam outbound scheduling method according to an embodiment of this application. Figure 1 ;

[0023] Figure 5This is a flowchart illustrating another optional satellite beam outbound scheduling method according to an embodiment of this application. Figure 2 ;

[0024] Figure 6 This is a structural block diagram of an optional satellite beam outbound scheduling device according to an embodiment of this application. Detailed Implementation

[0025] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0026] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0027] The method embodiments provided in this application can be applied to various communication systems, such as non-terrestrial networks.

[0028] According to one aspect of the embodiments of this application, a satellite beam outgoing scheduling method is provided. Optionally, in this embodiment, the above-described satellite beam outgoing scheduling method may be applied to, but is not limited to, [examples of applications such as...]. Figure 1 The diagram shows the architecture of a satellite communication system. This satellite communication system may include a satellite 101, a terminal 102, and a gateway station 103.

[0029] In this disclosure, satellite 101 is an entity used for transmitting or receiving signals. The embodiments of this disclosure do not limit the specific technologies or equipment used in the satellite.

[0030] In this disclosure, terminal 102 refers to a processing device within the satellite coverage beam range for communicating with a satellite. For example, the terminal can be a car with satellite communication capabilities, a smart car, a mobile phone, a wearable device, a tablet computer, etc. This disclosure does not limit the specific technology or device form used in the terminal. It should be noted that... Figure 1 The example uses two terminal devices 102.

[0031] In one embodiment of this disclosure, gateway station 103 is connected to satellite 101.

[0032] In this embodiment, the gateway station 103 is a ground-based node in a satellite communication system used for transmitting and receiving data. This embodiment does not limit the specific technology or equipment form employed by the gateway station.

[0033] It is understood that the satellite communication system described in this disclosure is for the purpose of more clearly illustrating the technical solutions of this disclosure, and does not constitute a limitation on the technical solutions provided in this disclosure. As those skilled in the art will know, with the evolution of system architecture and the emergence of new business scenarios, the technical solutions provided in this disclosure are also applicable to similar technical problems.

[0034] Taking the satellite beam outgoing scheduling method in this embodiment as an example, using a gateway station to perform the method, Figure 2 This is a flowchart illustrating an optional satellite beam outbound scheduling method according to an embodiment of this application, as shown below. Figure 2 As shown, the process of this method may include the following steps:

[0035] Step S202: Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, determine N first scheduling schemes, wherein the first scheduling scheme is used to indicate the allocation method of allocating the outbound frames to each of the user frames. In the first scheduling scheme, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame allocated to the first user frame. The first user frame is any frame among the multiple user frames, the first outbound frame is any frame among the multiple outbound frames, and N is a positive integer.

[0036] In one embodiment, a user frame is the smallest data unit carrying specific user communication data in satellite short message communication. It includes key information such as the short message content sent by the user, terminal identifier, timestamp, and redundant beam information, and is the core processing object for satellite outbound scheduling. For example, a command containing location information sent by a BeiDou short message user terminal will be encapsulated into a user frame and await outbound scheduling by the satellite system.

[0037] In one embodiment, the outbound rate of a user frame is the maximum data receiving rate of the terminal (e.g., the user's mobile phone), determined by the terminal's hardware performance, communication protocol version, etc., and is the core basis for allocating outbound frames during scheduling. For example, some high-performance terminals support z Kbps (high rate), while basic terminals only support x Kbps (low rate), and follow the principle of "high-rate terminals are backward compatible with low rates"—terminals supporting z Kbps can receive outbound data at z, y, and x Kbps rates, while terminals supporting x Kbps can only receive data at x Kbps rate.

[0038] In one embodiment, an outbound frame is the transmission format used by a satellite system to send data to a terminal. It can be generated by a satellite gateway station according to a preset communication protocol. An outbound frame includes one or more user frames (the number is not fixed and depends on factors such as frame length, user frame size, and outbound rate). For example, an x ​​Kbps outbound frame of a satellite can accommodate 10 small x Kbps user frames, which are then transmitted to the target area through a designated beam after being arranged.

[0039] In one embodiment, the outbound rate of an outbound frame is the data rate at which the outbound frame is transmitted within the satellite beam. Only one rate can be used for transmission of the same outbound frame, and this rate determines the actual transmission efficiency of the user frame.

[0040] In one embodiment, the first scheduling scheme determines a "user frame-outgoing frame" allocation set for multiple user frames currently awaiting outbound travel, specifying which outbound frame under which beam each user frame should be assigned. For example, for three user frames #1 (supporting z Kbps), #2 (supporting x Kbps), and #3 (supporting y Kbps), a first scheduling scheme may specify that #1 is assigned to the z Kbps outbound frame of beam 1, #2 is assigned to the x Kbps outbound frame of beam 2, and #3 is assigned to the y Kbps outbound frame of beam 1.

[0041] Step S204: Based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme is determined from the N first scheduling schemes. The target outbound resources of the target scheduling scheme are greater than a first preset resource threshold. The outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the first scheduling scheme.

[0042] In one embodiment, "outbound resources" is a core comprehensive indicator for quantitatively evaluating the "quality" of the first scheduling scheme. It represents the ability of outbound user frames to leave the station. It is calculated from two dimensions: "outbound waiting time for each user frame" and "load status of each outbound frame". The shorter the waiting time, the stronger the perceived communication timeliness for users, and the higher the "user value" of outbound resources. The better the load status (such as moderate load rate and no resource waste), the higher the system resource utilization rate, and the higher the "system value" of outbound resources.

[0043] Step S206: Perform outbound processing of multiple user frames according to the above target scheduling scheme.

[0044] This embodiment addresses several key challenges. First, when generating N first scheduling schemes, it explicitly limits the outbound rate of the first user frame to be greater than or equal to the outbound rate of the first outbound frame allocated to it, thus avoiding rate incompatibility issues. Second, it determines the final target scheduling scheme based on the outbound waiting time and load status of each user frame. For user frames, this avoids problems such as "excessive latency" and "large latency fluctuations," ensuring timely communication. For outbound frames, load status optimization prevents resource waste and indirectly provides more available resources for user frame scheduling. Therefore, it solves technical problems affecting user communication experience in related technologies, thereby improving user experience.

[0045] In an exemplary embodiment, determining N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames includes: obtaining N initial scheduling schemes based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames, wherein the redundant beam is used to carry outbound frames capable of carrying the user frames outbound, and the outbound resources of the initial scheduling schemes are less than the outbound resources of the first scheduling schemes; and determining N first scheduling schemes based on the N initial scheduling schemes, the outbound rates of the multiple user frames, and the outbound rates of the multiple outbound frames.

[0046] In one embodiment, "redundant beams" refer to the "available beam information" carried by the terminal when sending an inbound request. This means multiple satellite beams that the terminal can receive data from, all of which have the capability to carry the user frame outbound (the coverage area includes the location of the user terminal, and the signal strength meets the reception requirements). For example, if a terminal is located in East my country, and its inbound request carries redundant beams as "beam 1 (covering the main beam in East China) and beam 2 (covering the backup beam at the East-Central China border)," then during subsequent scheduling, the user frame can only be assigned to outbound frames under these two beams, and cannot be assigned to beam 3 covering North China, thus avoiding data reception failure due to beam coverage mismatch.

[0047] In one embodiment, the "initial scheduling scheme" is a basic candidate scheme generated based on the outbound rate of the user frame, redundant beams, and the outbound rate of the outbound frame. Its outbound resources are less than those of the first scheduling scheme. That is, the initial scheme only meets basic feasibility constraints such as "rate adaptation" and "beam assignment" and has not been optimized and adjusted. It performs weakly in comprehensive dimensions such as "user waiting time" and "outbound frame load efficiency", and its overall performance is lower than that of the first scheduling scheme. For example, for user frame #1 (outbound rate z Kbps, redundant beam 1 / 2) and user frame #2 (outbound rate x Kbps, redundant beam 2 / 3), an initial scheduling scheme may simply assign #1 to the x Kbps outbound frame of beam 1 (satisfying rate adaptation, but not utilizing the high rate capability of #1) and #2 to the x Kbps outbound frame of beam 2 (satisfying constraints, but potentially causing a surge in load on beam 2). Although this scheme is executable, its outbound resource score is low.

[0048] In this embodiment, N initial scheduling schemes are first generated, and then N first scheduling schemes are generated based on the N initial scheduling schemes. This avoids the optimization getting stuck in local optima and increases the probability of the global optimal solution.

[0049] In an exemplary embodiment, determining N first scheduling schemes based on N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames includes: repeatedly performing the following iterative operation until a preset condition is met, and determining the scheduling scheme obtained from the last iteration as N first scheduling schemes: adjusting M of the N initial scheduling schemes according to a first adjustment method based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, and generating M additional adjusted scheduling schemes while retaining M scheduling schemes, wherein after adjustment, the beam of the outbound frame assigned to the same user frame changes, and the outbound rate remains unchanged, and M is an integer less than or equal to N; adjusting Q of the N initial scheduling schemes according to a second adjustment method based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, and generating Q additional adjusted scheduling schemes while retaining Q scheduling schemes. The adjusted scheduling scheme, wherein after adjustment, the beam in which the outgoing frames allocated to the same user frame are located remains unchanged, and the outgoing rate is reduced, Q is an integer less than or equal to N; K scheduling schemes from the N initial scheduling schemes are adjusted according to the third adjustment method, and K additional adjusted scheduling schemes are generated while retaining K scheduling schemes, wherein after adjustment, the outgoing duration of at least one user frame in a scheduling scheme is delayed by a predetermined duration, N is an integer less than or equal to N; Y scheduling schemes satisfying preset rules are determined from the first set, wherein the first set includes any P scheduling schemes from the M+Q+K adjusted scheduling schemes and N initial scheduling schemes, Y is an integer less than N; the Y scheduling schemes and any NY scheduling schemes included in the second set are determined as N initial scheduling schemes in the next iteration operation, wherein the second set includes N initial scheduling schemes and N+PY scheduling schemes from the P scheduling schemes excluding the Y scheduling schemes.

[0050] In one embodiment, the "first adjustment method" is a strategy to optimize the initial scheduling scheme. The optimization rule is "beam change, outbound rate unchanged." That is, after adjustment, the outbound rate of the user frame's assigned outbound frame remains unchanged, but the beam in which the outbound frame is located changes, and the new beam must belong to the redundant beam of the user frame (to ensure communication reachability). This adjustment is used to balance the load of different beams through cross-beam allocation, avoiding overload of a single beam, while not affecting the transmission efficiency of the user frame (rate unchanged). For example, in an initial scheduling scheme, user frame #1 (outbound rate z Kbps, redundant beam 1 / 2) is assigned to a z Kbps outbound frame of beam 1. Through the first adjustment method, user frame #1 can be adjusted to a z Kbps outbound frame of beam 2 (the rate is still z Kbps, the beam changes from 1 to 2), while retaining the original allocation result of beam 1 in the initial scheduling scheme, generating an additional adjusted scheme.

[0051] In one embodiment, the "second adjustment method" is a strategy to optimize the initial scheduling scheme. The optimization rule is "beam unchanged, outbound rate reduced," meaning that after adjustment, the beam in which the user frame is assigned to the outbound frame remains unchanged, but the outbound rate of the outbound frame is reduced. This adjustment is used to avoid long-term idleness of high-rate outbound frames, while reserving more solution space for subsequent optimization and avoiding getting trapped in local optima. For example, in an initial scheduling scheme, user frame #1 (outbound rate z Kbps, current beam 1) is assigned to a z Kbps outbound frame of beam 1 (this outbound frame contains only one user frame #1, with a low load rate). Through the second adjustment method, it can be adjusted to a y Kbps outbound frame of beam 1 (beam unchanged, rate reduced from z to y, and y≤z), retaining the original scheme and generating an additional adjusted scheme.

[0052] In one embodiment, the "third adjustment method" is a strategy to optimize the initial scheduling scheme. The optimization rule is to "delay the outbound duration of one or more user frames." That is, after adjustment, the outbound duration of at least one user frame in a given initial scheduling scheme is delayed by a predetermined duration (e.g., 500 ms), and the delayed user frame needs to be put back into the outbound buffer to wait for the next scheduling. This adjustment is used to avoid a "fixed allocation order," prevent the scheme from getting stuck in local optima, and free up outbound resources for other user frames, thus balancing the overall waiting time. For example, in an initial scheduling scheme, user frames #1 (waiting time 100 ms) and #2 (waiting time 4000 ms) are both assigned to the x Kbps outbound frame of beam 1. This outbound frame needs to wait for the full frame before leaving the station (estimated to take another 1000 ms). Through the third adjustment method, the outbound time of #1 can be delayed by 500 ms (put back into the outbound buffer), allowing #2 to leave the station with the current outbound frame first, avoiding the waiting time of #2 from exceeding the upper limit of "D1=5000 ms" in the appendix. At the same time, the original scheme is retained and an additional adjusted scheme is generated.

[0053] In one embodiment, after each iteration, the selected Y high-quality adjustment schemes, along with the N initial scheduling schemes and any NY initial scheduling schemes included in the N+PY scheduling schemes (excluding the Y initial schemes) from the P scheduling schemes, are collectively formed into the N initial schemes for the next iteration. This process "retains high-quality solutions and supplements basic solutions," ensuring that the iteration converges towards the optimal direction while avoiding the loss of scheme diversity and getting trapped in local optima due to over-selection. For example, with 200 (N=200) initial scheduling schemes, 200 (M=200) adjusted scheduling schemes are generated through the first adjustment method, 100 (Q=100) adjusted scheduling schemes are generated through the second adjustment method, and 100 (K=100) adjusted scheduling schemes are generated through the third adjustment method. From the 400 adjusted scheduling schemes, 150 (P=150) adjusted scheduling schemes are arbitrarily selected. Based on the 150 adjusted scheduling schemes and the 200 initial scheduling schemes, 150 (Y=150) scheduling schemes that satisfy preset rules are determined. From the 200 initial scheduling schemes and 150 adjusted scheduling schemes, excluding the 150 schemes that satisfy the preset rules, any 50 scheduling schemes are selected from the remaining 200 (N+PY=50) schemes. These 50 schemes, along with the 150 adjusted and initial schemes, are used to determine the 150 schemes that satisfy the preset rules, forming the 200 initial scheduling schemes for the next iteration. The 150 high-quality adjusted schemes are retained, representing the current optimal direction; 50 additional basic solutions are randomly selected from the 200 schemes to ensure scheme diversity; these two groups together form the 200 initial scheduling schemes for the next iteration.

[0054] In an exemplary embodiment, determining Y scheduling schemes that satisfy preset rules from a first set includes: determining Y scheduling schemes whose outbound resources are greater than a second resource threshold from the first set based on the outbound resources of each of the adjusted scheduling schemes, wherein the outbound resources of each adjusted scheduling scheme are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the adjusted scheduling scheme.

[0055] In one embodiment, the second resource threshold is determined by the following formula for P scheduling schemes and N initial scheduling schemes. The threshold is determined after sorting. For example, if three scheduling schemes are selected from scheduling scheme 1 to scheduling scheme 5, the outbound resources of scheduling scheme 1 are first determined to be 50%, scheduling scheme 2 to be 60%, scheduling scheme 3 to be 70%, scheduling scheme 4 to be 80%, and scheduling scheme 5 to be 90%. Then, based on the outbound resources in ascending order, the second resource threshold is determined to be 60%. The specific values ​​involved in this embodiment are only used to illustrate the method of determining Y scheduling schemes and are not intended to limit this application.

[0056] In one exemplary embodiment, the preset conditions include at least one of the following: the number of times the above iterative operation is executed reaches a target number; the plurality of the above outbound frames include a target outbound frame whose outbound time is greater than a preset time; and the total duration of executing the above iterative operation reaches a target duration.

[0057] In one embodiment, outgoing frames must be scheduled before a preset "latest departure time"; otherwise, they may miss the satellite beam coverage window or cause user frame delays to exceed limits. If, during the iteration process, it is detected that the departure time of an outgoing frame has exceeded the "preset time" (i.e., if the current iteration continues, the outgoing frame may not be able to leave on time), the iteration is terminated immediately, and priority is given to ensuring the real-time transmission of outgoing frames. Here, the "target outgoing frame" is an outgoing frame that may not be able to leave on time during the iteration process.

[0058] In one embodiment, "the total duration of iterative operations reaching the target duration" is a termination condition set from the perspective of "computational resource constraints." That is, the iteration terminates when the cumulative time elapsed from the start of the iterative operation to the present reaches the pre-set "target duration." This condition is used to avoid the iterative process consuming too much computing power from the satellite gateway station, ensuring that the process of generating the scheduling scheme does not affect the normal operation of other system functions. For example, if a satellite gateway station allocates a maximum computing power duration of 100ms (target duration) to the outbound scheduling algorithm, if the iterative operation has accumulated 100ms, the iteration must be terminated even if the target number of iterations has not been reached and there are no timed-out outbound frames, to avoid excessive computing power consumption leading to delays in other beam scheduling.

[0059] In an exemplary embodiment, N initial scheduling schemes are obtained based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames. This includes: performing the following operations sequentially on each user frame obtained from the outbound buffer to obtain the N initial scheduling schemes: determining an outbound rate combination based on the outbound rates of multiple outbound frames, wherein the outbound rate combination includes the outbound rates of multiple second outbound frames, all of which belong to different target beams, and the target beams include the redundant beam; and allocating a third outbound frame to the user frame when the waiting time of the user frame in the outbound buffer is less than or equal to a first preset time, the multiple outbound frames include a third outbound frame, and the third outbound frame can carry the user frame, wherein the third outbound frame belongs to any one of the beams included in the redundant beams, the outbound rate of the third outbound frame is less than or equal to the outbound rate of the user frame, and the outbound rate combination includes the outbound rate of the third outbound frame.

[0060] In one embodiment, the "outbound buffer" is used to temporarily store the "data buffer" of user frames waiting to be outbound. The specific form of the outbound buffer can be a queue.

[0061] In one embodiment, the target beam is a beam provided by a satellite system.

[0062] In one embodiment, an "outbound rate combination" is a "beam-rate resource set" constructed to generate an initial scheduling scheme. This combination includes outbound rates for multiple second outbound frames, each belonging to a different target beam. It provides a "list of available rate-beam resources" for user frame allocation, ensuring that all satellite resources are not repeatedly traversed during the initial scheduling scheme generation, thus improving allocation efficiency. For example, a satellite system provides two beams: beam 1 and beam 2. Beam 1 has one y Kbps outbound frame, and beam 2 has one x Kbps outbound frame and one z Kbps outbound frame. Outbound rate combinations include, but are not limited to: Outbound rate combination 1: beam 1 - y Kbps outbound frame, beam 2 - x Kbps outbound frame; Outbound rate combination 2: beam 1 - y Kbps outbound frame, beam 2 - z Kbps outbound frame.

[0063] In one embodiment, the "third outbound frame" is the "specific outbound frame" that is finally allocated to the user frame when the initial scheduling scheme is generated. It must simultaneously satisfy the following conditions: the third outbound frame belongs to the redundant beam of the user frame; the outbound rate of the third outbound frame is less than or equal to the outbound rate of the user frame; and the user frame does not need to leave the station in a hurry, that is, the waiting time in the outbound buffer is less than or equal to the first preset time.

[0064] In one embodiment, a method for generating N initial scheduling schemes is as follows: Figure 3As shown, it includes the following steps:

[0065] Step S302: Randomly select an outgoing rate combination for all target beams. For example, the satellite system provides two beams: beam 1 and beam 2, where beam 1 has one y Kbps outgoing frame and beam 2 has one x Kbps outgoing frame and one z Kbps outgoing frame. Outgoing rate combinations include, but are not limited to: Outgoing rate combination 1: beam 1 - y Kbps outgoing frame, beam 2 - x Kbps outgoing frame; Outgoing rate combination 2: beam 1 - y Kbps outgoing frame, beam 2 - z Kbps outgoing frame. Randomly select outgoing rate combination 1: beam 1 - y Kbps outgoing frame, beam 2 - x Kbps outgoing frame.

[0066] Step S304: Determine whether the outbound rate combination has been selected. If yes, proceed to step S302; otherwise, proceed to step S306.

[0067] Step S306: Select a user frame from the outbound buffer and randomly select a beam from the redundant beams of the user frame. For example, the outbound buffer includes user frame #1 (outbound rate x Kbps, redundant beam 1), user frame #2 (outbound rate y Kbps, redundant beam 1 / 2), and user frame #3 (outbound rate z Kbps, redundant beam 2). Select user frame #2 from the buffer. If the waiting time of user frame #2 exceeds a first preset time, then directly schedule the inbound and outbound frames; otherwise, randomly select beam 2 according to the redundant beams of user frame #2.

[0068] Step S308: Assign an outbound frame under the specified beam to the user frame. For example, assign a 2-xKbps outbound frame under beam 2 to user frame #2.

[0069] Step S310: Determine whether the outbound frame capacity is exceeded. If yes, proceed to step S312; otherwise, proceed to step S306.

[0070] Step S312: Determine if the number of failures is greater than 100. If yes, proceed to step S316; otherwise, proceed to step S314.

[0071] Step S314: If the outbound frame capacity is exceeded, increment the failure count by 1, and then proceed to step S306.

[0072] Step S316: Generate an initial scheduling scheme.

[0073] Step S318: Determine whether the number of currently generated initial scheduling schemes has reached 500. If yes, proceed to step S320; otherwise, proceed to step S302.

[0074] Step S320, End.

[0075] In an exemplary embodiment, if the waiting time of the user frame in the outbound buffer is greater than the first preset time, the user frame is added to the fourth outbound frame so that the user frame can be outbound through the fourth outbound frame. The fourth outbound frame belongs to any one of the target beams, and the outbound rate of the fourth outbound frame is less than or equal to the outbound rate of the user frame.

[0076] In one embodiment, once a user frame waits in the outbound buffer for more than a first preset time, the user frame is directly scheduled into the outbound frame without considering other factors; if any user frame in an outbound frame has not left the station after waiting for more than a second preset time, it is directly scheduled to leave the station. The first preset time is the maximum waiting time of a user frame in the outbound buffer, and the second preset time is the maximum waiting time from when the user frame enters the outbound frame to when it is actually scheduled to leave the station.

[0077] In one embodiment, the "fourth outbound frame" is an "emergency scheduling carrier" designed for user frames with a "waiting time > first preset time," and does not need to participate in the random allocation of the initial scheduling scheme or subsequent iterative optimization. For example, if user frame #1 (outbound rate z Kbps, target beam 1 / 2, waiting in the outbound buffer for 2500ms, first preset time 2000ms) triggers a timeout, at this time, the z Kbps outbound frame of beam 2 (current load 60%, generated in 100ms) meets the conditions and is determined as the fourth outbound frame, and #1 is directly added to this frame for fast outbound.

[0078] In an exemplary embodiment, determining a target scheduling scheme with a target outbound resource greater than a first preset resource threshold from N first scheduling schemes based on the outbound resources of each of the first scheduling schemes includes: determining a first outbound resource, a second outbound resource, a third outbound resource, and a fourth outbound resource for each of the first scheduling schemes, wherein the first outbound resource is determined based on the number of user frames included in each outbound frame of the first scheduling scheme, the second outbound resource is determined based on the amount of data outbound per unit time of each outbound frame of the first scheduling scheme, the third outbound resource is determined based on the average outbound waiting time of the user frames in the outbound frames of the first scheduling scheme, and the fourth outbound resource is determined based on the number of bits in each outbound frame of the first scheduling scheme; determining the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource; and determining the first scheduling scheme corresponding to the target outbound resource as the target scheduling scheme.

[0079] In one exemplary embodiment, the first outbound resource is determined by the following formula. : Among them, the above The above-mentioned number and value of user frames transmitted per unit time for all outbound frames in the first scheduling scheme described above. This represents the minimum sum of the number and value of user frames transmitted per unit time for all outbound frames in N of the above-mentioned first scheduling schemes. The maximum number and value of user frames transmitted per unit time for all outbound frames in N of the first scheduling schemes described above; the second outbound resource is determined by the following formula. : Among them, the above This is used to represent the amount and value of outbound data transmitted by all outbound frames within a unit of time in the first scheduling scheme described above. This is used to represent the minimum data volume and value of all outgoing frames transmitted per unit time in N of the above first scheduling schemes. This represents the maximum data volume and value transmitted per unit time for all outbound frames in the N first scheduling schemes described above; the third outbound resource is determined by the following formula. : Among them, the above The reciprocal of the average of the average departure waiting times for all the aforementioned outbound frames in the first scheduling scheme described above. The minimum average of the average outbound waiting times for all outbound frames in the N first scheduling schemes described above is used to represent the fourth outbound resource; the fourth outbound resource is determined by the following formula. : Among them, the above The above It is the first scheduling scheme mentioned above. The number of bits in the aforementioned outbound frames. For the expected number of bits in all the aforementioned outbound frames in the first scheduling scheme described above, the aforementioned It is determined based on the number of bits in the outbound frames of the above-mentioned N first scheduling schemes and the expected minimum standard deviation.

[0080] In an exemplary embodiment, determining the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource includes: determining the target outbound resource using the following formula: ,in, , These are the weights of the first, second, third, and fourth outbound resources, respectively.

[0081] In one embodiment, the first outbound resource is determined based on the number of user frames included in each outbound frame. A higher number of user frames in an outbound frame (within the frame capacity limit) indicates a more compact load and more efficient resource utilization, resulting in a higher quantization value for the first outbound resource. For example, a z Kbps outbound frame from beam 1 (maximum capacity of 8 user frames) and an x ​​Kbps outbound frame from beam 2 (maximum capacity of 8 user frames) contain 6 and 3 user frames respectively in the first scheduling scheme A, and 3 and 1 user frames respectively in the first scheduling scheme B. For the first scheduling scheme A, the sum of the number of user frames transmitted by all outbound frames per unit time is 9; for the first scheduling scheme B, the sum of the number of user frames transmitted by all outbound frames per unit time is 4. Therefore, the first outbound resource for the first scheduling scheme A is 1, and the first outbound resource for the first scheduling scheme B is 0.

[0082] In one embodiment, the second outbound resource is determined based on the amount of data transmitted per unit time for each outbound frame. The larger the amount of data transmitted per unit time, the more fully the link resources are utilized, and the higher the quantization value of the second outbound resource. For example, in the first scheduling scheme C, the outbound frame of beam 1 with a theoretical rate of y Kbps actually transmits 0.9y Kbps of data per unit time, and the outbound frame of beam 2 with a theoretical rate of y Kbps actually transmits 0.9y Kbps of data per unit time; in the first scheduling scheme D, the outbound frame of beam 1 with a theoretical rate of y Kbps actually transmits 0.5y Kbps, and the actual transmission of beam 2 is 0.5y Kbps. Therefore, the second outbound resource of the first scheduling scheme C is 1, and the second outbound resource of the first scheduling scheme D is 0.

[0083] In one embodiment, the "third outbound resource" is determined based on the reciprocal of the average outbound waiting time of user frames in outbound frames. It directly reflects the user's perceived "communication latency." The shorter the average waiting time, the better the user experience, and the higher the quantified value of the third outbound resource (negatively correlated with the waiting time). For example, in the first scheduling scheme E, the average outbound waiting time of yKbps outbound frames of beam 1 is 800ms, and the average outbound waiting time of yKbps outbound frames of beam 2 is 800ms; in the first scheduling scheme F, the average outbound waiting time of yKbps outbound frames of beam 1 is 2000ms, and the average outbound waiting time of yKbps outbound frames of beam 2 is 2000ms. Therefore, the average outbound waiting time of all outbound frames in the first scheduling scheme E is 800ms, and the average outbound waiting time of all outbound frames in the first scheduling scheme F is 2000ms. Thus, the third outbound resource of the first scheduling scheme E is 1, and the third outbound resource of the first scheduling scheme F is 0.4.

[0084] In one embodiment, the "fourth outbound resource" is determined based on the number of bits in each outbound frame. The smaller the difference in the total number of bits in outbound frames under different beams, the more balanced the beam load, and the higher the quantization value of the fourth outbound resource (which is negatively correlated with the load variance).

[0085] The satellite beam outbound scheduling method in this application embodiment will be explained below with reference to optional examples.

[0086] like Figure 4 As shown, a Geostationary Earth Orbit (GEO) satellite system includes three target beams: beam 1, beam 2, and beam 3. Each target beam has three outbound rates. Each outbound rate orchestrates user frames corresponding to multiple user service requests into a single outbound frame. Each outbound frame needs to choose one of the three rates for outbound processing, thus requiring the outbound frame to be loaded as much as possible. The queue of user frames awaiting outbound processing (i.e., the outbound buffer) contains different user frames, each with different outbound arrangement options. For example, user frame #1 can be scheduled for outbound processing on beam 1 or beam 2, and its maximum outbound rate can be z Kbps. Therefore, there are three outbound rate options: x Kbps or y Kbps. The locally optimal solution is z Kbps. The specific beam and outbound frame selection depends on various factors.

[0087] This embodiment uses the following five objectives as an example for illustration: outbound throughput, load share, maximum outbound latency, average latency, and inter-beam load balancing. Figure 5 As shown, it includes the following steps:

[0088] Step S502, reduce similar targets in the high-dimensional target: First, reduce the 5 targets. The maximum outbound delay can be used as a baseline. For example, the maximum outbound delay of a user frame is D. Decompose D into D1+D2, where D=D1+D2. D1 is the maximum waiting time of a user frame in the outbound buffer, and D2 is the maximum waiting time from when the user frame enters the outbound frame to when it is actually scheduled to leave the station.

[0089] When performing high-dimensional multi-objective optimization, the maximum outbound delay is given priority. Once the waiting time of a user frame in the outbound buffer exceeds D1, it is directly scheduled into the outbound frame without considering the other four objectives. If the waiting time of any user frame in an outbound frame exceeds D2 and it has not yet left the station, it is directly scheduled to leave the station.

[0090] Step S504: Establish a normalized evaluation mechanism for the reduced objectives.

[0091] Establish a unified individual evaluation rule, using a rating formula: Determine the final target scheduling scheme, in which, , The weights can be 37.5%, 30%, 12.5%, and 20%, respectively. The normalized evaluation index for throughput is calculated using the following formula: The normalized evaluation index calculation formula for load percentage is as follows: The normalized evaluation index for average waiting time is calculated as follows: The beam load balancing index is calculated using standard deviation. ,in , It is the first Number of bits in each outbound frame This represents the expected number of outgoing frame bits for each beam.

[0092] Step S506: Generate 500 different initial scheduling schemes, generated as follows: Figure 3 As shown.

[0093] Step S508: Randomly adjust 500 different initial scheduling schemes: schedule a user frame from an outgoing frame of the current beam to an outgoing frame of the same rate of another beam to obtain the first scheduling scheme.

[0094] Step S510: With a small probability, perform the following scheduling on any one or more of the 500 different initial scheduling schemes to obtain the first scheduling scheme: schedule a user frame from the outgoing frame of the current beam to a low-rate outgoing frame of the same beam.

[0095] Step S512: With a small probability, perform the following scheduling on any one or more of the 500 different initial scheduling schemes to obtain the first scheduling scheme: remove a user frame from the outbound frame and put it back into the outbound buffer to wait for the next outbound.

[0096] Step S514: Score the multiple scheduling schemes included in the first scheduling scheme and the initial scheduling scheme according to the evaluation formula, and select the top 100 scheduling schemes. Then, determine the 500 scheduling schemes for the next iteration operation by combining the initial scheduling scheme and any 400 scheduling schemes included in the multiple scheduling schemes excluding the selected top 100 scheduling schemes, along with the selected top 100 scheduling schemes.

[0097] Step S516, iterate through steps S508-S514 until the departure time arrives or no better departure scheduling scheme is found after 100 iterations.

[0098] Step S518: Select the optimal target scheduling scheme according to the evaluation rules.

[0099] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0100] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as read-only memory (ROM) / random access memory (RAM), magnetic disk, optical disk), and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0101] According to another aspect of the embodiments of this application, a satellite beam outgoing scheduling device is provided. This device can be used to implement the satellite beam outgoing scheduling method provided in the above embodiments, and details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0102] Figure 6This is a structural block diagram of an optional satellite beam outbound scheduling device according to an embodiment of this application, including: a memory 604, a processor 606, and a computer program stored in and executable on the memory. When the processor 606 executes the computer program, it performs the following operations: determining N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, wherein the first scheduling scheme is used to indicate the allocation method of assigning the outbound frames to each user frame, and in the first scheduling scheme, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame assigned to the first user frame. The rate, wherein the first user frame is any frame among the plurality of user frames, the first outbound frame is any frame among the plurality of outbound frames, and N is a positive integer; based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme is determined from the N of the first scheduling schemes, wherein the target outbound resources of the target scheduling scheme are greater than a first preset resource threshold, and the outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each of the user frames and the load status of each of the outbound frames after the outbound frames are allocated according to the allocation method indicated by the first scheduling scheme; the plurality of user frames are outbound according to the target scheduling scheme.

[0103] When the processor executes the computer program, it can determine N first scheduling schemes based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames in the following manner: Based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames, N initial scheduling schemes are obtained, wherein the redundant beam is used to carry outbound frames capable of carrying the user frames outbound, and the outbound resources of the initial scheduling schemes are less than the outbound resources of the first scheduling schemes; based on the N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames, N first scheduling schemes are determined.

[0104] When the processor executes the computer program, it can determine N first scheduling schemes based on N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames in the following manner: Repeatedly performing the following iterative operations until a preset condition is met, and determining the scheduling scheme obtained from the last iteration as N first scheduling schemes: Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, adjusting M of the N initial scheduling schemes according to a first adjustment method; while retaining M scheduling schemes, generating an additional M adjusted scheduling schemes, wherein after adjustment, the beam of the outbound frame assigned to the same user frame changes, and the outbound rate remains unchanged, and M is an integer less than or equal to N; Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, adjusting Q of the N initial scheduling schemes according to a second adjustment method; while retaining Q scheduling schemes, generating an additional M adjusted scheduling schemes. Q adjusted scheduling schemes are generated externally, wherein after adjustment, the beam in which the outgoing frame assigned to the same user frame is located remains unchanged, and the outgoing rate is reduced, and Q is an integer less than or equal to N; K scheduling schemes from the N initial scheduling schemes are adjusted according to the third adjustment method, and K additional adjusted scheduling schemes are generated while retaining K scheduling schemes, wherein after adjustment, the outgoing duration of at least one user frame in a scheduling scheme is delayed by a predetermined duration, and N is an integer less than or equal to N; Y scheduling schemes satisfying preset rules are determined from the first set, wherein the first set includes any P scheduling schemes from the M+Q+K adjusted scheduling schemes and N initial scheduling schemes, and Y is an integer less than N; the Y scheduling schemes and any NY scheduling schemes included in the second set are determined as N initial scheduling schemes in the next iteration operation, wherein the second set includes N initial scheduling schemes and N+PY scheduling schemes from the P scheduling schemes excluding the Y scheduling schemes.

[0105] When the processor executes the computer program, it can determine Y scheduling schemes that satisfy preset rules from the first set in the following way: based on the outbound resources of each of the adjusted scheduling schemes, it determines Y scheduling schemes from the first set whose outbound resources are greater than a second resource threshold, wherein the outbound resources of each adjusted scheduling scheme are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the adjusted scheduling scheme.

[0106] In one exemplary embodiment, the preset conditions include at least one of the following: the number of times the above iterative operation is executed reaches a target number; the plurality of the above outbound frames include a target outbound frame whose outbound time is greater than a preset time; and the total duration of executing the above iterative operation reaches a target duration.

[0107] When the processor executes the computer program, it can obtain N initial scheduling schemes based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames in the following manner: For each user frame obtained from the outbound buffer, the following operations are performed sequentially to obtain N initial scheduling schemes: Based on the outbound rates of multiple outbound frames, a combination of outbound rates is determined, wherein the combination of outbound rates includes the outbound rates of multiple second outbound frames, all of which belong to different target beams, and the target beams include the redundant beam; When the waiting time of the user frame in the outbound buffer is less than or equal to a first preset time, and the multiple outbound frames include a third outbound frame, and the third outbound frame can carry the user frame, a third outbound frame is allocated to the user frame, wherein the third outbound frame belongs to any beam included in the redundant beams, the outbound rate of the third outbound frame is less than or equal to the outbound rate of the user frame, and the combination of outbound rates includes the outbound rate of the third outbound frame.

[0108] When the processor executes the computer program, it can add the user frame to the fourth outbound frame if the waiting time of the user frame in the outbound buffer is greater than the first preset time, so that the user frame can be outbound through the fourth outbound frame. The fourth outbound frame belongs to any one of the target beams, and the outbound rate of the fourth outbound frame is less than or equal to the outbound rate of the user frame.

[0109] When the processor executes the computer program, it can determine the outbound resources based on each of the first scheduling schemes and identify a target scheduling scheme from N first scheduling schemes whose target outbound resources are greater than a first preset resource threshold in the following manner: determining the first outbound resources, second outbound resources, third outbound resources, and fourth outbound resources for each of the first scheduling schemes, wherein the first outbound resources are determined based on the number of user frames included in each outbound frame of the first scheduling scheme, the second outbound resources are determined based on the amount of data outbound per unit time of each outbound frame of the first scheduling scheme, the third outbound resources are determined based on the average outbound waiting time of the user frames in the outbound frames of the first scheduling scheme, and the fourth outbound resources are determined based on the number of bits in each outbound frame of the first scheduling scheme; determining the target outbound resources based on the first outbound resources, the second outbound resources, the third outbound resources, and the fourth outbound resources; and determining the first scheduling scheme corresponding to the target outbound resources as the target scheduling scheme.

[0110] When the processor executes the computer program, it can determine the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource for each of the first scheduling schemes in the following ways: determining the first outbound resource using the following formula. : Among them, the above The above-mentioned number and value of user frames transmitted per unit time for all outbound frames in the first scheduling scheme described above. This represents the minimum sum of the number and value of user frames transmitted per unit time for all outbound frames in N of the above-mentioned first scheduling schemes. The maximum number and value of user frames transmitted per unit time for all outbound frames in N of the first scheduling schemes described above; the second outbound resource is determined by the following formula. : Among them, the above This is used to represent the amount and value of outbound data transmitted by all outbound frames within a unit of time in the first scheduling scheme described above. This is used to represent the minimum data volume and value of all outgoing frames transmitted per unit time in N of the above first scheduling schemes. This represents the maximum data volume and value transmitted per unit time for all outbound frames in the N first scheduling schemes described above; the third outbound resource is determined by the following formula. : Among them, the above The reciprocal of the average of the average departure waiting times for all the aforementioned outbound frames in the first scheduling scheme described above. The minimum average of the average outbound waiting times for all outbound frames in the N first scheduling schemes described above is used to represent the fourth outbound resource; the fourth outbound resource is determined by the following formula. : Among them, the above The above It is the first scheduling scheme mentioned above. The number of bits in the aforementioned outbound frames. For the expected number of bits in all the aforementioned outbound frames in the first scheduling scheme described above, the aforementioned It is determined based on the number of bits in the outbound frames of the above-mentioned N first scheduling schemes and the expected minimum standard deviation.

[0111] When the processor executes the computer program, it can determine the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource in the following way: The target outbound resource is determined using the following formula: ,in, , These are the weights of the first, second, third, and fourth outbound resources, respectively.

[0112] It should be noted that the above modules can be implemented by software or hardware. For the latter, they can be implemented in the following ways, but are not limited to: all the above modules are located in the same processor; or, the above modules are located in different processors in any combination.

[0113] According to another aspect of the embodiments of this application, a computer-readable storage medium is provided, the computer-readable storage medium including a stored program, wherein the program executes the steps in any of the above method embodiments when it is run.

[0114] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as USB flash drives, ROMs, RAMs, portable hard drives, magnetic disks, or optical disks.

[0115] According to another aspect of the embodiments of this application, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor. The processor is configured to perform the steps of any of the method embodiments described above via the computer program. In an exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0116] Specific examples in this embodiment can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0117] According to another aspect of the embodiments of this application, a computer program product is also provided, the computer program product including a computer program / instructions containing program code for performing the method shown in the flowchart.

[0118] Obviously, those skilled in the art should understand that the modules or steps of this application described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those described herein, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, this application is not limited to any particular combination of hardware and software.

[0119] The above are merely preferred embodiments of this application and are not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the principles of this application should be included within the protection scope of this application.

Claims

1. A satellite beam outbound scheduling method, characterized in that, include: Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, N first scheduling schemes are determined. The first scheduling scheme is used to indicate the allocation method of allocating the outbound frame to each user frame. In the first scheduling scheme, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame allocated to the first user frame. The first user frame is any frame among the multiple user frames, and the first outbound frame is any frame among the multiple outbound frames. N is a positive integer. Based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme is determined from N first scheduling schemes, wherein the target outbound resources of the target scheduling scheme are greater than a first preset resource threshold, and the outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the first scheduling scheme. Multiple user frames are dispatched according to the target scheduling scheme.

2. The method according to claim 1, characterized in that, Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, N first scheduling schemes are determined, including: Based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames, N initial scheduling schemes are obtained, wherein the redundant beam is used to carry outbound frames capable of carrying the user frames outbound, and the outbound resources of the initial scheduling scheme are less than the outbound resources of the first scheduling scheme. Based on N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames, N first scheduling schemes are determined.

3. The method according to claim 2, characterized in that, Based on N initial scheduling schemes, the outbound rates of multiple user frames, and the outbound rates of multiple outbound frames, N first scheduling schemes are determined, including: Repeat the following iterative operation until the preset condition is met, and determine the scheduling scheme obtained from the last iteration as N first scheduling schemes: Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, M scheduling schemes out of N initial scheduling schemes are adjusted according to the first adjustment method. While retaining M scheduling schemes, M additional adjusted scheduling schemes are generated. After adjustment, the beam in which the outbound frame assigned to the same user frame is located changes, while the outbound rate remains unchanged. M is an integer less than or equal to N. Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, Q scheduling schemes out of N initial scheduling schemes are adjusted according to the second adjustment method. While retaining Q scheduling schemes, Q additional adjusted scheduling schemes are generated. After adjustment, the beam in which the outbound frame assigned to the same user frame is located remains unchanged, and the outbound rate is reduced. Q is an integer less than or equal to N. Adjust K of the N initial scheduling schemes according to the third adjustment method. While retaining K scheduling schemes, generate K additional adjusted scheduling schemes. After adjustment, at least one user frame in a scheduling scheme will have its outbound time delayed by a predetermined time. N is an integer less than or equal to N. From the first set, Y scheduling schemes that satisfy preset rules are determined, wherein the first set includes any P scheduling schemes from M+Q+K adjusted scheduling schemes and N initial scheduling schemes, and Y is an integer less than N; The Y scheduling schemes and any NY scheduling schemes included in the second set are determined as the N initial scheduling schemes in the next iteration operation. The second set includes the N initial scheduling schemes and N+PY scheduling schemes from the P scheduling schemes excluding the Y scheduling schemes.

4. The method according to claim 3, characterized in that, From the first set, Y scheduling schemes that satisfy preset rules are determined, including: Based on the outbound resources of each of the adjusted scheduling schemes, Y scheduling schemes with outbound resources greater than the second resource threshold are determined from the first set. The outbound resources of each adjusted scheduling scheme are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the adjusted scheduling scheme.

5. The method according to claim 3, characterized in that, The preset conditions include at least one of the following: The number of times the iterative operation is performed reaches the target number; The plurality of outbound frames include a target outbound frame whose outbound time is greater than a preset time; The total time for performing the iterative operation reaches the target time.

6. The method according to claim 2, characterized in that, Based on the outbound rate of each user frame, the redundant beam of each user frame, and the outbound rates of multiple outbound frames, N initial scheduling schemes are obtained, including: Perform the following operations sequentially on each user frame retrieved from the outbound buffer to obtain N initial scheduling schemes: Based on the outbound rates of multiple outbound frames, an outbound rate combination is determined, wherein the outbound rate combination includes the outbound rates of multiple second outbound frames, each of which belongs to a different target beam, and the target beam includes the redundant beam. If the waiting time of the user frame in the outbound buffer is less than or equal to a first preset time, and the third outbound frame is included among the multiple outbound frames, and the third outbound frame is capable of carrying the user frame, then the third outbound frame is allocated to the user frame. The third outbound frame belongs to any one of the redundant beams, the outbound rate of the third outbound frame is less than or equal to the outbound rate of the user frame, and the outbound rate combination includes the outbound rate of the third outbound frame.

7. The method according to claim 6, characterized in that, The method further includes: If the waiting time of the user frame in the outbound buffer is greater than the first preset time, the user frame is added to the fourth outbound frame so that the user frame can be outbound through the fourth outbound frame. The fourth outbound frame belongs to any one of the target beams, and the outbound rate of the fourth outbound frame is less than or equal to the outbound rate of the user frame.

8. The method according to claim 1, characterized in that, Based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme with target outbound resources greater than a first preset resource threshold is determined from the N first scheduling schemes, including: A first outbound resource, a second outbound resource, a third outbound resource, and a fourth outbound resource are determined for each of the first scheduling schemes. The first outbound resource is determined based on the number of user frames included in each outbound frame of the first scheduling scheme. The second outbound resource is determined based on the amount of data outbound per unit time in each outbound frame of the first scheduling scheme. The third outbound resource is determined based on the average outbound waiting time of the user frames in the outbound frames of the first scheduling scheme. The fourth outbound resource is determined based on the number of bits in each outbound frame of the first scheduling scheme. The target outbound resource is determined based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource; The first scheduling scheme corresponding to the target outbound resource is determined as the target scheduling scheme.

9. The method according to claim 8, characterized in that, Determine the first outbound resource, second outbound resource, third outbound resource, and fourth outbound resource for each of the first scheduling schemes, including: The first outbound resource is determined by the following formula. : , wherein The number and value of user frames transmitted by all outbound frames within a unit time in the first scheduling scheme are used to represent the total number and value of such user frames. This represents the minimum sum of the number and value of user frames transmitted per unit time for all outbound frames in N of the first scheduling schemes. This represents the maximum number and value of user frames transmitted by all outbound frames within a unit time in N of the first scheduling schemes; The second outbound resource is determined using the following formula. : , wherein This is used to represent the amount and value of outbound data transmitted by all outbound frames within a unit time in the first scheduling scheme. This is used to represent the minimum sum of data transmitted per unit time for all outbound frames in N of the first scheduling schemes. This is used to represent the maximum amount and value of outbound data transmitted by all outbound frames within a unit time in N of the first scheduling schemes; The third outbound resource is determined using the following formula. : , wherein The reciprocal of the average outbound waiting time of all outbound frames in the first scheduling scheme. Used to represent the minimum average of the average outbound waiting time for all outbound frames in the N first scheduling schemes; The fourth outbound resource is determined using the following formula. : , wherein The It is the first scheduling scheme The number of bits in each of the outbound frames. The expected number of bits in all outgoing frames in the first scheduling scheme, the It is determined based on the number of bits in the outbound frames of the N first scheduling schemes and the expected standard deviation.

10. The method according to claim 8, characterized in that, Determining the target outbound resource based on the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource includes: The target outbound resource is determined using the following formula: ,in, , These are the weights of the first outbound resource, the second outbound resource, the third outbound resource, and the fourth outbound resource, respectively.

11. A satellite beam outbound scheduling device, comprising: A memory, a processor, and a computer program stored in and executable on the memory, characterized in that, when the processor executes the computer program, it performs the following operations: Based on the outbound rates of multiple user frames and the outbound rates of multiple outbound frames, N first scheduling schemes are determined. The first scheduling scheme is used to indicate the allocation method of allocating the outbound frame to each user frame. In the first scheduling scheme, the outbound rate of the first user frame is greater than or equal to the outbound rate of the first outbound frame allocated to the first user frame. The first user frame is any frame among the multiple user frames, and the first outbound frame is any frame among the multiple outbound frames. N is a positive integer. Based on the outbound resources of each of the first scheduling schemes, a target scheduling scheme is determined from N first scheduling schemes, wherein the target outbound resources of the target scheduling scheme are greater than a first preset resource threshold, and the outbound resources of each of the first scheduling schemes are determined based on the outbound waiting time of each user frame and the load status of each outbound frame after the outbound frames are allocated according to the allocation method indicated by the first scheduling scheme. Multiple user frames are dispatched according to the target scheduling scheme.

12. A computer program product comprising a computer program / instructions, characterized in that, When the computer program / instructions are executed by the processor, they implement the steps of the method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, wherein the computer program, when executed by a processor, implements the steps of the method described in any one of claims 1 to 10.

14. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes, it implements the steps of the method described in any one of claims 1 to 10.

Images