CN113810995A

CN113810995A - Method, apparatus, network device and computer medium for resource allocation

Info

Publication number: CN113810995A
Application number: CN202010534964.XA
Authority: CN
Inventors: 刘洋; 杨峰义; 张建敏; 杨涛
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2020-06-12
Filing date: 2020-06-12
Publication date: 2021-12-17

Abstract

The present disclosure relates to methods, apparatuses, network devices and computer media for resource allocation. The method comprises the following steps: determining the current priority of each service flow borne in the network slice; for each service flow loaded in the network slice, determining the next priority of the service flow according to the current priority of the service flow and the channel quality of a user related to the service flow; and allocating time-frequency resources for each service flow according to the next priority of each service flow borne in the network slice. According to the technical scheme, by simultaneously considering the service flow priority reflecting the self requirement of the service flow and the channel quality of the user related to the service flow, more reasonable resources can be distributed to the service flow, so that the optimal utilization of the resources is realized, and the use efficiency of the resources is improved.

Description

Method, apparatus, network device and computer medium for resource allocation

Technical Field

The present disclosure relates to the field of wireless communications, and more particularly, to a method, apparatus, network device, and computer-readable storage medium for resource allocation in the field of wireless communications.

Background

With the coming of the 5G era, network services will gradually diversify according to the difference of application scenarios of the vertical industry. In order to meet the requirements of different services on network resources, 5G network slices are produced. Network slices are intended to share a set of 5G physical network infrastructure, to provide multiple virtual end-to-end sub-networks simultaneously, to dynamically share various types of network entity resources, but to exist and be managed relatively independently and isolated from each other, these virtual sub-networks being referred to as network slices.

Because the balance problem of network efficiency and complexity is considered, the slicing problem of the 5G access network side is not solved well all the time, and the problem is mainly reflected in the dynamic management of slicing resources. The dynamic management of slice resources requires that resources consumed in the operation of each network slice should be related to the real-time traffic of the slice as much as possible, and different slices should share the resources as much as possible to improve the resource utilization rate.

At present, the allocation of resources for network slices on the access network side is generally performed sequentially by a slice management layer and a user scheduling layer which are independent of each other. Allocating resources for the corresponding service flow according to the requirement of the service borne by the slice in the slice management layer, scheduling related users in the resources allocated to the service flow in the user scheduling layer, wherein the resource allocation of the slice management layer has no relation with the user scheduling of the user scheduling layer. While allocating resources for a slice and scheduling users as separate operations may reduce system complexity, such a hierarchical independent scheduling system does not achieve optimal utilization of radio resources.

For example, for a slice carrying a network game service, there are higher requirements on latency and bandwidth, so the slice management layer will allocate more time-frequency resources to the slice to process its related service flow with higher priority, but if the channel quality of the user related to the service flow of the service is not good, the user still cannot get a good service even if more time-frequency resources are allocated to the related service flow. Thus, the resources allocated to these traffic flows are wasted and used very inefficiently. On the contrary, for the slice carrying the non-real-time data download service, there is no special requirement on delay and bandwidth, so the slice manager will allocate less time-frequency resources to process its related service flow with lower priority, but if the channel quality of the users related to the service flow of the service is better, the users can be served preferentially when the network resources are free, so as to improve the network efficiency and leave more available resources for the future network utilization.

Therefore, in order to solve the problem of the inefficiency, it is desirable to provide a way to optimize resource allocation and thereby improve resource utilization efficiency.

Disclosure of Invention

The present disclosure provides a method, apparatus, network device, and computer-readable storage medium for resource allocation, which can optimize resource allocation and avoid inefficient situations when allocating resources.

According to an aspect of the present disclosure, there is provided a method for resource allocation, the method including: determining the current priority of each service flow borne in the network slice; for each service flow loaded in the network slice, determining the next priority of the service flow according to the current priority of the service flow and the channel quality of a user related to the service flow; and allocating time-frequency resources for each service flow according to the next priority of each service flow borne in the network slice.

According to another aspect of the present disclosure, there is provided an apparatus for resource allocation, the apparatus comprising means for performing the steps of the above method.

According to still another aspect of the present disclosure, there is provided a network device including: a memory storing computer-executable instructions; and a processor coupled to the memory, wherein the computer executable instructions, when executed by the processor, cause the processor to perform the above-described method.

According to yet another aspect of the present disclosure, there is provided a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, cause the processor to perform the above-described method.

According to the technical scheme, by simultaneously considering the service flow priority reflecting the self requirement of the service flow and the channel quality of the user related to the service flow, more reasonable resources can be distributed to the service flow, excessive resources are prevented from being distributed to the service flow with higher self priority but poorer user channel quality, and too few resources are prevented from being distributed to the service flow with lower self priority but better user channel quality, so that the optimal utilization of the resources is realized, and the use efficiency of the resources is improved.

Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.

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.

Fig. 1 is a schematic diagram of the overall architecture of a system according to an embodiment of the present disclosure.

Fig. 2 is a flow diagram of a method for resource allocation in accordance with an embodiment of the present disclosure.

Fig. 3 is a flowchart of a cross-layer scheduling method performed by a distributed processing unit DU according to an embodiment of the present disclosure.

Fig. 4 is an example of allocating resources according to an embodiment of the present disclosure.

Fig. 5 is a block diagram of an apparatus for resource allocation according to an embodiment of the present disclosure.

Fig. 6 is another block diagram of an apparatus for resource allocation according to an embodiment of the present disclosure.

Fig. 7 is a block diagram of a network device according to an embodiment of the 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, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the 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 those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate. In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

First, a schematic diagram of the overall architecture of a system 100 capable of implementing resource allocation is described with reference to fig. 1.

System 100 can implement resource allocation policies towards access network slices. The system 100 includes a core network and 5G base stations, and the 5G base stations may be divided into a centralized processing unit CU functional entity and a distributed processing unit DU functional entity. The operation of implementing the resource allocation policy on the access network side is mainly performed by the DU.

A network slice is set in the core network. The core network can set network slices for the service according to the vertical application and mark the network slices independently. Different services may be carried on different network slices according to their different needs. For example, traffic requiring low latency and high bandwidth (e.g., online network game traffic 1, online high definition video traffic 2) may be carried on network slice 1, and traffic requiring low latency and high reliability (e.g., real-time session traffic 3) may be carried on network slice 2. Network slice 1 and network slice 2 may each be assigned a unique slice number, denoted by S-NSSAI, that reflects the slice' S priority level. In the above example, the priority of the slice number of network slice 1 may be higher than the priority of the slice number of network slice 2, so that the network preferentially allocates sufficient resources to network slice 1. The assignment of the bearer and slice numbers for the traffic may be performed by the core network as per the technology that currently exists.

The traffic carried on a network slice exists in the form of traffic flows, which may also be referred to as PDU (protocol data unit) sessions, which are associated with the network slice number carrying it and which may be allocated on different DRBs (data resource bearers). The CU may be provided with a traffic stream controller, and the traffic stream controller may determine the priority order of the traffic streams according to different requirements of the traffic streams, so as to facilitate different configurations for the traffic streams. The CU adds different PDCP headers and RLC headers to the data packets in the service flow through a PDCP (packet data convergence protocol) protocol entity and an RLC (radio link control) protocol entity according to the priority order, and then transfers the data packets added with the headers to the MAC protocol entity. For example, QoS traffic flows 1 to 4 corresponding to traffic 1 and traffic 2 carried in slice 1 may be allocated on different DRBs. The CU may determine that traffic flows 1 and 2 have the highest latency and bandwidth requirements and therefore assign the highest priority to them for delivery to the DU via PDCP1 and RLC 1. The CU may determine that traffic flow 3 has less delay and bandwidth requirements and therefore assign a medium priority to traffic flow 3 for delivery to the DU via PDCP2 and RLC 2. The CU may determine that traffic flow 4 has the lowest latency and bandwidth requirements and therefore assign the lowest priority to traffic flow 4 for delivery to the DU via PDCP3 and RLC 3.

In DU, the prior art refers to MAC1 and MAC2, which allocate resources for traffic flows in network slice 1 and network slice 2, respectively, as long as the traffic flow priorities are high enough resources are allocated. The prior art then schedules the relevant users by MAC within the resources allocated by MAC1 and MAC2 for the traffic flow. The prior art does not consider the channel quality of the user itself at all when allocating resources for a traffic stream. In contrast, in the disclosed embodiment, MAC1, MAC2, and MAC are merged together to form a cross-layer scheduler as a whole, rather than being a separate structure layered above and below one another as shown in fig. 1, to optimize the allocation of resources by simultaneously taking into account traffic flow requirements and associated user channel quality. The cross-layer scheduling in the DU can allocate resources by considering both traffic flow requirements and associated user channel quality, the operation of which will be described in detail below.

Different service flows processed by the cross-layer scheduler share the same PHY layer entity, thereby sharing wireless resources.

A flow diagram of a method 200 for resource allocation according to an embodiment of the present disclosure is shown in fig. 2.

In S210, the current priority of each traffic flow carried in the network slice is determined.

For example, in the case that the traffic flow is not allocated with wireless time-frequency resources for transmission, the initial priority of the traffic flow is set by the CU according to different requirements of the traffic flow for at least one of latency, bandwidth, and reliability, and the initial priority is the current priority of the traffic flow. In the case that a traffic flow has been allocated with wireless time-frequency resources for transmission, the priority of the traffic flow may change with the passage of time (for example, as a user moves, the channel quality of the user deteriorates, so that the resources allocated to the traffic flow cannot serve the user well and are wasted, which may affect the priority of the traffic flow).

In S220, for each service flow carried in the network slice, a next priority of the service flow is determined according to the current priority of the service flow and the channel quality of the user associated with the service flow.

According to an embodiment of the present disclosure, the channel quality of a user associated with a traffic flow may be characterized by a channel quality indication, CQI, of the user in a previous transmission time interval, TTI. The priority of the traffic flow can be updated by simultaneously considering the state of the traffic flow itself and the channel condition of the relevant user. The calculation of the next priority for a traffic flow may be based on the following expression:

wherein, F_AIs the next priority, C, of traffic flow A_AIs the current priority of traffic A, K is the number of users associated with the traffic, n_kIs the bandwidth occupied by user k in traffic stream A, CQI_k，AIs the channel quality indication of user k in traffic flow A in the previous transmission time interval, N_AIs the bandwidth occupied by the traffic flow a, and α and β are numbers not less than 0 and not more than 1.

The calculation of the above expression may be performed by the DU. First calculation of F in DU_AWhen, C_AIs the initial priority of the traffic stream set by the CU. Then DU calculates F_AWhen, C_AIs F last calculated by DU_A。

The new priority calculated in the way not only considers the requirements of the service flow on performances such as time delay, bandwidth and reliability, but also considers the channel quality of the user related to the service flow, thereby avoiding the problems of resource waste when the channel quality of the user is poor although the requirement of the service flow is high and resource utilization is insufficient when the channel quality of the user is good although the requirement of the service flow is low, and ensuring that the recalculated priority can simultaneously consider both the requirement of the service flow and the channel quality of the user, thereby being capable of allocating more reasonable time-frequency resources for the service flow and optimizing the resource utilization.

In S230, a time-frequency resource is allocated to each traffic flow according to the next priority of each traffic flow carried in the network slice.

For example, for the higher priority traffic flow calculated in S220, more time-frequency resources are allocated thereto, and for the lower priority traffic flow calculated in S220, less time-frequency resources are allocated thereto, so that the lower priority traffic flow is properly served on the premise that the high priority traffic flow is sufficiently served.

According to the embodiment of the disclosure, after the time-frequency resources are allocated to the service flows, a proportional fairness algorithm can be adopted to schedule users related to the service flows in the time-frequency resources allocated to each service flow. Proportional fairness algorithms are well known in the art and will not be described in detail herein.

Compared with the current mode that the user channel condition is not considered when the resources are distributed to the service flows, the method of the embodiment of the disclosure can distribute more reasonable resources to the service flows by simultaneously considering the service flow requirements and the user channel quality related to the service flows, thereby realizing the optimal utilization of the resources and improving the use efficiency of the resources.

Fig. 3 shows a flowchart of a cross-layer scheduling method 300 performed by a distributed processing unit DU according to an embodiment of the present disclosure, and in particular, the method 300 may be performed by a cross-layer scheduler included in the DU.

In S310, a service flow carried in a network slice is partitioned into regions on time-frequency resources, so as to allocate region resources to the service flow in advance according to the priority of the service flow set by the CU, so as to correspond to a preset air interface resource region.

In S320, a traffic scheduling period starts.

In S330, a new priority of the traffic flow is calculated according to the priority of the previous cycle of the traffic flow and the channel quality of the user associated with the traffic flow. The calculation process is the same as the calculation process in S220 described above.

In S340, it is determined whether the calculated new priority coincides with the priority of the previous cycle. If the two are consistent, the process proceeds to S360, otherwise, the process proceeds to S350.

In S350, traffic flow resources are scheduled according to the new priority of the traffic flow. For example, more time-frequency resources are allocated to the traffic flow with higher priority, and/or the data of the traffic flow with higher priority is transmitted preferentially in time.

In S360, the users associated with the traffic flow are scheduled within the resources of the traffic flow, for example, by a proportional fair algorithm.

In S370, the traffic flow scheduling period ends.

Before the service flow scheduling period ends, S330 may be performed at predetermined intervals, or S330 may be performed when trigger information is received, where the trigger information may be that CQIs reported by multiple users related to the service flow are lower than a threshold, that feedback of the multiple users is not received within a predetermined time, that error information of the multiple users is received, or the like.

The method of the embodiment of the present disclosure may set the priority of the service flow through the service flow controller in the CU and may correspond to a preset air interface resource slice region for network slices of different vertical applications, thereby optimizing utilization of the air interface resources. And the DU carries out dynamic cross-layer scheduling of a slice scheduling layer and a user scheduling layer according to the priority of the service flow and the channel quality information of the users belonging to the service flow, which considers the priority of the service flow and the channel quality of the related users, optimizes the utilization efficiency of air interface resources, solves the problem of dynamic management of the service flow resources, and can provide high-quality user experience. In addition, for the existing 5G base station architecture design, the method according to the embodiment of the disclosure can be realized in a software upgrading mode, and the iteration cost is reduced.

An example of allocating resources according to an embodiment of the present disclosure is described below in conjunction with fig. 4.

In the example of fig. 4, service 1 and service 2 in the URLLC (ultra-high reliable and low latency communication) scenario and service 3 and service 4 in the eMBB (enhanced mobile broadband) scenario are involved. The traffic flows corresponding to service 1 and service 2 are carried on network slice 1, and the traffic flows corresponding to service 3 and service 4 are carried on network slice 2. Service flow 1 of service 1 has user group 1, service flow 2 of service 2 has user group 2, service flow 3 of service 3 has user group 3, and service flow 4 of service 4 has user group 4. Traffic flow controllers in the CUs prioritize the traffic flows according to their requirements for at least one of latency, bandwidth and reliability. The cross-layer scheduler in DU calculates the new priority of the service flow according to the original priority of the service flow and the channel information fed back by the user related to the service flow, and allocates the corresponding resource for the service flow in the time-frequency resource according to the new priority of the service flow, and the user scheduling of the corresponding user group is performed in the resource of the service flow through the proportional fair algorithm, thereby realizing the optimal utilization of the wireless resource facing the access network slice.

Having described the method for resource allocation according to the embodiments of the present disclosure, the following will describe block diagrams of the apparatus and the network device for resource allocation according to the embodiments of the present disclosure with reference to fig. 5 to 7.

The apparatus 500 for resource allocation shown in fig. 5 comprises a first determining means 510, a second determining means 520 and an allocating means 530. Each of these components may be implemented in hardware, software, firmware, or any combination thereof. The first determining means 510 may be configured to determine a current priority of each traffic flow carried in the network slice, and the second determining means 520 may be configured to determine, for each traffic flow carried in the network slice, a next priority of the traffic flow based on the current priority of the traffic flow and a channel quality of a user associated with the traffic flow. The allocating means 530 may be configured to allocate a time-frequency resource for each traffic flow carried in the network slice according to its next priority.

The above and/or other operations and functions of the first determining unit 510, the second determining unit 520 and the allocating unit 530 can refer to the above description in fig. 1 to 4, and are not repeated herein to avoid redundancy.

The device provided by the embodiment of the disclosure can allocate more reasonable resources to the service flow by simultaneously considering the service flow priority reflecting the self requirements of the service flow and the channel quality of the user related to the service flow, and avoid the situations of resource waste and resource underutilization, thereby realizing the optimal utilization of resources and improving the use efficiency of resources.

The first determining means 610, the second determining means 620 and the allocating means 630 in the apparatus 600 for resource allocation shown in fig. 6 are substantially the same as the first determining means 510, the second determining means 520 and the allocating means 530 in the apparatus 500.

According to an embodiment of the present disclosure, the first determining component 610 may be further configured to set an initial priority for each traffic flow as a current priority for each traffic flow according to different requirements of each traffic flow for at least one of latency, bandwidth and reliability.

According to an embodiment of the disclosure, the first determining component 610 may be in the CU.

According to an embodiment of the present disclosure, the second determining unit 620 may be further configured to determine a next priority of the traffic flow according to the current priority of the traffic flow and a channel quality indication CQI of a user associated with the traffic flow in a previous transmission time interval. For example, the next priority of the traffic flow may be calculated using the expression described above in S220.

According to an embodiment of the present disclosure, the second determining means 620 may be in the DU.

According to an embodiment of the present disclosure, the apparatus 600 may further include a scheduling component 640. The scheduling component 640 may be implemented in hardware, software, firmware, or any combination thereof. Scheduling component 640 may be configured to schedule users associated with each traffic flow using a proportional fair algorithm within the time-frequency resources allocated for that traffic flow.

The above and other operations and/or functions of the first determining unit 610, the second determining unit 620, the allocating unit 630 and the scheduling unit 640 in the apparatus 600 may refer to the related descriptions in fig. 1 to 4, and are not described herein again to avoid repetition.

The second determining means 620 in the arrangement 600 is able to allocate more reasonable resources for the traffic flow, using innovatively an expression that takes into account both the traffic flow requirements and the channel quality of the users associated with the traffic flow, thus achieving an optimal utilization of the resources.

In fig. 7, a block diagram of a network device 700 according to an embodiment of the disclosure is shown. The network device 700 may be a base station or may be a single device or a combination of multiple devices implementing the CU and DU functionality of the base station.

Network device 700 includes memory 710 and processor 720. The memory 710 may be a read-only memory, an optical disk, a hard disk, a magnetic disk, a flash memory, or any other non-volatile storage medium. The memory may store computer-executable instructions for implementing at least one of the

methods

200 and 300.

Processor 720 may be coupled to memory 710, for example, by a bus, and may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 720 is configured to execute computer-executable instructions stored in the memory 710 for implementing at least one of the

methods

200 and 300. Through the execution of the computer executable instruction, more reasonable resources can be distributed to the service flow, so that the utilization of the resources is optimized, and the use efficiency of the resources is improved.

The network device 700 may be connected to an external storage device through a read/write interface to call external data, as in the conventional computer device, and may also be connected to a network or other computer device through a network interface, which will not be described in detail herein.

According to an embodiment of the present disclosure, computer-executable instructions for performing at least one of the

methods

200 and 300 may be stored on a computer-readable storage medium, and when executed by a processor, enable the processor to perform the corresponding steps, thereby enabling more reasonable resources to be allocated for traffic flows and optimizing utilization of the resources.

The apparatus 500, 600 and the network device 700 described above may each be connected as a networking device in a wireless communication network to communicate with end users and/or other devices.

As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, 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.

The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Thus far, the present disclosure has been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.

The method and system 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, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied 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 foregoing examples are for purposes of 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 present disclosure. The scope of the present disclosure is defined by the appended claims.

Claims

1. A method for resource allocation, comprising:

determining the current priority of each service flow borne in the network slice;

for each service flow loaded in the network slice, determining the next priority of the service flow according to the current priority of the service flow and the channel quality of a user related to the service flow; and

and allocating time-frequency resources for each service flow according to the next priority of each service flow borne in the network slice.

2. The method of claim 1, wherein the determining a current priority of each traffic flow carried in a network slice comprises:

and setting an initial priority for each service flow according to different requirements of each service flow on at least one of time delay, bandwidth and reliability, wherein the initial priority is used as the current priority of each service flow.

3. The method according to claim 2, wherein the setting of the initial priority is performed by the centralized processing unit, CU.

4. The method of claim 1, wherein the determining the next priority for the traffic flow based on the current priority for the traffic flow and the channel quality of the user associated with the traffic flow comprises:

and determining the next priority of the service flow according to the current priority of the service flow and the Channel Quality Indicator (CQI) of the user related to the service flow in the previous sending time interval.

5. The method of claim 4, wherein the next priority of a traffic flow is determined by the expression:

6. The method of claim 4, wherein the determination of the next priority of the traffic flow is performed by a distributed processing unit, DU.

7. The method of claim 1, further comprising:

and scheduling users related to the service flow by adopting a proportional fairness algorithm in the time-frequency resources distributed for each service flow.

8. An apparatus for resource allocation comprising means for performing the steps of the method according to any one of claims 1-7.

9. A network device, comprising:

a memory storing computer-executable instructions; and

a processor coupled with the memory, wherein the computer-executable instructions, when executed by the processor, cause the processor to perform the method of any of claims 1-7.

10. A computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions, when executed by a processor, cause the processor to perform the method of any one of claims 1-7.