Scheduling method of multi service multiplexing supporting medium access control lay

Abstract

The invention relates to a multi-service integration dispatching method that supports the medium access control layer. The order of priority for system dispatching radio bearer services in each dispatching time unit TTI is as follows: a delay-constrained (GD) service, a minimum guaranteed bandwidth (GB) service and a best effort (BE) service; in the course of dispatching, if resource blocks are not used up when the resource blocks are dispatched to a certain radio bearer, the rest of the resource blocks will be dispatched to other radio bearers in the same UE as the radio bearer; if the rest of the number of resource blocks is zero, the average speed of all radio bearers will be renewed and next dispatching time unit will be entered. The invention avoids the problem that a service of high priority occupies resources of a service of low priority and ensures minimum QOS requirements of two services using definite proportional fair scheduling algorithm specific to GD and GB services.

Description

technical field [0001] The invention relates to a scheduling method for multi-service multiplexing of a medium access control layer (MAC). Background technique [0002] In order to optimize the data throughput of the system, it is very important to reduce padding in the MAC Protocol Data Unit (PDU). In the Long Term Evolution Project (LTE) of the Third Generation Partnership Project (3GPP), the currently defined technical solutions related to the present invention in the MAC layer mainly include: [0003] 1. Multiplex the PDUs from one (or more) radio bearer layers (RLC) to the transport block, and submit them to the physical layer through the transport channel; [0004] 2. Demultiplex the RLC PDUs from the transport blocks of the transport channel onto one or more radio bearers; [0005] 3. Control the priority of different logical channels in the user terminal (UE); [0006] 4. Rely on dynamic scheduling to control the priority of different UEs; [0007] 5. Filling (to...

AI Technical Summary

Problems solved by technology

For example, low priority radio bearers may be "starved" by high priority radio bearers

[0011] 2. It is difficult for the scheduler to accurately allocate resources between radio bearers of various levels of QOS, because the scheduler only knows the detailed parameters of the radio bearer with the highest QOS level of the UE

[0012] 3. Between different UEs, the low priority radio bearers of some UEs may preempt the resources of high priority radio bearers of other UEs

[0013] In addition, the traditional wireless packet scheduling scheme does not support the multiplexing of multiple services at the MAC layer, and cannot be directly used in LTE mobile communication systems

Images