A method, apparatus, storage medium, and electronic device for resource allocation

Abstract

The present invention provides a resource allocation method, apparatus, storage medium, and electronic device. The method includes: determining the bandwidth belonging to the operator and the bandwidth belonging to the service slice according to a preset bandwidth occupancy rule; sorting the access users according to the attributes of the operator of the access users, the attributes of the service slice, a preset sorting strategy of the operator, and a preset sorting strategy of the service slice; and allocating bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth belonging to the operator, the bandwidth belonging to the service slice, and the preset bandwidth occupancy rule. The apparatus includes: a sorting module for sorting the access users; a scheduling module for determining the bandwidth belonging to the operator and the bandwidth belonging to the service slice; and allocating bandwidth resources to the users in the sorting queue.

Description

Technical Field

[0001] The present invention relates to the field of communications, and in particular to a method, device, storage medium and electronic device for resource allocation. Background Art

[0002] In order to reduce investment and operating costs, different access user categories, such as operators, can achieve network sharing through cooperation when networking, also known as frequency band reuse. A shared network means that multiple operators can share a base station or jointly network, that is, a base station or communication network allows access to users of multiple operators, and the bandwidth usage ratio and bandwidth usage rules of each operator are determined by negotiation between operators.

[0003] After the introduction of service slicing, although there are frequency band sharing strategies in the existing technology, these strategies are all based on the fixed bandwidth carrier frequency of operators, and do not take into account the needs of service slicing. They fail to solve the problem of meeting the scheduling requests of different service slices while meeting the frequency band reuse needs of multiple operators. Summary of the invention

[0004] The embodiments of the present invention provide a method and device for resource allocation, so that access users can occupy spectrum resources more flexibly according to their operator attributes and service slice characteristics, thereby ensuring scheduling orderliness and maximizing the satisfaction of access users' service needs.

[0005] According to an embodiment of the present invention, a method for resource allocation is provided, comprising:

[0006] According to the preset bandwidth occupation rules, determine the bandwidth belonging to the operator and the bandwidth belonging to the business slice; sort the access users according to the attributes of the operator of the access users, the attributes of the business slices, the preset sorting strategy of the operator and the preset sorting strategy of the business slices; allocate bandwidth resources to users in the sorting queue according to the sorting results of the access users, the bandwidth belonging to the operator, the bandwidth belonging to the business slices and the preset bandwidth occupation rules.

[0007] Optionally, sorting the access users includes: when the sorting strategies of the operators are the same and the sorting strategies of the service slices are also the same, all the access users are uniformly sorted; when the sorting strategies of the operators are different or the sorting strategies of the service slices are different, the access users are placed in different user queues and sorted separately; when the sorting strategies of the operators are the same but the sorting strategies of the service slices are different, the access users belonging to the same service slice are uniformly sorted.

[0008] Optionally, sorting the access users further includes: sorting the access users in the same service type of different service slices uniformly according to the service priority guarantee level.

[0009] Optionally, when the bandwidth occupancy rule includes allowing the users allowed to access to occupy the remaining resources mutually, after determining the bandwidth of the operator and the bandwidth of the service slice, the method further includes: correcting the bandwidth of the operator and / or the bandwidth of the service slice by using a bandwidth correction value, where the bandwidth correction value is used to balance the bandwidths of different operators and / or the bandwidths of different service slices;

[0010] Optionally, according to the sorting result of the access users, the bandwidth occupancy rule, the corrected bandwidth of the operator, and the corrected bandwidth of the service slice, allocate the bandwidth resources to the users in the sorting queue.

[0011] Optionally, determine the bandwidth resources actually occupied by the operator during the previous bandwidth resource allocation, and use the difference between the previous bandwidth resources actually occupied by the operator and the bandwidth of the access users in the previous time as the bandwidth correction value; or, determine the bandwidth resources actually occupied by the service slice during the previous bandwidth resource allocation, and use the difference between the previous bandwidth resources actually occupied by the service slice and the bandwidth of the service slice in the previous time as the bandwidth correction value.

[0012] According to another embodiment of the present invention, there is provided an apparatus for resource allocation, including:

[0013] A sorting module, configured to sort the access users according to the attributes of the operator of the access users, the attributes of the service slice, the preset sorting strategy of the operator, and the preset sorting strategy of the service slice;

[0014] A scheduling module, configured to determine the bandwidth of the operator and the bandwidth of the service slice according to a preset bandwidth occupancy rule; and allocate the bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rule.

[0015] Optionally, the apparatus further includes: a bandwidth resource correction module, configured to correct the bandwidth of the operator and / or the bandwidth of the service slice by using a bandwidth correction value, where the bandwidth correction value is used to balance the bandwidths of different access user types and / or the bandwidths of different service slices.

[0016] By using the method and device of the present invention, on the basis of meeting the preset bandwidth occupancy rules including the bandwidth occupancy rules of operators / service slice bandwidth occupancy rules, the orderliness of bandwidth resource allocation is ensured, the service requirements of access users are maximally met, the slice requirements of services are maximally met, and through the collaborative scheduling among operators, the utilization rate of spectrum resources is improved, and the investment cost of operators is further reduced, thus better adapting to the requirements of future multi-operator hybrid scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The drawings described herein are used to provide a further understanding of the present invention and form a part of this application. The illustrative embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation to the present invention. In the drawings:

[0018] Figure 1 is a flowchart of the method for resource allocation according to an embodiment of the present invention;

[0019] Figure 2 is a block diagram of the structure of the device for resource allocation according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0020] The present invention will be described in detail below with reference to the drawings and in conjunction with the embodiments. It should be noted that, without conflict, the embodiments in this application and the features in the embodiments can be combined with each other.

[0021] This embodiment discloses a method for resource allocation, as Figure 1 shown, the method is as follows:

[0022] Step S101: Determine the bandwidth of the operator and the bandwidth of the service slice according to the preset bandwidth occupancy rules;

[0023] Step S102: Sort the access users according to the attributes of the operator of the access users, the attributes of the service slice, the preset sorting strategy of the operator, and the preset sorting strategy of the service slice;

[0024] Step S103: Allocate the bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rules.

[0025] This embodiment also provides a device for resource allocation, as Figure 2 shown, the device includes:

[0026] A sorting module 11, configured to sort the access users according to the attributes of the operator of the access users, the attributes of the service slice, the preset sorting strategy of the operator, and the preset sorting strategy of the service slice;

[0027] A scheduling module 12, configured to determine the bandwidth of the operator and the bandwidth of the service slice according to a preset bandwidth occupancy rule; and allocate bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rule.

[0028] A bandwidth resource correction module 13, configured to correct the bandwidth of the operator and / or the bandwidth of the service slice through a bandwidth correction value, where the bandwidth correction value is used to balance the bandwidths of different access user types and / or the bandwidths of different service slices.

[0029] The method for resource allocation disclosed by the present invention specifically further includes the following steps:

[0030] Scheduling is completed according to the bandwidth occupancy rule negotiated between the operator and the slice service, the operator attribute of the user, and the service slice attribute of the user. Among them, the bandwidth occupancy rule mainly includes: First, the bandwidth occupancy ratio: which represents the ratio of each operator or each slice service occupying the full bandwidth, and a shared bandwidth ratio can also be set, indicating the bandwidth that each operator or each slice service can occupy. For example, if a base station serves 2 service slices, the bandwidth occupancy ratio of service slice 1 is 50%, the bandwidth occupancy ratio of service slice 2 is 30%, and the shared bandwidth ratio is 20%. For a 20 MHz frequency band, service slice 1 can occupy at most 20*(50% + 20%) = 14 MHz. This value only represents the size of the bandwidth and does not include the position of the frequency band to which the bandwidth belongs. The calculation method of the frequency band occupied by the operator's bandwidth is the same as that of the frequency band occupied by the service slice's bandwidth; Second, the remaining resource occupancy rule: which represents whether the remaining bandwidth resources are allowed to be used by other operators or other service slices if the bandwidth of a certain operator or a certain service slice is not fully allocated during the scheduling opportunity.

[0031] The attribute of the operator refers to the information of the operator to which the access user belongs, and the service slice attribute represents the information of the slice to which the user's service belongs, which is also an important basis for the base station to schedule and allocate resources to the user.

[0032] Before scheduling, first determine whether there are multiple operators or multiple service slices sharing in the base station. If so, further determine the sharing number and sharing method of the operators or service slices, and use the bandwidth occupancy rule negotiated by these operators (at least 2) or service slices as the input parameter for scheduling.

[0033] If multiple operators share a base station, each service slice of each operator determines its own sorting strategy, including: service priority guarantee level, such as the priority between various GBR (Guaranteed Bit Rate) services and Non-GBR services, service latency, the ARP (Allocation and Retention Priority) of the service, etc.

[0034] If multiple operators sharing the network select the same sorting strategy, and multiple service slices also select the same sorting strategy, then all access users can be sorted uniformly; otherwise, the base station scheduling can put users of different service slices of different operators into different user queues and sort them separately. If the base station serves only one operator but supports multiple service slices, each service slice determines its own scheduling strategy.

[0035] When a new user accesses, first obtain its operator attribute and service slice attribute according to its access information, and then, according to the sorting strategy of the operator and the sorting strategy of the service slice, put the user into the corresponding queue to wait for sorting. High-priority services are guaranteed first. For example: GBR services, and services of the same level are scheduled in turn according to the scheduling results of the sorting algorithm.

[0036] Calculate the bandwidth to which each service slice of each operator belongs according to the bandwidth occupancy ratio of the operator and the service slice, that is, the initial bandwidth occupancy upper limit of the operator's service slice. After obtaining the sorting result of the user queue, then allocate resources to each user in the sorting queue in turn according to the bandwidth occupancy upper limit and bandwidth occupancy rules of each operator and service slice.

[0037] After the scheduling is completed, first count the actually occupied bandwidth of each operator, that is, the sum of the bandwidths occupied by all access users of each operator, and calculate the difference between this value and the bandwidth occupancy upper limit of the operator, that is, the operator bandwidth correction value. Correct the bandwidth occupancy upper limit of the operator at the next scheduling opportunity according to the bandwidth correction value to balance the bandwidth occupancy upper limit of different operators each time. If in the bandwidth occupancy rules, operators are not allowed to occupy each other's remaining resources, then there is no need to calculate the bandwidth correction value here. Then count the sum of the bandwidths occupied by all access users of each service slice under each operator again, and calculate the difference between this value and the bandwidth occupancy upper limit of the service slice, that is, the service slice bandwidth correction value. Correct the upper limit of the bandwidth occupancy ratio of the service slice at the next scheduling opportunity according to the service slice bandwidth correction value to balance the bandwidth occupancy upper limit of different service slices each time. If according to the bandwidth occupancy rules, there is no need to correct the bandwidth occupancy of the service slice, then the bandwidth correction value can be not adjusted.

[0038] Shared by multiple operators and multiple slices, and the resource ratio of the service slice is not divided according to the operator. The resource ratio of the service slice can be divided according to the resource ratio of the operator, that is, the upper limit of the resource ratio of each operator for each service slice is clarified, and the operator bandwidth correction value and the service slice bandwidth correction value within the operator are maintained respectively.

[0039] Alternatively, the upper limit of the resource ratio of each operator can be calculated, the upper limit of the resource ratio of each service slice can be calculated, the same slice services of different operators are uniformly sorted and scheduled, and the operator bandwidth correction value and the service slice bandwidth correction value are maintained respectively.

[0040] The above steps can be repeated for each scheduling.

[0041] The technical solution of the present invention will be described in detail below through specific embodiments:

[0042] Embodiment 1:

[0043] Sharing method: 2 operators share 1 base station and serve 2 service slices. The number of operators and the types of service slices can both be greater than 2. The numbers listed in the embodiments are only for example and do not constitute specific limitations.

[0044] Step 201: According to the bandwidth occupancy rules of the operator and the service slice, including the bandwidth occupancy ratio, determine the upper limit of the bandwidth occupied by the operator and the upper limit of the bandwidth occupied by the service slice: 2 operators share 20 MHz, the bandwidth occupancy ratio of operator A is 50%, and the bandwidth occupancy ratio of operator B is 50%; operator A only serves service slice 1, and the upper limits of the bandwidth resources occupied by operator A and operator B are 20 MHz * 50% = 10 MHz, corresponding to 50 RBs; operator B serves both service slice 1 and 2, and the resource ratios of the 2 service slices occupied by operator B are 60% and 40% respectively. At the same time, the remaining bandwidth resources are allowed to be shared between operators or between service slices.

[0045] Step 202: Initialize the bandwidth correction value for the base station scheduling: 2 operators require 1 operator bandwidth correction value, and 2 service slices require 1 service slice bandwidth correction value. The operator bandwidth correction value is initialized to Δ A = 0; the service slice bandwidth correction value is initialized to Δ 1 = 0. As long as the RBs occupied by the operator and the service slice during scheduling are within their respective bandwidth ranges, no correction is required.

[0046] Step 203: Modify the upper limit of the bandwidth occupied by each service slice of each operator for the current scheduling opportunity according to the bandwidth correction value: Since the bandwidth correction value is 0, the upper limit of the bandwidth occupied by Service Slice 1 of Operator A for the current scheduling opportunity is 50 RBs, the upper limit of the bandwidth occupied by Service Slice 1 of Operator B is 30 RBs, and the upper limit of the bandwidth occupied by Service Slice 2 of Operator B is 20 RBs.

[0047] Step 204: Obtain the operator and service slice attributes to which the access users belong. Two users are connected to Operator A: The user with UE ID = 1 accesses a Non-GBR service; The user with UE ID = 2 accesses a Non-GBR service. Four users are connected to Operator B: The user with UE ID = 3 accesses a Non-GBR service of Service Slice 1; The user with UE ID = 4 accesses a Non-GBR service of Service Slice 1; The user with UE ID = 5 accesses a GBR service of Service Slice 2, and the user with UE ID = 6 accesses a GBR service of Service Slice 2.

[0048] Step 205: When the sorting strategies for operators and service slices are the same, the access users of the two types of operators and service slices queue up together. According to the service priority guarantee level, the GBR services with the same level are sorted together, and the sorting result is: UE ID = 5 → UE ID = 6; The Non-GBR services with the same level are sorted together, and the sorting result is: UE ID = 3 → UE ID = 1 → UE ID = 2 → UE ID = 4.

[0049] Step 206: Allocate resources in sequence according to the sorting result of the access users, the upper limit of the bandwidth occupied by each service slice, the bandwidth occupation rule, and the service resource requirements according to the sorting queue result:

[0050] The user with UE ID = 5 is allocated 20 RBs;

[0051] The user with UE ID = 6 is allocated 15 RBs;

[0052] The user with UE ID = 3 is allocated 30 RBs;

[0053] The user with UE ID = 1 is allocated 5 RBs;

[0054] The user with UE ID = 2 is allocated 15 RBs;

[0055] The user with UE ID = 4 is allocated 15 RBs.

[0056] Among them, the bandwidth resources allocated when scheduling users cannot exceed the full bandwidth.

[0057] Step 207: According to the resource allocation result, calculate the sum of the actual occupied bandwidth of all access users for each operator and each service slice: For operator A, the occupied bandwidth of service slice 1 is 20 RBs; for operator B, the occupied bandwidth of service slice 1 is 45 RBs; for operator B, the occupied bandwidth of service slice 2 is 35 RBs.

[0058] Step 208: Calculate the bandwidth correction value for the operator based on the actual occupied bandwidth of the operator and the bandwidth to which the operator belongs: The actual occupied bandwidth of operator A is 20 RBs, which is less than its upper bandwidth limit of 30 RBs (the upper bandwidth limit of this service slice is 50 RBs). Therefore, the bandwidth correction value is Δ A = 0 + 30 = 30.

[0059] Step 209: Calculate the bandwidth correction value for the service slice based on the actual occupied bandwidth of the service slice and the bandwidth to which the service slice belongs: Since only operator B serves 2 service slices, only calculate the bandwidth correction value for the service slices of operator B. The actual occupied bandwidth of service slice 1 of operator B is 45 RBs, and service slice 1 is 15 RBs greater than its upper bandwidth limit (the upper bandwidth limit of service slice 1 is 30 RBs). Therefore, the bandwidth correction value is Δ B,1 = 0 - 15 = -15.

[0060] Example 2:

[0061] Sharing method: 2 operators share 1 base station and serve 2 service slices. The number of operators and the types of service slices can both be greater than 2. The numbers listed in the example are only for illustration and do not constitute specific limitations.

[0062] Step 301: Determine the upper bandwidth limit for the operator and the upper bandwidth limit for the service slice according to the bandwidth occupancy rules for the operator and the service slice, including the bandwidth occupancy ratio: 2 operators share 20 MHz. The bandwidth occupancy ratio of operator A is 50%, and the bandwidth occupancy ratio of operator B is 50%. The upper bandwidth limits for operator A and operator B to occupy bandwidth resources are 20 MHz * 50% = 10 MHz, corresponding to 50 RBs. Operator A only serves service slice 1; operator B serves both service slice 1 and 2. The resource ratios occupied by the 2 service slices for operator B are 60% and 40% respectively. At the same time, the remaining bandwidth resources allow sharing between operators or between service slices.

[0063] Step 302: According to the bandwidth correction value Δ A = 30: Δ B,1=-15. Based on the bandwidth occupancy ratio and sharing method of the operator and service slice, calculate the upper limit of the bandwidth occupied by the service slice after correcting the current scheduling opportunity: The bandwidth upper limit of Operator A is: 50 + 30 = 80 RBs; the bandwidth upper limit of Service Slice 1 of Operator B is 30 - 15 = 15 RBs, and the bandwidth upper limit of Service Slice 2 is 100 - 80 - 15 = 5 RBs.

[0064] Step 303: Obtain the operator and service slice attributes to which the access users belong. Two users are connected to Operator A: The user with UE ID = 1 accesses a Non-GBR service; the user with UE ID = 2 accesses a Non-GBR service. Four users are connected to Operator B: The user with UE ID = 3 accesses a Non-GBR service of Service Slice 1; the user with UE ID = 4 accesses a Non-GBR service of Service Slice 1; the user with UE ID = 5 accesses a GBR service of Service Slice 2, and the user with UE ID = 6 accesses a GBR service of Service Slice 2.

[0065] Step 304: When the operator sorting strategy is the same and the service slice sorting strategy is different, the users of the same service slice of the two operators queue up together. According to the service priority guarantee level, the GBR service level is higher than the NGBR service. The GBR services of Service Slice 2 are sorted together, and the sorting result is: UE ID = 6 → UE ID = 5; the four Non-GBR service users of Service Slice 1 are sorted together, and the sorting result is: UE ID = 2 → UE ID = 3 → UE ID = 4 → UE ID = 1.

[0066] Step 305: Allocate resources in turn according to the upper limit of the bandwidth occupied by each service slice, the bandwidth occupancy rule, and the service resource requirements according to the sorting queue result:

[0067] The user with UE ID = 6 is allocated 5 RBs;

[0068] The user with UE ID = 5 is allocated 5 RBs;

[0069] The user with UE ID = 2 is allocated 40 RBs;

[0070] The user with UE ID = 3 is allocated 5 RBs;

[0071] The user with UE ID = 4 is allocated 15 RBs;

[0072] The user with UE ID = 1 is allocated 30 RBs.

[0073] Among them, the bandwidth resources allocated when scheduling users cannot exceed the full bandwidth.

[0074] Step 306: According to the resource allocation result, calculate the sum of the actual occupied bandwidths of all access users for each operator and each service slice: For operator A, the occupied bandwidth of service slice 1 is 70 RBs; for operator B, the occupied bandwidth of service slice 1 is 20 RBs; for operator B, the occupied bandwidth of service slice 2 is 10 RBs.

[0075] Step 307: Calculate the bandwidth correction value for the operator according to the actual occupied bandwidth of the operator and the bandwidth to which the operator belongs: The actual occupied bandwidth of operator A is 70 RBs, which is less than its upper bandwidth limit of 10 RBs (the upper bandwidth limit of this service slice is 80 RBs). Therefore, the bandwidth correction value is: Δ A = 0 + 10 = 10.

[0076] Step 308: Calculate the bandwidth correction value for the service slice according to the actual occupied bandwidth of the service slice and the bandwidth to which the service slice belongs: Since only operator B serves 2 service slices, only calculate the bandwidth correction value for the service slices of operator B. The actual occupied bandwidth of service slice 1 of operator B is 20 RBs, and service slice 1 is greater than its upper bandwidth limit by 5 RBs (the upper bandwidth limit of service slice 1 is 15 RBs). Therefore, the bandwidth correction value is Δ B,1 = 0 - 5 = -5.

[0077] Embodiment 3:

[0078] Sharing method: Two operators jointly build a network and share 3 base stations under the network, serving 2 service slices. The number of operators, the number of base stations, and the types of service slices can all be greater than 2. The numbers listed in the embodiments are only for example and do not constitute specific limitations.

[0079] Step 401: Determine the bandwidth occupancy rules for operators and service slices, including the bandwidth occupancy ratio: Base station 1 is exclusively occupied by operator A and only serves service slice 1; Base station 2 is shared by operator A and B. The bandwidth occupancy ratio of operator A is 50%, and it only serves service slice 1. The bandwidth occupancy ratio of operator B is 50%, and it serves service slice 1 and service slice 2. The two service slices share resources completely; Base station 3 is shared by operator A and B. The bandwidth occupancy ratio of operator A is 50%, serving service slice 1 and service slice 2. The bandwidth occupancy ratios of the two service slices are 50% and 50% respectively. The bandwidth occupancy ratio of operator B is 50%, and it only serves service slice 2; At the same time, the remaining bandwidth resources are allowed to be shared between operators or between service slices.

[0080] Step 402: Calculate the initial occupied bandwidth upper limit of each operator and each service slice in each base station under the network according to the bandwidth occupancy ratio of each operator and the sharing method. The bandwidth ratio of each base station at the initial scheduling is the same as the preset ratio:

[0081] The upper limit of the bandwidth occupied by Operator A at Base Station 1 is: 100 RBs, serving only Service Slice 1;

[0082] The upper limit of the bandwidth occupied by Operator A at Base Station 2 is: 100 * 50% = 50 RBs, serving only Service Slice 1; The bandwidth belonging to Operator B is 50 RBs, serving Service Slices 1 and 2, with no resource ratio requirement;

[0083] The upper limit of the bandwidth occupied by Operator A at Base Station 3 is: 100 * 50% = 50 RBs, among which the upper limit of the bandwidth occupied by Service Slice 1 is 25 RBs, and the upper limit of the bandwidth occupied by Service Slice 2 is 25 RBs; The upper limit of the bandwidth occupied by Operator B is 50 RBs, serving only Service Slice 2.

[0084] Step 403: Initial bandwidth correction value for base station scheduling: For 2 operators, only 1 operator's bandwidth correction value is required: Δ A,n = 0, n = 2, 3, where Base Station 1 does not require an operator bandwidth correction value; For serving 2 service slices, 1 service slice bandwidth correction value is required: Δ 1,3,A = 0, where Base Station 1 does not require a service slice correction value, Base Station 2 does not require a bandwidth correction value either, and Operator B at Base Station 3 does not require a service slice correction value either. Only Operator A at Base Station 3 requires a service slice correction value.

[0085] Step 404: Correct the upper limit of the bandwidth occupied by the operator at the current scheduling opportunity according to the bandwidth correction value: Since the bandwidth correction value is 0, the upper limit of the bandwidth occupied by each base station at the current scheduling opportunity is the same as the initial value.

[0086] Step 405: Different base stations respectively perform resource allocation according to the operator attribute of the accessing users and the operator sorting strategy, in accordance with the upper limit of the bandwidth occupied by the operator, the bandwidth occupancy rule, and the service resource requirements.

[0087] Step 406: According to the resource allocation result, count the sum of the actual bandwidths occupied by all accessing users of each operator:

[0088] Base Station 1: Users of Operator A are allocated 90 RBs;

[0089] Base Station 2: Users of Operator A are allocated 70 RBs;

[0090] Users of Operator B are allocated 30 RBs;

[0091] Base Station 3: Users of Service Slice 1 of Operator A are allocated 30 RBs;

[0092] Users of Service Slice 2 of Operator A are allocated 30 RBs;

[0093] Users of Operator B are allocated 40 RBs.

[0094] Step 407: Calculate the bandwidth correction value based on the actual occupied bandwidth of the operator and the bandwidth to which the operator belongs. The bandwidth correction value for Operator 2 of the base station is: Δ A,2 = 0 - 20 = -20; The bandwidth correction value for Operator 3 of the base station is: Δ A,3 = 0 - 10 = -10; The bandwidth correction value for the service slice of Operator A of the base station 3 is Δ 1,3,A = 0 - 5 = -5.

[0095] Step 408: Based on the bandwidth correction value, balance the services of different base stations. Locate the base station in the entire network that occupies the most resources of Operator A: Base Station 1. Base Station 1 only serves Operator A, and there are still remaining resources available for use in this base station. Select the base station that occupies the second most resources of Operator A: Base Station 2. Balance the services of Operator A in Base Station 2 to Base Station 1. At the same time, the service demand of Operator A in Base Station 2 has exceeded its bandwidth resource limit, and after balancing, it is also possible to achieve the balance of the services of the two operators within Base Station 2.

[0096] Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present invention can be implemented by a general-purpose computing device. They can be concentrated on a single computing device or distributed on a network composed of multiple computing devices. Optionally, they can be implemented by program codes executable by the computing device. Thus, they can be stored in a storage device and executed by the computing device. And in some cases, the steps shown or described can be executed in a sequence different from here, or they can be separately fabricated into individual integrated circuit modules, or multiple modules or steps among them can be fabricated into a single integrated circuit module to be implemented. In this way, the present invention is not limited to any specific combination of hardware and software.

[0097] The above are only the preferred embodiments of the present invention and are not used to limit the present invention. For those skilled in the art, the present invention can have various changes and modifications. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for resource allocation, comprising: determining the bandwidth of the operator and the bandwidth of the service slice according to a preset bandwidth occupancy rule; sorting the access users according to the attributes of the operators of the access users, the attributes of the service slices, a preset sorting strategy of the operators, and a preset sorting strategy of the service slices; allocating bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rule; said sorting the access users includes: when the sorting strategies of all the operators are the same and the sorting strategies of all the service slices are also the same, uniformly sorting all the access users; when the sorting strategies of all the service slices are different, putting the access users into different user queues for sorting respectively; when the sorting strategies of all the operators are the same while the sorting strategies of all the service slices are different, uniformly sorting the access users belonging to the same service slice.

2. The method according to claim 1, wherein, sorting the access users further includes: uniformly sorting the access users in the same service type of different service slices according to the service priority guarantee level.

3. The method according to claim 1, characterized in that when the bandwidth occupancy rule includes allowing the users allowed to access to occupy the remaining resources with each other, after determining the bandwidth of the operator and the bandwidth of the service slice, the method further comprises: correcting the bandwidth of the operator and / or the bandwidth of the service slice by using a bandwidth correction value, where the bandwidth correction value is used to balance the bandwidths of different operators and / or different service slices; said allocating bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rule includes: allocating bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth occupancy rule, the corrected bandwidth of the operator, and the corrected bandwidth of the service slice.

4. The method according to claim 3, wherein, determining the bandwidth resources actually occupied by the operator during the previous bandwidth resource allocation, and taking the difference between the bandwidth resources actually occupied by the operator during the previous time and the bandwidth of the access users during the previous time as the bandwidth correction value; or, determining the bandwidth resources actually occupied by the service slice during the previous bandwidth resource allocation, and taking the difference between the bandwidth resources actually occupied by the service slice during the previous time and the bandwidth of the service slice during the previous time as the bandwidth correction value.

5. A resource allocation device, comprising: a sorting module, configured to sort the access users according to the attributes of the operators of the access users, the attributes of the service slices, a preset sorting strategy of the operators, and a preset sorting strategy of the service slices; a scheduling module, configured to determine the bandwidth of the operator and the bandwidth of the service slice according to a preset bandwidth occupancy rule; Allocate bandwidth resources to the users in the sorting queue according to the sorting result of the access users, the bandwidth of the operator, the bandwidth of the service slice, and the preset bandwidth occupancy rule; The sorting of the access users includes: When the sorting strategies of all the operators are the same and the sorting strategies of all the service slices are also the same, sort all the access users uniformly; When the sorting strategies of the service slices are different, put the access users into different user queues for sorting respectively; When the sorting strategies of all the operators are the same while the sorting strategies of the service slices are different, sort the access users belonging to the same service slice uniformly.

6. The device according to claim 5, wherein, it further includes: A bandwidth resource correction module, configured to correct the bandwidth of the operator and / or the bandwidth of the service slice through a bandwidth correction value, where the bandwidth correction value is used to balance the bandwidths of different access user types and / or the bandwidths of different service slices.

7. A storage medium, wherein, The storage medium stores a computer program, wherein the computer program is set to execute the method described in any one of claims 1 to 4 when running.

8. An electronic device, including a memory and a processor, wherein, The memory stores a computer program, and the processor is set to run the computer program to execute the method described in any one of claims 1 to 4.

Images