Non-terrestrial network service priority calculation method, scheduling method, equipment and medium
By calculating user and service priorities in non-terrestrial networks and combining latency and reliability characteristics, the problem of existing algorithms being unable to handle priority differences is solved, achieving efficient user scheduling and service priority decision-making, and improving the overall scheduling level of the network.
Patent Information
- Application Number
- CN202210480979.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-05-05
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2042-05-05
AI Technical Summary
Existing wireless communication scheduling algorithms cannot effectively handle the priority differences between different users and services in non-terrestrial networks, making it difficult to balance the urgency of scheduling high-priority users with the fairness of scheduling low-priority users. Furthermore, existing algorithms have shortcomings in terms of latency and quality of service factors.
A non-terrestrial network service priority calculation method is adopted. The priority of users and services is calculated by formula. Combining the characteristics of latency sensitivity and reliability sensitivity, a basic priority, packet loss factor, scheduling latency factor and minimum throughput factor are set to ensure the scheduling right of high-priority services and the fairness of low-priority services.
It improves the performance of scheduling algorithms for non-terrestrial network communication systems in terms of latency and different service priorities, ensures the priority scheduling rights of high-priority services and the minimum throughput requirements of low-priority services, and achieves fairness and efficiency among users.
Smart Images

Figure CN114980345B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of non-terrestrial network communications, and more specifically, to a non-terrestrial network service priority calculation method, scheduling method, device and medium. Background Art
[0002] With the development of wireless communication, people can communicate through terminals within the coverage of ground mobile networks. However, the coverage of ground mobile networks is limited. It is difficult to build stations in the ocean, deserts and some remote areas, and signals are difficult to cover. Realizing global and seamless coverage of communication services has become the main goal of the current wireless communication field. Typical non-ground networks such as communication networks composed of low-orbit satellite constellations can ensure that communications are accessible at any time and in any space in an open-air environment. From the perspective of communication accessibility and real-time performance, compared with ground networks, its advantages lie in "space-based" and "global coverage without blind spots". Specifically, satellite communication systems will bring great convenience in terms of airspace communication enhancement, blind area coverage of ground networks, communication enhancement in areas with sparse user density, and backup communication when natural disasters cause ground communication systems to be unavailable. While low-orbit satellite communication networks extend the communication range and facilitate people's work and life, how to provide a service experience that is no different from ground communication has become an urgent problem to be solved. A suitable multi-user mixed service priority calculation method can well determine the priorities between different users and different services, thereby differentially meeting the QoS requirements of various services of different users.
[0003] At present, the common scheduling algorithms on the ground include polling algorithm, maximum carrier-to-interference ratio algorithm, proportional fairness algorithm, resource scheduling algorithm based on status report prediction, variable maximum weighted delay priority algorithm, etc. The polling algorithm allocates resources to users with equal scheduling opportunity cycles, which ensures fairness while failing to ensure the urgency of scheduling for high-priority users; the maximum carrier-to-interference ratio algorithm allocates resources to users with the highest carrier-to-interference ratio first, which is not fair to marginal users; the proportional fairness algorithm is between the polling and maximum carrier-to-interference ratio algorithms, taking into account channel quality and historical traffic, but failing to reflect the priority differences between different services; the service model used by the resource scheduling algorithm based on user status report prediction is too idealistic and does not consider the service quality factor; the variable maximum weighted delay priority algorithm ignores the delay factor and the differentiated needs of different services for service priority.
[0004] Therefore, if the resource scheduling algorithms listed above are applied to non-terrestrial network communication systems, there is still room for improvement. Summary of the invention
[0005] The purpose of the present invention is to overcome the shortcomings of the prior art and provide a non-terrestrial network service priority calculation method, scheduling method, equipment and medium, which combines the user's service priority, service delay sensitivity or reliability sensitivity and other characteristics to further enhance the scheduling algorithm in terms of delay, different service priority levels, etc., and better improve the overall scheduling level of the network.
[0006] The object of the present invention is achieved through the following solutions:
[0007] A method for calculating the priority of non-terrestrial network services, characterized in that it comprises the following steps: using the following priority calculation formula to calculate the priority of non-terrestrial network services :
[0008]
[0009] Where:
[0010] Indicates Users;
[0011] Indicates the user's Business;
[0012] For Business The maximum tolerable delay;
[0013] is the packet loss factor. For delay-sensitive services, the timeout packet loss mechanism is used; for reliability-sensitive services, the packet loss mechanism is not activated.
[0014] For Business The basic priority factor of different types of services has different basic priorities, and the same type of services has the same basic priority.
[0015] Is a user i exist t The maximum rate at a given moment is proportional to the instantaneous channel quality of the user;
[0016] Is a user i exist t Historical average throughput at each moment;
[0017] Is a user Business The first packet waiting delay of the queue; for delay-sensitive services that allow packet loss, the waiting delay exceeds When the waiting time exceeds When , no packet loss processing is performed;
[0018] is the scheduling delay factor, which is exponentially proportional to the waiting scheduling time;
[0019] It is the minimum throughput factor, which is used to guarantee the minimum throughput requirement of low priority.
[0020] Furthermore, the basic priority factor The scheduler sets this value and binds it to the service attributes. The service is classified according to the service category. The higher the priority of the service, the higher the basic priority factor. The higher too.
[0021] Furthermore, the packet loss factor After obtaining the service attributes from the service module, the scheduler sets them as follows:
[0022]
[0023] When set to 0, the priority of the node will be 0, the priority of the node will be reduced to the end of the queue, the node will not be scheduled, and the action of discarding the timed-out service message will be triggered.
[0024] Furthermore, the scheduling delay factor ,in, Is a user Business The first packet waiting delay of the queue, the value range is .
[0025] Furthermore, the minimum throughput factor ,in:
[0026]
[0027] in For Business j A predefined minimum throughput, For users i of j The historical average throughput obtained within the service statistics window.
[0028] A non-terrestrial network service scheduling method comprises the following steps:
[0029] Step S1: Generate a queue for scheduling for services that do not meet the rate requirement;
[0030] Step S2: traverse each node to be scheduled in the queue to be scheduled, and obtain a parameter for calculating the priority of each node to be scheduled;
[0031] Step S3: Calculate the priority of each node to be scheduled according to the above method;
[0032] Step S4: After calculating the priority of each node to be scheduled, re-sort them according to the priority order;
[0033] Step S5: traverse the sorted queue to be scheduled, and determine the appropriate resource block size in the time-frequency code domain to be allocated to the node to be scheduled according to the channel quality and the data to be transmitted.
[0034] Furthermore, in step S2, the parameters are processed using any of the above methods and then used to perform priority calculation.
[0035] Further, in step S4, the priority order includes an order from high to low.
[0036] A computer device comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein when the processor executes the program, any of the above methods is implemented.
[0037] A readable storage medium stores a computer program, which, when executed by a processor, implements any of the methods described above.
[0038] The beneficial effects of the present invention include:
[0039] The embodiment of the present invention proposes a multi-user mixed service scheduling method in a non-terrestrial network communication system, which comprehensively considers multiple factors affecting the scheduling strategy, such as service attributes (delay sensitivity or reliability sensitivity), instantaneous channel throughput, historical average throughput, and minimum throughput, and is suitable for multi-user mixed service scheduling scenarios in non-terrestrial network communication systems.
[0040] The embodiment of the present invention guarantees the priority scheduling right of high-priority services by setting the basic priority; the proportional fairness concept is incorporated into the extended priority, and the minimum throughput guarantee mechanism is considered to prevent low-priority users of the same type of services from being "starved to death" in extreme cases. The algorithm exponentially enhances the delay factor to adapt to the characteristics of large delay of unidirectional links in non-terrestrial networks, and can well balance the priority scheduling right of high-priority users and the scheduling fairness of low-priority users.
[0041] The beneficial effects of the embodiments of the present invention are not limited to those described above, and will be described in conjunction with specific implementation methods. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0043] Figure 1 A calculation flow chart of a method for calculating a priority level of a non-terrestrial network service according to an embodiment of the present invention;
[0044] Figure 2 The present invention is a flowchart of an execution of a service priority scheduling method for a non-terrestrial network according to an embodiment of the present invention. DETAILED DESCRIPTION
[0045] The invention is further described below in conjunction with the accompanying drawings and embodiments. All features disclosed in all embodiments in this specification, or steps in all methods or processes disclosed implicitly, except for mutually exclusive features and / or steps, can be combined and / or expanded or replaced in any manner.
[0046] As one aspect of the present invention, a method for calculating the priority of non-terrestrial network services is proposed in an embodiment. Figure 1 As shown, an optional implementation method, the execution steps are as follows:
[0047] Step S1: Scheduler sets base priority This value is bound to the attributes of the service. It can be classified according to emergency services, voice, video, and general interactive services. The higher the priority of the service, the higher the basic priority should be.
[0048] Step S2: The scheduler obtains the service attributes from the service module and sets factor.
[0049]
[0050] When set to 0, the priority of the node will be 0, the priority of the node will be reduced to the end of the queue, and the node will not be scheduled. For interactive services that are sensitive to reliability, such as FTP downloads and web browsing, the requirements for latency are often not so strict, but the requirements for reliability are relatively high, and packet loss is not allowed. For real-time streaming services that are sensitive to latency, such as voice and video, these services are more sensitive to latency, but a certain amount of packet loss is allowed.
[0051] Step S3: Calculate the ratio of instantaneous channel throughput to historical average throughput .
[0052] in Is a user i exist t The maximum rate at a given moment is proportional to the instantaneous channel quality of the user; Is a user i exist t Historical average throughput at a given moment.
[0053] Step S4: Calculate the waiting scheduling delay factor .
[0054] in, Is a user Business The first packet waiting delay of the queue, the value range is Considering that the one-way delay in non-terrestrial networks such as low-orbit satellite communication systems is as high as tens of milliseconds, which is much longer than that on the ground, an exponential form is used to increase the weight of the waiting scheduling delay in the priority calculation.
[0055] Step S5: Calculate the minimum throughput factor ,in
[0056]
[0057] in For Business j A predefined minimum throughput, For users i of j The historical average throughput obtained within the service statistics window. i of j When the minimum throughput of a service does not meet the standard, this value will have a greater weight on the priority calculation. i of j When the minimum throughput of a service is met, its weight in priority calculation is reduced to 0. The purpose of introducing this value is to ensure that low-priority services can get scheduling opportunities, so that they will not be unable to be scheduled for a long time due to low priority. Through this factor, fairness is slightly tilted towards low-priority services.
[0058] The order of the above steps may be adjusted, for example, the minimum throughput factor may be calculated first, and any possible order adjustment is within the protection scope of the present invention.
[0059] Step S6: Through the above steps, the priority calculation formula is obtained as follows.
[0060]
[0061] In the above implementation, the mathematical symbols involved are explained as follows:
[0062] Indicates Users;
[0063] Indicates the user's Business;
[0064] For Business The maximum tolerable delay;
[0065] Is a user Business The first packet waiting delay of the queue. For delay-sensitive services that allow packet loss, the waiting delay exceeds When the waiting time exceeds No packet loss processing is performed.
[0066] For Business The basic priority factor of different types of services has different basic priorities, and the same type of services has the same basic priority.
[0067] is the packet loss factor. For delay-sensitive services, the timeout packet loss mechanism is used; for reliability-sensitive services, the packet loss mechanism is not activated.
[0068] Is a user i exist t The maximum rate at a given moment is proportional to the instantaneous channel quality of the user;
[0069] Is a user i exist t Historical average throughput at each moment;
[0070] is the scheduling delay factor, which is exponentially proportional to the waiting scheduling time;
[0071] It is the minimum throughput factor, which is used to guarantee the minimum throughput requirement of low priority.
[0072] As one of the embodiments of the present invention, the priority calculation formula proposed in step 6 of the implementation mode of the present invention may also be directly used to calculate the priority, and directly applying the above formula is within the protection scope of the present invention.
[0073] As one aspect of the present invention, a non-terrestrial network service scheduling method is proposed in an embodiment. Based on the above-mentioned priority calculation method, this method combines the user's service priority, delay sensitivity or reliability sensitivity of the service, and other characteristics to further enhance the scheduling method in terms of delay, different service priority levels, etc., and better improve the overall scheduling level of the network. Taking the multi-user mixed service scenario in the low-orbit satellite communication scenario as an example, the embodiment method of the invention is described in detail. The real-time example mainly discusses the priority decision mechanism between different types of services, the priority decision mechanism between the same type of services, the minimum throughput guarantee mechanism, and the targeted timeout packet loss mechanism for different services.
[0074] In a specific implementation, for each unit scheduling time, the possible scheduling process is as follows: Figure 2 As shown, the specific implementation includes the following steps:
[0075] Step 1: Generate a queue for scheduling for services that do not meet the rate requirement;
[0076] Step 2: Traverse each node in the queue to be scheduled, and obtain various parameters used to calculate the priority of each scheduling node, such as instantaneous channel quality, historical average throughput, queue first packet waiting delay, minimum throughput value, etc.;
[0077] Step 3: Perform priority calculation. The relevant calculation process is as follows.
[0078] Assume that there are 20 users to be scheduled at the current scheduling time. To facilitate the explanation of the algorithm decision-making process, only the first five users are used for explanation. Their respective services are shown in the following table.
[0079] Table 1 Users to be scheduled and their service categories
[0080]
[0081] The possible QoS requirements for each type of service are described in the following table.
[0082] Table 2 Services to be scheduled and their QoS types
[0083]
[0084] Step 4: After calculating the priority of each node to be scheduled, re-sort them in order from high to low priority.
[0085] Step 5: Traverse the sorted queue to be scheduled, and decide to allocate an appropriate resource block size in the time-frequency code domain to the node to be scheduled based on the channel quality and the data to be transmitted.
[0086] In the above scheduling process, the technical concept of the present invention to improve the existing solution is further explained:
[0087] 1. Priority decision-making mechanism between different types of businesses
[0088] For emergency services, voice, video, and general interactive services, the priority range of the services can be limited by the basic priority first. For similar services, the extended priority is then combined to ultimately determine which service has a higher priority.
[0089] As shown in Table 1 above, the emergency service priority of user A>the voice priority of users B / E>the video priority of users A / B / D>the general interactive service priority of user C.
[0090] By setting the basic priority, the priority of high-priority services is guaranteed. When the scheduling resources are sufficient, due to the role of the basic priority, resources will be scheduled in the order of emergency services, voice, video, and general interactive services. When the scheduling resources are congested, they will be satisfied in the order of the basic priority from high to low.
[0091] 2. Priority Decision Mechanism between Services of the Same Category
[0092] (1) User B and User E both have voice services. The basic priorities of their voice services are the same and can only be differentiated by extended priorities. It can be seen that the priority is proportional to the instantaneous channel quality and the first packet waiting delay, and inversely proportional to the maximum tolerable service delay and the historical average throughput. The maximum tolerable service delay of the two is the same, so the algorithm tends to give priority to users with good channel conditions. After users with relatively good channel conditions are satisfied, users with slightly worse channel conditions are satisfied.
[0093] (2) Both users A and B have video services, but the difference is that user A has on-demand video services, while user B has interactive video services. The basic priorities of the two are the same, which are proportional to the instantaneous channel quality and the first packet waiting delay, and inversely proportional to the maximum tolerable delay of the service and the historical average throughput. The maximum tolerable delay of on-demand video services is 100ms, and the maximum tolerable delay of interactive video services is 60ms. Therefore, when the instantaneous channel quality, first packet waiting delay, and historical average throughput are the same, the priority of interactive video services is greater than that of on-demand video services. Therefore, the scheduling needs of user B's interactive video services will be met first, and the scheduling needs of user A's on-demand video services will be met second.
[0094] 3. Minimum Throughput Guarantee Mechanism
[0095] (1) Both user A and user B have video services, the difference is that user A has on-demand video services, while user B has interactive video services. The basic priorities of the two are the same. The maximum tolerable delay of on-demand video services is 100ms, while the maximum tolerable delay of interactive video services is 60ms. Therefore, when the instantaneous channel quality, first packet waiting delay, historical average throughput, etc. are the same, the priority of interactive video services is greater than that of on-demand video services. When the predefined minimum throughput of on-demand video services is not met, Inversely proportional to the average throughput of the current business, it acts on the priority calculation formula to quickly increase the priority of its own business, thereby ensuring the minimum throughput requirement. When the minimum throughput requirement is met, the weight of this factor on the priority calculation is reduced to 0.
[0096] That is to say, although the interactive video service of user B has a higher priority than the on-demand video service of user A, when the on-demand video service of user A cannot be scheduled for a long time, The existence of this factor will lead to a priority surge process, thereby ensuring the minimum throughput requirement of user B's interactive video service.
[0097] 4. Targeted timeout and packet loss mechanisms for different services
[0098] (1) The common algorithm for scheduling packet loss is defined as exceeding The message is discarded. For Business The maximum tolerable delay. For some services, the higher layer has the reliability requirement of lossless transmission. After the scheduler discards it, it may be necessary to use higher-layer TCP retransmission or other retransmission mechanisms to ensure lossless transmission. Retransmission through the higher layer will increase the delay. For some delay-sensitive services, when the scheduler finds that the delay is too large, it should be discarded. Because such services are sensitive to delay, the delayed transmission of successful messages will affect the user experience of such services. Therefore, the more appropriate approach is that for high-reliability services, the scheduler cannot discard the message; for high-delay-sensitive services, the scheduler discards it according to the situation.
[0099] In the embodiment of the present invention, a packet loss factor is introduced ,
[0100]
[0101] For delay-sensitive services, when a timeout occurs, the priority of the service will be reduced to 0 and a discard action will be triggered. For reliability-sensitive services, the discard action will not be triggered, ensuring that the scheduler can dispatch the service as quickly as possible.
[0102] Example 1
[0103] A method for calculating the priority of non-terrestrial network services, comprising the steps of: using the following priority calculation formula to calculate the priority of non-terrestrial network services :
[0104]
[0105] Where:
[0106] Indicates Users;
[0107] Indicates the user's Business;
[0108] For Business The maximum tolerable delay;
[0109] is the packet loss factor. For delay-sensitive services, the timeout packet loss mechanism is used; for reliability-sensitive services, the packet loss mechanism is not activated.
[0110] For Business The basic priority factor of different types of services has different basic priorities, and the same type of services has the same basic priority.
[0111] Is a user i exist t The maximum rate at a given moment is proportional to the instantaneous channel quality of the user;
[0112] Is a user i exist t Historical average throughput at each moment;
[0113] Is a user Business The first packet waiting delay of the queue; for delay-sensitive services that allow packet loss, the waiting delay exceeds When the waiting time exceeds When , no packet loss processing is performed;
[0114] is the scheduling delay factor, which is exponentially proportional to the waiting scheduling time;
[0115] It is the minimum throughput factor, which is used to guarantee the minimum throughput requirement of low priority.
[0116] Example 2
[0117] Based on Example 1, the basic priority factor The scheduler sets this value and binds it to the service attributes. The service is classified according to the service category. The higher the priority of the service, the higher the basic priority factor. The higher too.
[0118] Example 3
[0119] Based on Example 1, the packet loss factor After obtaining the service attributes from the service module, the scheduler sets them as follows:
[0120]
[0121] When set to 0, the priority of the node will be 0, the priority of the node will be reduced to the end of the queue, the node will not be scheduled, and the action of discarding the timed-out service message will be triggered.
[0122] Example 4
[0123] Based on Example 1, the scheduling delay factor ,in, Is a user Business The first packet waiting delay of the queue, the value range is .
[0124] Example 5
[0125] Based on Example 1, the minimum throughput factor ,in:
[0126]
[0127] in For Business j A predefined minimum throughput, For users i of j The historical average throughput obtained within the service statistics window.
[0128] Example 6
[0129] A non-terrestrial network service scheduling method comprises the following steps:
[0130] Step S1: Generate a queue for scheduling for services that do not meet the rate requirement;
[0131] Step S2: traverse each node to be scheduled in the queue to be scheduled, and obtain a parameter for calculating the priority of each node to be scheduled;
[0132] Step S3: Calculate the priority of each node to be scheduled according to the method described in Example 1;
[0133] Step S4: After calculating the priority of each node to be scheduled, re-sort them according to the priority order;
[0134] Step S5: traverse the sorted queue to be scheduled, and determine the appropriate resource block size in the time-frequency code domain to be allocated to the node to be scheduled according to the channel quality and the data to be transmitted.
[0135] Example 7
[0136] Based on Example 6, in step S2, the parameters are processed using any of the methods described in Example 2 to Example 5 and then used to perform priority calculation.
[0137] Example 8
[0138] Based on Embodiment 6, in step S4, the priority order includes an order from high to low.
[0139] Implementation 9
[0140] A computer device comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein when the processor executes the program, a method as described in any one of Embodiments 1 to 8 is implemented.
[0141] Example 10
[0142] A readable storage medium stores a computer program, which, when executed by a processor, implements the method described in any one of Examples 1 to 8.
[0143] The units involved in the embodiments of the present invention may be implemented by software or hardware, and the units described may also be arranged in a processor. The names of these units do not, in some cases, limit the units themselves.
[0144] According to one aspect of the present application, a computer program product or a computer program is provided, the computer program product or the computer program comprising computer instructions, the computer instructions being 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, so that the computer device executes the methods provided in the above-mentioned various optional implementations.
[0145] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiment.
[0146] The parts not involved in the present invention are the same as the prior art or can be implemented by using the prior art.
[0147] The above technical solution is only one implementation mode of the present invention. For those skilled in the art, it is easy to make various types of improvements or modifications based on the application methods and principles disclosed in the present invention, and it is not limited to the method described in the above specific implementation mode of the present invention. Therefore, the method described above is only preferred and does not have a restrictive meaning.
[0148] In addition to the above examples, those skilled in the art may obtain other embodiments based on the above disclosure or by using the knowledge or technology in the relevant field to make changes. The features of each embodiment may be interchangeable or replaced. The changes and modifications made by those skilled in the art do not depart from the spirit and scope of the present invention and should be within the scope of protection of the claims attached to the present invention.
Claims
1. A method for calculating the priority of non-terrestrial network services, characterized in that: The steps include: using the following priority calculation formula to calculate the non-terrestrial network service priority : Where: Indicates Users; Indicates the user's Business; For Business The maximum tolerable delay; is the packet loss factor. For delay-sensitive services, the timeout packet loss mechanism is used; for reliability-sensitive services, the packet loss mechanism is not activated. For Business The basic priority factor of different types of services has different basic priorities, and the same type of services has the same basic priority. Is a user i exist t The maximum rate at a given moment is proportional to the instantaneous channel quality of the user; Is a user i exist t Historical average throughput at each moment; Is a user Business The first packet waiting delay of the queue; for delay-sensitive services that allow packet loss, the waiting delay exceeds When the waiting time exceeds When , no packet loss processing is performed; is the scheduling delay factor, which is exponentially proportional to the waiting scheduling time; is the minimum throughput factor, which is used to guarantee the minimum throughput requirement of low priority; The minimum throughput factor ,in: in For Business j A predefined minimum throughput, For users i of j The historical average throughput obtained within the service statistics window.
2. The method for calculating the priority of non-terrestrial network services according to claim 1, characterized in that: The basic priority factor The scheduler sets this value and binds it to the attributes of the service. The service is classified according to the service category. The higher the priority of the service, the higher the basic priority factor. The higher too.
3. The method for calculating the priority of non-terrestrial network services according to claim 1, characterized in that: The packet loss factor After obtaining the service attributes from the service module, the scheduler sets them as follows: When set to 0, the priority of the node will be 0, the priority of the node will be reduced to the end of the queue, the node will not be scheduled, and the action of discarding the timed-out service message will be triggered.
4. The method for calculating the priority of non-terrestrial network services according to claim 1, characterized in that: The scheduling delay factor ,in, Is a user Business The first packet waiting delay of the queue, the value range is .
5. A non-terrestrial network service scheduling method, characterized in that: The following steps are involved: Step S1: Generate a queue for scheduling for services that do not meet the rate requirement; Step S2: traverse each node to be scheduled in the queue to be scheduled, and obtain a parameter for calculating the priority of each node to be scheduled; Step S3: Calculate the priority of each node to be scheduled according to the method as claimed in claim 1; Step S4: After calculating the priority of each node to be scheduled, re-sort them according to the priority order; Step S5: traverse the sorted queue to be scheduled, and determine the appropriate resource block size in the time-frequency code domain to be allocated to the node to be scheduled according to the channel quality and the data to be transmitted.
6. The non-terrestrial network service scheduling method according to claim 5, characterized in that: In step S2, the parameters are processed by any method described in claims 2 to 4 and then used to perform priority calculation.
7. The non-terrestrial network service scheduling method according to claim 5, characterized in that: In step S4, the priority order includes an order from high to low.
8. A computer device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein when the processor executes the program, the method according to any one of claims 1 to 7 is implemented.
9. A readable storage medium, characterized in that: A computer program is stored, and when the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.
