CN116419403A - Resource allocation method, apparatus and non-volatile computer readable storage medium - Google Patents
Resource allocation method, apparatus and non-volatile computer readable storage medium Download PDFInfo
- Publication number
- CN116419403A CN116419403A CN202111579975.0A CN202111579975A CN116419403A CN 116419403 A CN116419403 A CN 116419403A CN 202111579975 A CN202111579975 A CN 202111579975A CN 116419403 A CN116419403 A CN 116419403A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- user
- actual
- users
- allocated
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000013468 resource allocation Methods 0.000 title claims abstract description 56
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000002596 correlated effect Effects 0.000 claims description 15
- 230000000875 corresponding effect Effects 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 6
- 238000005516 engineering process Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 3
- 239000002699 waste material Substances 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present disclosure relates to a resource allocation method, apparatus, and non-volatile computer readable storage medium, and relates to the field of communication technology. The resource allocation method comprises the following steps: determining the actual allocation bandwidth of each user according to whether the actual generated bandwidth of each user is larger than the bandwidth to be allocated; determining the residual bandwidth according to the total bandwidth currently available and the actual allocated bandwidths of all the first-class users, wherein the first-class users are users with the actual allocated bandwidths equal to the actual generated bandwidths; and allocating the residual bandwidth to each second class of users, wherein the second class of users are users with the actually allocated bandwidth smaller than the actually generated bandwidth. According to the technical scheme, the proper resource allocation strategy can be dynamically adjusted by calculating the current bandwidth requirement and the residual condition of the bandwidth of the user, so that the communication performance is improved.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a resource allocation method, a resource allocation apparatus, and a non-volatile computer readable storage medium.
Background
The 5G energized vertical industry has increasingly obvious scenes, and relates to various fields such as energy and infrastructure industry, public safety industry, industrial manufacturing industry, health medical industry, media entertainment industry, financial service industry and the like.
However, for the same base station, its air interface resources and forwarding capabilities are limited. If multiple 2B (To Business) users are covered, congestion occurs when the total amount of traffic flows generated by the multiple users simultaneously is greater than the total forwarding capacity of the air interface. At this time, the resource allocation method at the base station side directly affects the 2B user experience.
In the related art, the scheduling policy of the wireless network side for the air interface resource is to schedule based on the weight proportion of the weighting factor under the condition that factors such as channel quality, time delay and the like are unchanged.
Disclosure of Invention
The inventors of the present disclosure found that the above-described related art has the following problems: the resource allocation is not proper, resulting in degradation of communication performance.
In view of this, the present disclosure proposes a resource allocation technical solution, which can dynamically adjust a suitable resource allocation policy by calculating the current bandwidth requirement and the remaining bandwidth situation of a user, thereby improving the communication performance.
According to some embodiments of the present disclosure, there is provided a resource allocation method, including: determining the actual allocation bandwidth of each user according to whether the actual generated bandwidth of each user is larger than the bandwidth to be allocated; determining the residual bandwidth according to the total bandwidth currently available and the actual allocated bandwidths of all the first-class users, wherein the first-class users are users with the actual allocated bandwidths equal to the actual generated bandwidths; and allocating the residual bandwidth to each second class of users, wherein the second class of users are users with the actually allocated bandwidth smaller than the actually generated bandwidth.
In some embodiments, determining the actual allocated bandwidth for each user based on whether the actual resulting bandwidth for each user is greater than the allocatable bandwidth comprises: when the actual generated bandwidth of the user is smaller than or equal to the bandwidth to be allocated, the actual allocated bandwidth of the user is equal to the actual generated bandwidth; in the case where the actual generated bandwidth of the user is greater than the bandwidth to be allocated, the actual allocated bandwidth of the user is less than the actual generated bandwidth.
In some embodiments, determining the actual allocated bandwidth for each user based on whether the actual resulting bandwidth for each user is greater than the allocatable bandwidth comprises: and under the condition that the actual generated bandwidth of the user is larger than the bandwidth to be allocated, determining the actual allocation bandwidth of the user according to the total bandwidth, the user degree priority weighting factor value, the sum of the actual allocation bandwidths of all the first type users and the sum of the actual allocation bandwidths of other users except the first type users.
In some embodiments, the actual allocated bandwidth of a user is positively correlated with the difference of the sum of the total bandwidth and the actual allocated bandwidths of all the first class of users, positively correlated with the user's degree priority weighting factor value, and negatively correlated with the sum of the actual allocated bandwidths of the other users.
In some embodiments, allocating the remaining bandwidth to each second class of users comprises: calculating the difference between the actual generated bandwidth and the actual allocated bandwidth of each second class user; the residual bandwidth is distributed to the second class user with the smallest difference value, so that the second class user is changed into the first class user; re-determining the residual bandwidth; repeating the steps until the current residual bandwidth is smaller than the current difference value.
In some embodiments, the resource allocation method further comprises: and determining the bandwidth to be allocated to each user according to the total bandwidth and the scheduling priority weighting factor value of each user, wherein the scheduling priority weighting factor value is the corresponding scheduling priority weighting factor value of the corresponding 5QI (5G QoS Identifier,5G quality of service indicator) of each user.
In some embodiments, determining the allocable bandwidth for each user based on the total bandwidth, the scheduling priority weighting factor value for each user comprises: and determining the bandwidth to be allocated to each user according to the proportion of the scheduling priority weighting factor value of each user in the sum of all the scheduling priority weighting factor values.
In some embodiments, the total bandwidth is the bandwidth of the 5G base station excluding the bandwidth reserved for individual users, each user being an enterprise user.
According to other embodiments of the present disclosure, there is provided a resource allocation apparatus including: the determining unit is used for determining the actual allocation bandwidth of each user according to whether the actual generated bandwidth of each user is larger than the bandwidth to be allocated or not, and determining the residual bandwidth according to the total currently available bandwidth and the actual allocation bandwidths of all the first type users, wherein the first type users are users with the actual allocation bandwidth equal to the actual generated bandwidth; and the allocation unit is used for allocating the residual bandwidth to each second class of users, wherein the second class of users are users with the actually allocated bandwidth smaller than the actually generated bandwidth.
In some embodiments, the determining unit determines that the actual allocated bandwidth of the user is equal to the actual generated bandwidth in a case where the actual generated bandwidth of the user is less than or equal to the bandwidth to be allocated; in the case where the actual generated bandwidth of the user is greater than the bandwidth to be allocated, the actual allocated bandwidth of the user is less than the actual generated bandwidth.
In some embodiments, the determining unit determines the actual allocated bandwidth of the user based on the total bandwidth, the user's degree priority weighting factor value, the sum of the actual allocated bandwidths of all the first type users, the sum of the actual allocated bandwidths of other users than the first type users, in case the actual generated bandwidth of the user is larger than the allocatable bandwidth.
In some embodiments, the actual allocated bandwidth of a user is positively correlated with the difference of the sum of the total bandwidth and the actual allocated bandwidths of all the first class of users, positively correlated with the user's degree priority weighting factor value, and negatively correlated with the sum of the actual allocated bandwidths of the other users.
In some embodiments, the allocation unit calculates a difference between the actual generated bandwidth and the actual allocated bandwidth for each of the second class of users; the residual bandwidth is distributed to the second class user with the smallest difference value, so that the second class user is changed into the first class user; re-determining the residual bandwidth; repeating the steps until the current residual bandwidth is smaller than the current difference value.
In some embodiments, the determining unit determines the bandwidth to be allocated to each user according to the total bandwidth and a scheduling priority weighting factor value of 5QI corresponding to each user.
In some embodiments, the determining unit determines the bandwidth to be allocated for each user based on the proportion of the scheduling priority weighting factor value for each user in the sum of all the scheduling priority weighting factor values.
In some embodiments, the total bandwidth is the bandwidth of the 5G base station excluding the bandwidth reserved for individual users, each user being an enterprise user.
According to still further embodiments of the present disclosure, there is provided a resource allocation apparatus including: a memory; and a processor coupled to the memory, the processor configured to perform the resource allocation method of any of the embodiments described above based on instructions stored in the memory device.
According to still further embodiments of the present disclosure, there is provided a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the resource allocation method in any of the above embodiments.
In the above embodiment, the appropriate resource allocation policy can be dynamically adjusted by calculating the current bandwidth requirement and the remaining bandwidth of the user, so as to improve the communication performance.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.
The disclosure may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 illustrates a flow chart of some embodiments of a resource allocation method of the present disclosure;
FIG. 2 illustrates a flow chart of some embodiments of step 130 of FIG. 1;
FIG. 3 illustrates a flow chart of further embodiments of a resource allocation method of the present disclosure;
FIG. 4 illustrates a block diagram of some embodiments of a resource allocation apparatus of the present disclosure;
FIG. 5 illustrates a block diagram of further embodiments of a resource allocation apparatus of the present disclosure;
fig. 6 illustrates a block diagram of still further embodiments of the resource allocation apparatus of the present disclosure.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless it is specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but where appropriate, the techniques, methods, and apparatus should be considered part of the specification.
In all examples shown and discussed herein, any specific values should be construed as merely illustrative, and not a limitation. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
As described above, the scheduling method based on the weight proportion of the weighting factor may waste air interface resources, or may have packet loss caused by that many 2B users cannot be allocated to the actually required bandwidth, thereby affecting the technical problem of normal service usage. Moreover, the priority relation of users in different industries is not considered, the actual requirement of the 2B user is not considered, and the air interface resource allocation condition cannot be dynamically changed.
Aiming at the technical problems, the present disclosure proposes an improved Non-GBR (Non-Guaranteed Bit Rate ) service allocation algorithm for solving the problem of air interface resource congestion, and reasonably allocates NR air interface resources to improve 2B user experience to the greatest extent. For example, the technical solution of the present disclosure may be implemented by the following embodiments.
Fig. 1 illustrates a flow chart of some embodiments of a resource allocation method of the present disclosure.
As shown in fig. 1, in step 110, the actual allocated bandwidth of each user is determined according to whether the actual generated bandwidth of each user is greater than the bandwidth to be allocated. For example, the total bandwidth is the bandwidth after the 5G base station removes the reserved bandwidth for individual users, each user being an enterprise user.
In some embodiments, the bandwidth to be allocated to each user is determined according to the total bandwidth and a scheduling priority weighting factor value of each user, where the scheduling priority weighting factor value is a corresponding scheduling priority weighting factor value of 5QI corresponding to each user.
In some embodiments, the bandwidth to be allocated to each user is determined based on the proportion of the scheduling priority weighting factor value for each user in the sum of all the scheduling priority weighting factor values.
For example, the total bandwidth after the gNodeB (5G base station) removes the bandwidth reserved for 2C (To Customer) users is S, and the number of users currently on-line is n. The values of 5QI corresponding to n users are respectively Q1, Q2, Q3, … and Qn, and the values of the scheduling priority weighting factors of the users corresponding to each 5QI are respectively W1, W2, … and Wn. The current actual generated bandwidths of the users are R1, R2, R3, …, rn.
In the case of allocating the total rate according to the weight ratio of the weighting factors, the bandwidth Bi to be allocated for the i-th user is:
in some embodiments, in the case where the actual generated bandwidth of the user is less than or equal to the bandwidth to be allocated, the actual allocated bandwidth of the user is equal to the actual generated bandwidth; in the case where the actual generated bandwidth of the user is greater than the bandwidth to be allocated, the actual allocated bandwidth of the user is less than the actual generated bandwidth.
In some embodiments, in the event that the actual generated bandwidth of the user is greater than the bandwidth to be allocated, the actual allocated bandwidth of the user is determined based on the total bandwidth, the user's degree priority weighting factor value, the sum of the actual allocated bandwidths of all the first class users, the sum of the actual allocated bandwidths of other users than the first class users.
For example, the actual allocated bandwidth of a user is positively correlated with the difference between the total bandwidth and the sum of the actual allocated bandwidths of all the first class users, positively correlated with the user's degree priority weighting factor value, and negatively correlated with the sum of the actual allocated bandwidths of other users.
In some embodiments, the actual allocated bandwidth Fi of the user at the gNodeB is calculated.
For example, if ri+.ltoreq.bi, the actual allocated bandwidth fi=ri for the ith user, i.e., the actual allocated bandwidth coincides with the actual generated bandwidth.
For example, if Ri > Bi, then all users are traversed as in the case of Ri+.Bi above; if the index of the user of fi=ri includes m, …, k, the actual allocated bandwidth Fi of the remaining users on the air interface is smaller than the actual generated bandwidth Ri. The calculation method of the actual allocation bandwidth is as follows:
in step 120, the remaining bandwidth is determined based on the total bandwidth currently available and the actual allocated bandwidths of all the first class users. The first class of users are users that actually allocate bandwidth equal to the actually generated bandwidth.
In step 130, the remaining bandwidth is allocated to each second class of users. The second class of users are users whose actual allocated bandwidth is less than the actual generated bandwidth.
In some embodiments, step 130 may be implemented by the embodiment of fig. 2.
Fig. 2 illustrates a flow chart of some embodiments of step 130 of fig. 1.
As shown in fig. 2, in step 1310, the difference between the actual generated bandwidth and the actual allocated bandwidth for each second class user is calculated.
In some embodiments, the difference di=ri-Fi between the actual generated bandwidth Ri and the actual obtained bandwidth Fi for all 2B users is calculated one by one.
In step 1320, the remaining bandwidth is allocated to the second type of user having the smallest difference, such that this second type of user becomes the first type of user.
In some embodiments, the minimum positive value dx=min (D1,..dn), dx >0 of D1-Dn is selected because the user's upstream bandwidth requirements are originally satisfied when the difference is negative. If the actual bandwidth requirement (i.e. the actual generated bandwidth) of this user is Rx, then the user with the difference Dx is allocated first, if the remaining bandwidth resources of the air interface are sufficient.
In step 120, the remaining bandwidth is redetermined. Steps 120-1320 are repeated until the current remaining bandwidth is less than the current difference.
In some embodiments, the method for calculating the air interface residual bandwidth resource S is as follows:
the users with the marks m-k are all users meeting the Ri-Fi not more than 0.
In some embodiments, the residual bandwidth S is determined Residual of Whether the bandwidth requirement Rx of the user with difference Dx can be met. For example, if S Residual of If the value is not less than Rx, the bandwidth resource with the value of Rx is directly allocated, and if the value of Fx and Bx of the user is not less than Rx, the value of z-m is updated; otherwise, do not meet; repeating the above steps until the residual bandwidth no longer meets the bandwidth requirement of any user (i.e. S Residual of <Rx).
In the embodiment, the weighted allocation algorithm is improved and upgraded, so that 5G NR air interface resources are effectively utilized to the greatest extent, and resource waste is reduced; the method and the device realize dynamic adjustment of the resource allocation strategy by dynamically calculating the bandwidth requirement of the current user; the value of the 5G enabling industry clients is considered, and the user experience is improved through dynamic resource allocation of Non-GBR service.
Fig. 3 illustrates a flow chart of further embodiments of the resource allocation method of the present disclosure.
As shown in fig. 3, in step 1, the total bandwidth after the gNodeB (5G base station) removes the bandwidth reserved for the 2C user is S, and the number of users currently on line is n. The values of 5QI corresponding to n users are respectively Q1, Q2, Q3, … and Qn, and the values of the scheduling priority weighting factors of the users corresponding to each 5QI are respectively W1, W2, … and Wn. The current actual generated bandwidths of the users are R1, R2, R3, …, rn.
In the case of allocating the total rate according to the weight ratio of the weighting factors, the bandwidth Bi to be allocated for the i-th user is:
in step 2, the actual allocated bandwidth Fi of the user at the gNodeB is calculated.
For example, if ri+.ltoreq.bi, the actual allocated bandwidth fi=ri for the ith user, i.e., the actual allocated bandwidth coincides with the actual generated bandwidth.
For example, if Ri > Bi, then all users are traversed as in the case of Ri+.Bi above; if the index of the user of fi=ri includes m, …, k, the actual allocated bandwidth Fi of the remaining users on the air interface is smaller than the actual generated bandwidth Ri. The calculation method of the actual allocation bandwidth is as follows:
in step 3, the difference di=ri-Fi between the actually generated bandwidth Ri and the actually obtained bandwidth Fi of all the 2B users is calculated one by one.
In step 4, since the uplink bandwidth requirement of the user can be satisfied when the difference is negative, the smallest positive value dx=min (D1,..dn), dx >0, of D1 to Dn is selected.
If the actual bandwidth requirement (i.e. the actual generated bandwidth) of this user is Rx, then the user with the difference Dx is allocated first, if the remaining bandwidth resources of the air interface are sufficient.
If the actual bandwidth requirement (i.e. the actual generated bandwidth) of this user is Rx, then the user with the difference Dx is allocated first, if the remaining bandwidth resources of the air interface are sufficient.
In step 5, the method for calculating the air interface residual bandwidth resource S is as follows:
the users with the marks m-k are all users meeting the Ri-Fi not more than 0.
In step 6, the residual bandwidth S is determined Residual of Whether the bandwidth requirement Rx of the user with difference Dx can be met. If S Residual of If the value is not less than Rx, the bandwidth resource with the value of Rx is directly allocated, and if the value of Fx and Bx of the user is not less than Rx, the value of z-m is updated; otherwise, not satisfied.
In step 7, the above steps 2 to 6 are repeated until the remaining bandwidth no longer meets the bandwidth requirements of any users (i.e., S Residual of <Rx).
The above embodiment can realize the control of the user bandwidth allocation based on the scheduling policy of the 5G QoS (Quality of Service ) priority; the utilization efficiency of the existing 5G NR air interface resource can be improved to the maximum extent; the 2B industry user experience can be improved.
And moreover, the weighted allocation algorithm is improved and upgraded, so that the 5G NR air interface resources are effectively utilized to the greatest extent, and the wireless resource waste is reduced. Saving the cost of operators to a certain extent.
The method and the device realize dynamic adjustment of the resource allocation strategy by dynamically calculating the current bandwidth requirement and the actual bandwidth residual condition of the user, and realize flexible real-time scheduling of the air interface strategy.
The value of the clients in the 5G enabling industry is considered, the client satisfaction degree is improved through dynamic resource allocation of Non-GBR service, the industry user experience is improved, and the stability of the users is effectively guaranteed.
The technical scheme disclosed by the invention is suitable for the following large scenes: an industry customer scenario with multiple differentiated requirements under one base station; the base station is in a crowd-intensive area and covers a certain amount of scenes of industry clients; the congestion of the air interface resources of the base station can cause the situation that the air interface bandwidth requirement of the 2B client cannot be met.
In the above embodiment, by allocating weights to users of each priority level and allocating air interface resources according to weight proportion; then circularly calculating the difference value between the current actual generated bandwidth of each 2B user and the bandwidth which can be allocated currently, wherein the user with the smallest positive difference value is the 2B user which is the easiest to meet the requirement but not met currently, and the user is preferably met; and so on, all available bandwidth may be allocated to as many 2B users as may be needed.
By the air interface resource allocation technical scheme provided by the disclosure, the bandwidth allocation conditions of all the current 2B users can be dynamically calculated in real time, so that the allocation strategy of the air interface resources can be dynamically adjusted in real time, and the air interface resources can be effectively utilized.
According to the air interface resource allocation technical scheme provided by the disclosure, the defect that part of air interface resources are wasted due to the fact that packet loss still exists after part of bandwidth is allocated to a plurality of 2B users according to the weighted proportion and the user requirements cannot be met can be prevented, and the air interface resources are utilized to the maximum extent.
The technical scheme for air interface resource allocation can meet the bandwidth requirements of users with higher priority, so that the bandwidth requirements of more 2B users can be met as much as possible, and the 2B user experience is improved.
Fig. 4 illustrates a block diagram of some embodiments of a resource allocation apparatus of the present disclosure.
As shown in fig. 4, the resource allocation device 4 includes: a determining unit 41, configured to determine an actual allocated bandwidth of each user according to whether the actual generated bandwidth of each user is greater than the bandwidth to be allocated, and determine a remaining bandwidth according to the total bandwidth currently available and the actual allocated bandwidths of all the first users, where the first users are users whose actual allocated bandwidths are equal to the actual generated bandwidths; an allocation unit 42, configured to allocate the remaining bandwidth to each of the users of the second class, where the users of the second class are users whose actually allocated bandwidth is smaller than the actually generated bandwidth.
In some embodiments, the determining unit 41 determines that the actual allocated bandwidth of the user is equal to the actual generated bandwidth in the case where the actual generated bandwidth of the user is less than or equal to the bandwidth to be allocated; in the case where the actual generated bandwidth of the user is greater than the bandwidth to be allocated, the actual allocated bandwidth of the user is less than the actual generated bandwidth.
In some embodiments, the determining unit 41 determines the actual allocated bandwidth of the user based on the total bandwidth, the user's degree priority weighting factor value, the sum of the actual allocated bandwidths of all the first type users, the sum of the actual allocated bandwidths of other users than the first type users, in the case where the actual generated bandwidth of the user is larger than the allocatable bandwidth.
In some embodiments, the actual allocated bandwidth of a user is positively correlated with the difference of the sum of the total bandwidth and the actual allocated bandwidths of all the first class of users, positively correlated with the user's degree priority weighting factor value, and negatively correlated with the sum of the actual allocated bandwidths of the other users.
In some embodiments, the allocation unit 42 calculates the difference between the actual generated bandwidth and the actual allocated bandwidth for each second class of users; the residual bandwidth is distributed to the second class user with the smallest difference value, so that the second class user is changed into the first class user; re-determining the residual bandwidth; repeating the steps until the current residual bandwidth is smaller than the current difference value.
In some embodiments, the determining unit 41 determines the bandwidth to be allocated to each user according to the total bandwidth and the scheduling priority weighting factor value of 5QI corresponding to each user.
In some embodiments, the determining unit 41 determines the bandwidth to be allocated for each user according to the proportion of the scheduling priority weighting factor value for each user in the sum of all the scheduling priority weighting factor values.
In some embodiments, the total bandwidth is the bandwidth of the 5G base station excluding the bandwidth reserved for individual users, each user being an enterprise user.
Fig. 5 illustrates a block diagram of further embodiments of the resource allocation apparatus of the present disclosure.
As shown in fig. 5, the resource allocation device 5 of this embodiment includes: a memory 51 and a processor 52 coupled to the memory 51, the processor 52 being configured to perform the resource allocation method in any one of the embodiments of the present disclosure based on instructions stored in the memory 51.
The memory 51 may include, for example, a system memory, a fixed nonvolatile storage medium, and the like. The system memory stores, for example, an operating system, application programs, boot Loader, database, and other programs.
Fig. 6 illustrates a block diagram of still further embodiments of the resource allocation apparatus of the present disclosure.
As shown in fig. 6, the resource allocation device 6 of this embodiment includes: a memory 610 and a processor 620 coupled to the memory 610, the processor 620 being configured to perform the resource allocation method of any of the previous embodiments based on instructions stored in the memory 610.
The memory 610 may include, for example, system memory, fixed nonvolatile storage media, and the like. The system memory stores, for example, an operating system, application programs, boot Loader, and other programs.
The resource allocation device 6 may also include an input-output interface 630, a network interface 640, a storage interface 650, and the like. These interfaces 630, 640, 650 and the memory 610 and processor 620 may be connected by, for example, a bus 660. The input/output interface 630 provides a connection interface for input/output devices such as a display, a mouse, a keyboard, a touch screen, a microphone, and a speaker. Network interface 640 provides a connection interface for various networking devices. The storage interface 650 provides a connection interface for external storage devices such as SD cards, U-discs, and the like.
It will be appreciated by those skilled in the art that embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media including, but not limited to, disk storage, CD-ROM, optical storage, and the like, having computer-usable program code embodied therein.
Up to this point, the resource allocation method, the resource allocation apparatus, and the non-volatile computer-readable storage medium according to the present disclosure have been described in detail. In order to avoid obscuring the concepts of the present disclosure, some details known in the art are not described. How to implement the solutions disclosed herein will be fully apparent to those skilled in the art from the above description.
The methods and systems of the present disclosure may be implemented in a number of ways. For example, the methods and systems of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, firmware. The above-described sequence of steps for the method is for illustration only, and the steps of the method of the present disclosure are not limited to the sequence specifically described above unless specifically stated otherwise. Furthermore, in some embodiments, the present disclosure may also be implemented as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (11)
1. A resource allocation method, comprising:
determining the actual allocation bandwidth of each user according to whether the actual generated bandwidth of each user is larger than the bandwidth to be allocated;
determining the residual bandwidth according to the total bandwidth currently available and the actual allocated bandwidths of all the first-class users, wherein the first-class users are users with the actual allocated bandwidths equal to the actual generated bandwidths;
and distributing the residual bandwidth to each second class of users, wherein the second class of users are users with the actual distribution bandwidth smaller than the actual generation bandwidth.
2. The resource allocation method according to claim 1, wherein the determining the actual allocated bandwidth of each user according to whether the actual generated bandwidth of each user is greater than the bandwidth to be allocated comprises:
when the actual generated bandwidth of the user is smaller than or equal to the bandwidth to be allocated, the actual allocated bandwidth of the user is equal to the actual generated bandwidth;
in the case where the actual generated bandwidth of a user is greater than the bandwidth that should be allocated, the actual allocated bandwidth of the user is less than the actual generated bandwidth.
3. The resource allocation method according to claim 1, wherein the determining the actual allocated bandwidth of each user according to whether the actual generated bandwidth of each user is greater than the bandwidth to be allocated comprises:
and under the condition that the actual generated bandwidth of the user is larger than the bandwidth to be allocated, determining the actual allocation bandwidth of the user according to the total bandwidth, the degree priority weighting factor value of the user, the sum of the actual allocation bandwidths of all the first type users and the sum of the actual allocation bandwidths of other users except the first type users.
4. A resource allocation method according to claim 3, wherein the actual allocated bandwidth of the user is positively correlated with the difference of the sum of the total bandwidth and the actual allocated bandwidths of all the first class users, positively correlated with the user's degree priority weighting factor value, and negatively correlated with the sum of the actual allocated bandwidths of the other users.
5. The resource allocation method according to claim 1, wherein said allocating the remaining bandwidth to each second class of users comprises:
calculating the difference between the actual generated bandwidth and the actual allocated bandwidth of each second class user;
the residual bandwidth is distributed to a second class user with the smallest difference value, so that the second class user is changed into a first class user;
re-determining the residual bandwidth;
repeating the steps until the current residual bandwidth is smaller than the current difference value.
6. The resource allocation method of claim 1, further comprising:
and determining the bandwidth to be allocated to each user according to the total bandwidth and the scheduling priority weighting factor value of each user, wherein the scheduling priority weighting factor value is the corresponding scheduling priority weighting factor value of the 5G service quality indicator (5 QI) corresponding to each user.
7. The resource allocation method of claim 6, wherein the determining the allocable bandwidth of each user according to the total bandwidth, the scheduling priority weighting factor value of each user comprises:
and determining the bandwidth to be allocated to each user according to the proportion of the scheduling priority weighting factor value of each user in the sum of all the scheduling priority weighting factor values.
8. The resource allocation method according to any one of claims 1-7, wherein the total bandwidth is a bandwidth of the 5G base station excluding bandwidth reserved for individual users, the users being enterprise users.
9. A resource allocation apparatus, comprising:
the determining unit is used for determining the actual allocation bandwidth of each user according to whether the actual generated bandwidth of each user is larger than the bandwidth to be allocated or not, and determining the residual bandwidth according to the total currently available bandwidth and the actual allocation bandwidths of all the first type users, wherein the first type users are users with the actual allocation bandwidth equal to the actual generated bandwidth;
and the allocation unit is used for allocating the residual bandwidth to each second class of users, wherein the second class of users are users with the actually allocated bandwidth smaller than the actually generated bandwidth.
10. A resource allocation apparatus, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the resource allocation method of any of claims 1-8 based on instructions stored in the memory.
11. A non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the resource allocation method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111579975.0A CN116419403A (en) | 2021-12-22 | 2021-12-22 | Resource allocation method, apparatus and non-volatile computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111579975.0A CN116419403A (en) | 2021-12-22 | 2021-12-22 | Resource allocation method, apparatus and non-volatile computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116419403A true CN116419403A (en) | 2023-07-11 |
Family
ID=87058012
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111579975.0A Pending CN116419403A (en) | 2021-12-22 | 2021-12-22 | Resource allocation method, apparatus and non-volatile computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116419403A (en) |
-
2021
- 2021-12-22 CN CN202111579975.0A patent/CN116419403A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10129043B2 (en) | Apparatus and method for network flow scheduling | |
| US7257083B2 (en) | Method and apparatus for policy-based dynamic preemptive scheduling of data transmissions | |
| JP5852227B2 (en) | Scheduling and admission control method for guaranteed bit rate and / or maximum bit rate service | |
| US8660142B2 (en) | Scheduling virtual bandwidth requests | |
| CN113784373B (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| WO2016065841A1 (en) | Access network congestion control method, base station device, and policy and charging rules function network element | |
| US11540173B2 (en) | Efficient inroute (return channel) load balancing scheme of guaranteed QoS traffic mixed with best effort traffic in an oversubscribed satellite network | |
| US11601876B2 (en) | Method for controlling the admission of slices into a virtualized telecommunication network and the congestion likely to be generated between services instantiated on said slices | |
| US20230246944A1 (en) | Shaping outgoing traffic of network packets in a network management system | |
| WO2013000116A1 (en) | Method and device for leaky bucket speed-limitation | |
| CN109743751A (en) | The resource allocation methods and device of wireless access network | |
| CN115103450A (en) | Multi-service time slot distribution method and equipment | |
| CN106453114B (en) | Flow distribution method and device | |
| US20040228276A1 (en) | Preemptive precedence scheduler for communications link bandwidth | |
| CN116419403A (en) | Resource allocation method, apparatus and non-volatile computer readable storage medium | |
| CN115413041A (en) | Centralized wireless ad hoc network resource allocation method and system | |
| Tan et al. | A novel approach for bandwidth allocation among soft QoS traffic in wireless networks | |
| Liu et al. | Network slicing with spectrum sharing | |
| WO2020135648A1 (en) | Resource scheduling method and apparatus, network device, and readable storage medium | |
| CN107979874B (en) | Data scheduling method, device and base station for satellite communication system | |
| Miyata | Two types of flows admission control by altruistic behavior based on warning | |
| G∤ ąbowski et al. | Simulation studies of communication systems with mutual overflows and threshold mechanisms | |
| CN107257570B (en) | Network access selection method and bandwidth allocation method based on user priority | |
| CN113271678B (en) | Frame structure adjusting method and device | |
| CN117118898A (en) | Message forwarding method, device and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |