CN112469134B - Method and terminal for scheduling MAC layer data reasonably - Google Patents

Method and terminal for scheduling MAC layer data reasonably Download PDF

Info

Publication number
CN112469134B
CN112469134B CN202011370191.2A CN202011370191A CN112469134B CN 112469134 B CN112469134 B CN 112469134B CN 202011370191 A CN202011370191 A CN 202011370191A CN 112469134 B CN112469134 B CN 112469134B
Authority
CN
China
Prior art keywords
data
mac scheduler
priority queue
tti
allowed
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.)
Active
Application number
CN202011370191.2A
Other languages
Chinese (zh)
Other versions
CN112469134A (en
Inventor
傅福星
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ankexun Fujian Technology Co ltd
Original Assignee
Ankexun Fujian Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ankexun Fujian Technology Co ltd filed Critical Ankexun Fujian Technology Co ltd
Priority to CN202011370191.2A priority Critical patent/CN112469134B/en
Publication of CN112469134A publication Critical patent/CN112469134A/en
Application granted granted Critical
Publication of CN112469134B publication Critical patent/CN112469134B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/52Allocation or scheduling criteria for wireless resources based on load
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient

Abstract

The invention discloses a method and a terminal for reasonably scheduling MAC layer data, which stores received data into corresponding queues according to a logic channel where the received data is located, wherein the queues comprise a high-priority queue and a low-priority queue; calculating the actual time t for the MAC scheduler to process data in each TTI; according to the actual time t, the maximum time t0 allowed by the MAC scheduler to operate and the operation state of the MAC scheduler, the number of the UE allowed to be processed by the MAC scheduler in each TTI, the number of the data in the high-priority queue and the number of the data in the low-priority queue are adjusted, so that the system can distribute pressure to each TTI when the load is heavy at a certain moment, the stability of the system is ensured on one hand, the performance of the system is maximized on the other hand, the MAC scheduler can process more users and larger service data volume, the data can be reasonably scheduled, and the performance and the stability of the system are ensured.

Description

Method and terminal for scheduling MAC layer data reasonably
The scheme is a divisional application of a parent application named as 'a method and a terminal for MAC layer data scheduling', wherein the application number is 201711381230.7, the application date is 2017, 12 and 20.
Technical Field
The invention relates to the field of network communication, in particular to a method and a terminal for scheduling MAC layer data reasonably.
Background
With the global spread of the fourth generation mobile communication system (4G), the accelerated popularization and growth of 4G commercial networks, and the continuous growth of wireless data services. 4G has become the most widely used communication method in daily life. The practical deployment of 4G networks faces challenges in terms of coverage, capacity, construction difficulty, and off-grid, especially in areas of interior, indoor, and underground spaces of a portion of a building complex. The small-sized base station is used for compensating a blind area which cannot be covered by the macro station 4G signal. However, at the present time when 4G users are increasing, the small base station has the defects of limited capacity and poor processing performance, which is the greatest defect. Therefore, it is desirable to provide a method for improving the system performance of the base station to support more users.
Each sublayer in the LTE protocol stack has its own function, where the Media Access Control (MAC) layer is the main one related to user capacity performance. The scheduler processing mechanism of the MAC layer is reasonably designed, so that the processing capacity of the system can be improved, the number of accessed users can be increased, and the smoothness and stability of the system can be ensured.
The existing base station has limited capacity and poor performance. For places with slightly dense crowds, the user experience effect is often poor. This is mainly due to the single design of the scheduler at the MAC layer and the incomplete consideration of the scheduling policy. The design of the scheduler usually depends on the direct Processing of Data Units (PDUs) transmitted by a radio link control layer (RLC), or the direct processing of data Buffer Status (BSR) reported by an end User (UE). And the number of users handled per time interval (TTI) is fixed and inflexible. Each TTI handles either 1 UE or multiple UEs. The processing mechanism can timely transmit uplink and downlink data services of the user and is simpler. But can only handle fewer UEs or less data traffic. Once the number of UEs is increased, the data service of the user reaches a peak value, when the load of the scheduler is heavy, the data services required to be processed by different TTIs are uneven, there are more TTIs for processing data services and fewer TTIs for processing data services, fewer problems are not great, if more TTIs are processed by the MAC scheduler, the MAC scheduler cannot be timely processed to cause frequent desynchronization with a physical layer (PHY), data is not timely transmitted to be sent to the UE, data loss is caused, and the system is also prone to abnormality.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method and the terminal for scheduling the MAC layer data reasonably are provided, the data can be scheduled reasonably, and the performance and the stability of a system are ensured.
In order to solve the technical problems, the invention adopts a technical scheme that:
a method for reasonably scheduling MAC layer data comprises the following steps:
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
and S3, adjusting the number of the UE, the data number of the high-priority queue and the data number of the low-priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
a terminal for fair scheduling of MAC layer data scheduling, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor when executing the computer program implementing the steps of:
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
and S3, adjusting the number of the UE, the data number of the high-priority queue and the data number of the low-priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler.
The invention has the beneficial effects that: the received data is stored in different high-low priority queues according to the logic channel where the received data is located, the number of the UE allowed to be processed by each TTI, the number of the data in the high-priority queues and the number of the data in the low-priority queues of the MAC scheduler are dynamically adjusted through the comparison of the actual time of the MAC scheduler for processing the data in each TTI with the maximum time allowed to be operated and the operation state of the MAC scheduler, and the pressure can be distributed to each TTI when the load of the system is heavy at a certain moment.
Drawings
Fig. 1 is a flowchart of a method for scheduling MAC layer data reasonably according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a terminal for scheduling MAC layer data reasonably according to an embodiment of the present invention;
description of reference numerals:
1. a terminal for MAC layer data scheduling; 2. A memory; 3. A processor.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
The most key concept of the invention is as follows: and dynamically adjusting the number of the UE, the data number of the high-priority queue and the data number of the low-priority queue which are allowed to be processed by the MAC scheduler in each TTI through the comparison between the actual time of the MAC scheduler for processing the data in each TTI and the maximum time allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler.
Referring to fig. 1, a method for scheduling MAC layer data reasonably includes the steps of:
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
and S3, adjusting the number of the UE, the data number of the high-priority queue and the data number of the low-priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler.
As can be seen from the above description, the beneficial effects of the present invention are: the received data is stored in different high-low priority queues according to the logic channel where the received data is located, the number of the UE allowed to be processed by each TTI, the number of the data in the high-priority queues and the number of the data in the low-priority queues of the MAC scheduler are dynamically adjusted through the comparison of the actual time of the MAC scheduler for processing the data in each TTI with the maximum time allowed to be operated and the operation state of the MAC scheduler, and the pressure can be distributed to each TTI when the load of the system is heavy at a certain moment.
Further, before step S1, the method further includes the steps of:
s0, initializing the MAC scheduler, presetting N number of UE allowed to be processed by the MAC scheduler in each TTI, N number of data of a high priority queue and M number of data of a low priority queue, and setting the initial running state of the MAC scheduler to be S0.
As can be seen from the above description, initializing the MAC scheduler not only ensures the sequential performance of the subsequent steps, but also can set different initial parameters according to different scenarios to adapt to different application scenarios, and thus the flexibility is high.
Further, the step S1 specifically includes:
the queues comprise a retransmission high-priority queue, a retransmission low-priority queue, a new transmission high-priority queue and a new transmission low-priority queue;
when receiving a data, judging whether the data is the retransmission data or the new transmission data, and storing the data into a corresponding high priority queue or a corresponding low priority queue according to a logic channel where the data is located.
As can be seen from the above description, the data is classified according to the received data types, each data type is subdivided, and each data type is stored in the high-priority queue or the low-priority queue according to the logical channel in which the data type is located, so that the data with high priority can be preferentially processed while different data services are distinguished, and the reliability of data transmission can be ensured.
Further, the step S2 specifically includes:
ind, when the MAC scheduler receives an instruction from the PHY layer, starts timing as the start of the current TTI of the MAC scheduler, and ends timing when the MAC scheduler completes data processing, and the time t obtained by timing is used as the actual time t for the MAC scheduler to process data in each TTI.
As can be seen from the above description, the parameter adjustment is performed based on the actual time consumed by the MAC scheduler to perform data processing in each TTI, and the time can most directly reflect the processing capability of the MAC layer, so that the adjustment is more accurate and reliable, and the terminal access as many as possible can be supported.
Further, the step S3 specifically includes:
when the operation state of the MAC scheduler is S0, determining whether t is greater than t0, if yes, performing step S31, otherwise, performing step S32;
s31, judging whether the number of data in the high-priority queue is larger than or equal to N, if so, increasing the number of data in the high-priority queue allowed to be processed by the MAC scheduler in each TTI, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S1, otherwise, judging whether the number of data in the low-priority queue is larger than or equal to M, if so, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S2;
s32, increasing the number of UE allowed to be processed by the MAC scheduler in each TTI;
when the operation state of the MAC scheduler is S1, determining whether t is greater than t0, if yes, performing step S33, otherwise, performing step S34;
s33, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s34, reducing the number of data of a high-priority queue allowed to be processed by the MAC scheduler in each TTI, increasing the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the high-priority queue and the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI are respectively restored to N and M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s1, if the data of the low-priority queue overflows, reducing the number of the UE which is allowed to be processed by the MAC scheduler in each TTI, resetting the number of the data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI as N and the number of the data of the low-priority queue as M, and converting the operation state of the MAC scheduler into s 0;
when the operation state of the MAC scheduler is S2, determining whether t is greater than t0, if yes, performing step S35, otherwise, performing step S36;
s35, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s36, increasing the number of data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI is M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s2, if the data of the low-priority queue overflows, the number of the UE which is allowed to be processed by the MAC scheduler in each TTI is reduced, the number of the data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI is reset to be N, the number of the data of the low-priority queue is reset to be M, and the operation state of the MAC scheduler is converted into s 0.
It can be known from the above description that, when adjusting the data allowed to be processed by the MAC scheduler, the number of data in the high-low priority queue allowed to be processed by the MAC scheduler is preferentially adjusted, and then the number of UEs allowed to be processed is adjusted, which does not affect the overall stability of the system, and can maximize the performance capacity, thereby ensuring that the processing capability of the system is smoothly transited from busy time to idle time under the optimal condition, improving the robustness of the system, and by adjusting the number of UEs, avoiding the abnormality of the system processing when the number of data of the same priority level is large, and improving the flexibility of the system itself.
Referring to fig. 2, a terminal for scheduling reasonable MAC layer data includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the following steps:
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
and S3, adjusting the number of the UE, the data number of the high-priority queue and the data number of the low-priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler.
As can be seen from the above description, the beneficial effects of the present invention are: the received data is stored in different high-low priority queues according to the logic channel where the received data is located, the number of the UE allowed to be processed by each TTI, the number of the data in the high-priority queues and the number of the data in the low-priority queues of the MAC scheduler are dynamically adjusted through the comparison of the actual time of the MAC scheduler for processing the data in each TTI with the maximum time allowed to be operated and the operation state of the MAC scheduler, and the pressure can be distributed to each TTI when the load of the system is heavy at a certain moment.
Further, before step S1, the method further includes the steps of:
s0, initializing the MAC scheduler, presetting N number of UE allowed to be processed by the MAC scheduler in each TTI, N number of data of a high priority queue and M number of data of a low priority queue, and setting the initial running state of the MAC scheduler to be S0.
As can be seen from the above description, initializing the MAC scheduler not only ensures the sequential performance of the subsequent steps, but also can set different initial parameters according to different scenarios to adapt to different application scenarios, and thus the flexibility is high.
Further, the step S1 specifically includes:
the queues comprise a retransmission high-priority queue, a retransmission low-priority queue, a new transmission high-priority queue and a new transmission low-priority queue;
when receiving a data, judging whether the data is retransmitted or newly transmitted, and storing the data into a corresponding high-priority queue or a corresponding low-priority queue according to a logic channel where the data is located.
As can be seen from the above description, the data is classified according to the received data types, each data type is subdivided, and each data type is stored in the high-priority queue or the low-priority queue according to the logical channel in which the data type is located, so that the data with high priority can be preferentially processed while different data services are distinguished, and the reliability of data transmission can be ensured.
Further, the step S2 specifically includes:
ind, when the MAC scheduler receives an instruction from the PHY layer, starts timing as the start of the current TTI of the MAC scheduler, and ends timing when the MAC scheduler completes data processing, and the time t obtained by timing is used as the actual time t for the MAC scheduler to process data in each TTI.
As can be seen from the above description, the parameter adjustment is performed based on the actual time consumed by the MAC scheduler to perform data processing in each TTI, and the time can most directly reflect the processing capability of the MAC layer, so that the adjustment is more accurate and reliable, and the terminal access as many as possible can be supported.
Further, the step S3 specifically includes:
when the operation state of the MAC scheduler is S0, determining whether t is greater than t0, if yes, performing step S31, otherwise, performing step S32;
s31, judging whether the number of data in the high-priority queue is larger than or equal to N, if so, increasing the number of data in the high-priority queue allowed to be processed by the MAC scheduler in each TTI, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S1, otherwise, judging whether the number of data in the low-priority queue is larger than or equal to M, if so, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S2;
s32, increasing the number of UE allowed to be processed by the MAC scheduler in each TTI;
when the operation state of the MAC scheduler is S1, determining whether t is greater than t0, if yes, performing step S33, otherwise, performing step S34;
s33, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s34, reducing the number of data of a high-priority queue allowed to be processed by the MAC scheduler in each TTI, increasing the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the high-priority queue and the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI are respectively restored to N and M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s1, if the data of the low-priority queue overflows, reducing the number of the UE which is allowed to be processed by the MAC scheduler in each TTI, resetting the number of the data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI as N and the number of the data of the low-priority queue as M, and converting the operation state of the MAC scheduler into s 0;
when the operation state of the MAC scheduler is S2, determining whether t is greater than t0, if yes, performing step S35, otherwise, performing step S36;
s35, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s36, increasing the number of data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI is M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s2, if the data of the low-priority queue overflows, the number of the UE which is allowed to be processed by the MAC scheduler in each TTI is reduced, the number of the data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI is reset to be N, the number of the data of the low-priority queue is reset to be M, and the operation state of the MAC scheduler is converted into s 0.
It can be known from the above description that, when adjusting the data allowed to be processed by the MAC scheduler, the number of data in the high-low priority queue allowed to be processed by the MAC scheduler is preferentially adjusted, and then the number of UEs allowed to be processed is adjusted, which does not affect the overall stability of the system, and can maximize the performance capacity, thereby ensuring that the processing capability of the system is smoothly transited from busy time to idle time under the optimal condition, improving the robustness of the system, and by adjusting the number of UEs, avoiding the abnormality of the system processing when the number of data of the same priority level is large, and improving the flexibility of the system itself.
Example one
Referring to fig. 1, a method for scheduling MAC layer data reasonably includes the steps of:
s0, initializing the MAC scheduler, presetting N number of UE, N number of data of a high priority queue and M number of data of a low priority queue which are allowed to be processed by the MAC scheduler in each TTI, and setting the initial running state of the MAC scheduler to be S0;
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
the queues comprise a retransmission high-priority queue, a retransmission low-priority queue, a new transmission high-priority queue and a new transmission low-priority queue, and the priority sequence of the queues is as follows: retransmitting the high priority queue, retransmitting the low priority queue, newly transmitting the high priority queue and newly transmitting the low priority queue;
when receiving a data, judging whether the data is retransmitted or newly transmitted data, and storing the data into a corresponding high-priority queue or low-priority queue according to a logical channel where the data is located, specifically, when the RLC data is retransmitted, analyzing the logical channel where the data is located, and storing the logical channel into a corresponding high-priority queue or low-priority queue for retransmission; when newly transmitted data is received, firstly analyzing a logic channel where the data is located, and storing the logic channel into a corresponding newly transmitted high-priority queue or a corresponding newly transmitted low-priority queue;
the specific steps of storing the received data into the corresponding queue according to the logical channel where the received data is located are as follows: if the real-time requirement of the received data is high, such as video voice service data, the received data is stored in a high-priority queue, and if the real-time requirement of the received data is low, such as common data service data, the received data is stored in a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
ind, starting timing as the start of the current TTI of the MAC scheduler when the MAC scheduler receives an instruction from a PHY layer, finishing timing when the MAC scheduler finishes data processing, and taking the time t obtained by timing as the actual time t for the MAC scheduler to process data in each TTI;
the actual time t for the MAC scheduler to process the data in each TTI is related to the amount of the data to be processed currently, if the data to be processed currently by the MAC scheduler is less, the data to be processed by the MAC scheduler in one TTI is less, and the time t consumed by corresponding processing of the data is shorter;
s3, adjusting the number of UE, the number of data of a high priority queue and the number of data of a low priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler;
for each group of high-priority queues and low-priority queues, the number of data of the high-priority queues and the number of data of the low-priority queues allowed to be processed by the corresponding MAC scheduler in each TTI (transmission time interval), namely, for the retransmission high-priority queues and the retransmission low-priority queues, the number of data of the new transmission high-priority queues and the number of data of the new transmission low-priority queues allowed to be processed by the corresponding MAC scheduler in each TTI;
when data is received, relevant parameters of high-priority queues and low-priority queues of queues corresponding to the data are adjusted, namely the number of data of the high-priority queues and the number of data of the low-priority queues allowed to be processed by an MAC scheduler corresponding to the high-priority queues or the low-priority queues in each TTI, wherein the high-priority queues and the low-priority queues are stored with the data;
specifically, when the operation state of the MAC scheduler is S0, it is determined whether t is greater than t0, if yes, step S31 is executed, otherwise, step S32 is executed;
s31, judging whether the number of data in the high-priority queue is larger than or equal to N, if so, increasing the number of data in the high-priority queue allowed to be processed by the MAC scheduler in each TTI, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S1, otherwise, judging whether the number of data in the low-priority queue is larger than or equal to M, if so, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S2;
s32, increasing the number of UE allowed to be processed by the MAC scheduler in each TTI, wherein the number of UE allowed to be processed by the MAC scheduler in each TTI has a maximum value nmaxThe value is the maximum number of access UEs that the system can support;
when the operation state of the MAC scheduler is S1, determining whether t is greater than t0, if yes, performing step S33, otherwise, performing step S34;
s33, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s34, reducing the number of data of a high-priority queue allowed to be processed by the MAC scheduler in each TTI, increasing the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the high-priority queue and the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI are respectively restored to N and M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s1, if the data of the low priority queue overflows, reducing the number of UE which is allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of the high priority queue which is allowed to be processed by the MAC scheduler in each TTI as N and the number of data of the low priority queue as M, and converting the operation state of the MAC scheduler into s0,
when the operation state of the MAC scheduler is S2, determining whether t is greater than t0, if yes, performing step S35, otherwise, performing step S36;
s35, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s36, increasing the number of data of low priority queues allowed to be processed by the MAC scheduler in each TTI, if the number of the data of the low priority queues allowed to be processed by the MAC scheduler in each TTI is M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s2, if the data of the low-priority queue overflows, the number of the UE which is allowed to be processed by the MAC scheduler in each TTI is reduced, the number of the data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI is reset to be N, the number of the data of the low-priority queue is reset to be M, and the operation state of the MAC scheduler is converted into s 0.
Example two
Referring to fig. 2, a terminal 1 for scheduling MAC layer data reasonably includes a memory 2, a processor 3, and a computer program stored in the memory 2 and executable on the processor 3, where the processor 3 implements the steps in the first embodiment when executing the computer program.
In summary, the method and terminal for scheduling MAC layer data reasonably provided by the present invention store the received data into different high and low priority queues according to the logical channel where the received data is located, and dynamically adjust the number of UEs allowed to process in each TTI, the number of data in the high priority queue, and the number of data in the low priority queue by comparing the actual time of processing data in each TTI by the MAC scheduler with the maximum time allowed to operate, and the operating state of the MAC scheduler, so as to grasp the load level of the system time, dynamically adjust the variable representing the processing capability of the system, and during dynamic adjustment, it can be determined which data need to be processed preferentially and which data can be processed with delay, thereby performing reasonable scheduling, maximizing the performance capacity of the system, and because the adjusted number of data in the high and low priority queues allowed to be processed in each TTI by the MAC scheduler, the current data is not actually processed in each time slot, so the adjustment does not affect the overall stability of the system, but the adjustment of the number of UEs allowed to be processed by the MAC scheduler in each TTI affects the ability of the MAC scheduler to schedule users in the current period of time (for example, the number of users is large or the traffic is heavy in this period of time), but can ensure the stability of the system, and ensure that the system processing ability is smoothly transited from busy time to idle time under the optimal condition, thereby ensuring the stability of the system on the one hand, and maximizing the performance of the system on the other hand, so that the system can process more users and larger traffic data amount.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.

Claims (6)

1. A method for reasonably scheduling MAC layer data is characterized by comprising the following steps:
s1, storing the received data into a corresponding queue according to the logic channel where the received data is located, wherein the queue comprises a high priority queue and a low priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
s3, according to the actual time t, the maximum time t0 allowed by the MAC scheduler to operate and the operation state of the MAC scheduler, adjusting the number of UE allowed to be processed by the MAC scheduler in each TTI, the data number of a high-priority queue and the data number of a low-priority queue;
wherein, before step S1, the method further comprises the steps of:
s0, initializing the MAC scheduler, presetting N number of UE, N number of data of a high priority queue and M number of data of a low priority queue which are allowed to be processed by the MAC scheduler in each TTI, and setting the initial running state of the MAC scheduler to be S0;
the step S3 specifically includes:
when the operation state of the MAC scheduler is S0, determining whether t is greater than t0, if yes, performing step S31, otherwise, performing step S32;
s31, judging whether the number of data in the high-priority queue is larger than or equal to N, if so, increasing the number of data in the high-priority queue allowed to be processed by the MAC scheduler in each TTI, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S1, otherwise, judging whether the number of data in the low-priority queue is larger than or equal to M, if so, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S2;
s32, increasing the number of UE allowed to be processed by the MAC scheduler in each TTI;
when the operation state of the MAC scheduler is S1, determining whether t is greater than t0, if yes, performing step S33, otherwise, performing step S34;
s33, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s34, reducing the number of data of a high-priority queue allowed to be processed by the MAC scheduler in each TTI, increasing the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the high-priority queue and the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI are respectively restored to N and M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s1, if the data of the low-priority queue overflows, reducing the number of UE (user equipment) which are allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI to be N and the number of data of the low-priority queue to be M, and converting the operation state of the MAC scheduler into s 0;
when the operation state of the MAC scheduler is S2, determining whether t is greater than t0, if yes, performing step S35, otherwise, performing step S36;
s35, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s36, increasing the number of data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI is M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s2, if the data of the low-priority queue overflows, reducing the number of UE (user equipment) which are allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI to be N and the number of data of the low-priority queue to be M, and converting the operation state of the MAC scheduler into s 0;
the storing the received data into the corresponding queue according to the logical channel where the received data is located includes:
if the real-time requirement of the received data is high, the received data is stored in a high-priority queue, and if the real-time requirement of the received data is low, the received data is stored in a low-priority queue.
2. The method for MAC layer data scheduling with reasonable scheduling according to claim 1, wherein the step S1 specifically includes:
the queues comprise a retransmission high-priority queue, a retransmission low-priority queue, a new transmission high-priority queue and a new transmission low-priority queue;
when receiving a data, judging whether the data is retransmitted or newly transmitted, and storing the data into a corresponding high-priority queue or a corresponding low-priority queue according to a logic channel where the data is located.
3. The method for MAC layer data scheduling with reasonable scheduling according to claim 1, wherein the step S2 specifically includes:
ind, when the MAC scheduler receives an instruction from the PHY layer, starts timing as the start of the current TTI of the MAC scheduler, and ends timing when the MAC scheduler completes data processing, and the time t obtained by timing is used as the actual time t for the MAC scheduler to process data in each TTI.
4. A terminal for fair scheduling of MAC layer data comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor when executing the computer program performs the steps of:
s1, storing the received data into corresponding queues according to the logic channels where the received data are located, wherein the queues comprise a high-priority queue and a low-priority queue;
s2, calculating the actual time t for the MAC scheduler to process data in each TTI;
s3, adjusting the number of UE, the number of data of a high priority queue and the number of data of a low priority queue which are allowed to be processed by the MAC scheduler in each TTI according to the actual time t, the maximum time t0 allowed to be operated by the MAC scheduler and the operation state of the MAC scheduler;
wherein, before step S1, the method further comprises the steps of:
s0, initializing the MAC scheduler, presetting N number of UE, N number of data of a high priority queue and M number of data of a low priority queue which are allowed to be processed by the MAC scheduler in each TTI, and setting the initial running state of the MAC scheduler to be S0;
the step S3 specifically includes:
when the operation state of the MAC scheduler is S0, determining whether t is greater than t0, if yes, performing step S31, otherwise, performing step S32;
s31, judging whether the number of data in the high-priority queue is larger than or equal to N, if so, increasing the number of data in the high-priority queue allowed to be processed by the MAC scheduler in each TTI, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S1, otherwise, judging whether the number of data in the low-priority queue is larger than or equal to M, if so, reducing the number of data in the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and converting the operation state of the MAC scheduler into S2;
s32, increasing the number of UE allowed to be processed by the MAC scheduler in each TTI;
when the operation state of the MAC scheduler is S1, determining whether t is greater than t0, if yes, performing step S33, otherwise, performing step S34;
s33, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s34, reducing the number of data of a high-priority queue allowed to be processed by the MAC scheduler in each TTI, increasing the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the high-priority queue and the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI are respectively restored to N and M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s1, if the data of the low-priority queue overflows, reducing the number of UE (user equipment) which are allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI to be N and the number of data of the low-priority queue to be M, and converting the operation state of the MAC scheduler into s 0;
when the operation state of the MAC scheduler is S2, determining whether t is greater than t0, if yes, performing step S35, otherwise, performing step S36;
s35, reducing the number of UE allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of a high-priority queue and the number of data of a low-priority queue allowed to be processed by the MAC scheduler in each TTI as N and M, and converting the running state of the MAC scheduler into S0;
s36, increasing the number of data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI, and if the number of the data of the low-priority queue allowed to be processed by the MAC scheduler in each TTI is M, converting the running state of the MAC scheduler into S0;
when the operation state of the MAC scheduler is s2, if the data of the low-priority queue overflows, reducing the number of UE (user equipment) which are allowed to be processed by the MAC scheduler in each TTI, resetting the number of data of the high-priority queue which is allowed to be processed by the MAC scheduler in each TTI to be N and the number of data of the low-priority queue to be M, and converting the operation state of the MAC scheduler into s 0;
the storing the received data into the corresponding queue according to the logic channel where the received data is located includes:
if the real-time requirement of the received data is high, the received data is stored in a high-priority queue, and if the real-time requirement of the received data is low, the received data is stored in a low-priority queue.
5. The terminal of claim 4, wherein the step S1 specifically includes:
the queues comprise a retransmission high-priority queue, a retransmission low-priority queue, a new transmission high-priority queue and a new transmission low-priority queue;
when receiving a data, judging whether the data is retransmitted or newly transmitted, and storing the data into a corresponding high-priority queue or a corresponding low-priority queue according to a logic channel where the data is located.
6. The terminal of claim 4, wherein the step S2 specifically includes:
ind, when the MAC scheduler receives an instruction from the PHY layer, starts timing as the start of the current TTI of the MAC scheduler, and ends timing when the MAC scheduler completes data processing, and the time t obtained by timing is used as the actual time t for the MAC scheduler to process data in each TTI.
CN202011370191.2A 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data reasonably Active CN112469134B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011370191.2A CN112469134B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data reasonably

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711381230.7A CN108024384B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data
CN202011370191.2A CN112469134B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data reasonably

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201711381230.7A Division CN108024384B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data

Publications (2)

Publication Number Publication Date
CN112469134A CN112469134A (en) 2021-03-09
CN112469134B true CN112469134B (en) 2022-05-03

Family

ID=62074465

Family Applications (3)

Application Number Title Priority Date Filing Date
CN202011370568.4A Active CN112469135B (en) 2017-12-20 2017-12-20 MAC layer data scheduling method and terminal for ensuring system stability
CN201711381230.7A Active CN108024384B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data
CN202011370191.2A Active CN112469134B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data reasonably

Family Applications Before (2)

Application Number Title Priority Date Filing Date
CN202011370568.4A Active CN112469135B (en) 2017-12-20 2017-12-20 MAC layer data scheduling method and terminal for ensuring system stability
CN201711381230.7A Active CN108024384B (en) 2017-12-20 2017-12-20 Method and terminal for scheduling MAC layer data

Country Status (1)

Country Link
CN (3) CN112469135B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114567566A (en) * 2022-02-16 2022-05-31 上海联虹技术有限公司 Message processing method, device, terminal equipment and storage medium

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100689543B1 (en) * 2003-08-26 2007-03-02 삼성전자주식회사 Method and apparatus for requesting scheduling of uplink packet transmission in a mobile telecommunication system
CN101098295B (en) * 2006-06-27 2010-10-20 大唐移动通信设备有限公司 High speed downlink packet accessing medium access controlled multi-queue transmission method and device
ES2530021T3 (en) * 2007-03-07 2015-02-25 Interdigital Technology Corporation Method and apparatus for generating and processing a MAC-ehs protocol data unit
CN101291279A (en) * 2007-04-18 2008-10-22 华为技术有限公司 Service data scheduling method and device in high-speed downlink packet access
CN101350804B (en) * 2007-07-20 2011-07-06 鼎桥通信技术有限公司 Method and apparatus for scheduling high speed down packet access service
CN102014052B (en) * 2010-11-05 2013-12-11 中国科学院声学研究所 Virtual dynamic priority packet dispatching method
US9237581B2 (en) * 2013-03-14 2016-01-12 Cavium, Inc. Apparatus and method for media access control scheduling with a sort hardware coprocessor

Also Published As

Publication number Publication date
CN108024384B (en) 2020-12-22
CN112469134A (en) 2021-03-09
CN112469135A (en) 2021-03-09
CN108024384A (en) 2018-05-11
CN112469135B (en) 2022-11-11

Similar Documents

Publication Publication Date Title
JP4397928B2 (en) A method for allocating resources of a wireless communication network to traffic to be transmitted to user equipment over a network channel
EP1892899B1 (en) Data flow amount control device and method
US7283814B2 (en) Method and apparatus for scheduling transmissions in wireless data networks
US8223708B2 (en) Method and apparatus for handling scheduling information report
KR101243875B1 (en) Method and device for triggering and reporting scheduling request in wireless networks
EP2234316B1 (en) Method and apparatus for power headroom reporting
US7733832B2 (en) Method and apparatus for transmitting/receiving control information of user equipment for uplink data transmission
EP1903726B1 (en) Data flow amount control device and data flow amount control method
EP2094049B1 (en) Method and apparatus for sending RLC PDU in a mobile communications system
CN100550691C (en) The method of dispatching group data transmission
US8514831B2 (en) Method for requesting resource based on timer in mobile telecommunication systems
US20030063563A1 (en) Class of computationally parsimonious schedulers for enforcing quality of service over packet based AV-centric home networks
EP2293637B1 (en) Method and apparatus for performing buffer status reporting
US8843151B2 (en) Systems and methods for providing data communications with burst transmissions
USRE46960E1 (en) Method of operating a communication device and a system, a communication device and a system including the communication device
CN101494908B (en) Method for scheduling customer equipment data and packet scheduling device
CN111200563B (en) Congestion control method and device
EP1653683A2 (en) Dynamic setting of transmission scheduler algorithms
Afrin et al. A delay sensitive LTE uplink packet scheduler for M2M traffic
CN112469134B (en) Method and terminal for scheduling MAC layer data reasonably
Azhari et al. Delay sensitive resource allocation over high speed IEEE802. 11 wireless LANs
CN111510953B (en) Data processing method, terminal and storage medium
Afrin et al. A packet age based LTE uplink packet scheduler for M2M traffic
CN113271678B (en) Frame structure adjusting method and device
KR102164275B1 (en) Single Metric Scheduling Method and Apparatus of Wireless Communication System

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
GR01 Patent grant
GR01 Patent grant