WO2017107497A1

WO2017107497A1 - Scheduling method and network side device

Info

Publication number: WO2017107497A1
Application number: PCT/CN2016/093613
Authority: WO
Inventors: 张普
Original assignee: 中兴通讯股份有限公司
Priority date: 2015-12-22
Filing date: 2016-08-05
Publication date: 2017-06-29
Also published as: CN106912116A

Abstract

A scheduling method, applied to a network side device, the method comprising: receiving random access requests from at least one user equipment (UE); grouping the random access requests into non-contention-based random access requests and contention-based random access requests, wherein the priorities of the non-contention-based random access requests are higher than those of the contention-based random access requests; and scheduling the non-contention-based random access requests and the contention-based random access requests according to the priorities.

Description

Scheduling method and network side device

Technical field

This document relates to, but is not limited to, the field of wireless communications, and relates to a scheduling method and a network side device.

Background technique

In the field of mobile communications, the base station needs to maintain the scheduling of the accessed UEs in addition to the User Equipment (UE). As the network scale continues to expand, there will be more and more users requesting access to the network. Considering the load and performance limitations of the base station itself, a large number of UEs will access the Long Term Evolution (LTE) system. Caused a big impact, seriously affecting access performance and system stability.

Currently, for the access control of the LTE system, the general adoption strategy is: when the received random access request cannot be processed by the base station, the corresponding random access response with the fallback index indicates that the UE performs the access rollback. However, when the access resources of the LTE system are limited and the system load is high, that is, when the number of requests received by the base station is greater than the capability of the radio resources to be allocated, the base station cannot send the back-off index to the UE in time, resulting in an increased probability of UE handover failure. The situation that the accessed UE is dropped or the like occurs.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

The embodiment of the invention provides a scheduling method and a network side device, so that the network side device can respond to the random access request in time, which can reduce the probability of UE handover failure, avoid the dropped call of the accessed UE, and improve the access performance of the system.

An embodiment of the present invention provides a scheduling method, which is applied to a network side device, where the method includes: receiving a random access request from at least one user equipment UE;

And dividing the random access request into a non-competitive random access request and a competitive random access request, where the priority of the non-competitive random access request is higher than the priority of the competitive random access request Level

And scheduling the non-competitive random access request and the competitive random access request according to the priority.

Optionally, the performing the non-competitive random access request and the competitive random access request according to the priority, including:

The non-competitive random access request is preferentially scheduled according to the priority, and the competitive random access request is scheduled after the non-competitive random access request is scheduled.

Optionally, the scheduling the competitive random access request includes:

The competitive random access request is scheduled by using a token bucket mechanism.

Optionally, the token bucket mechanism is used to schedule the competitive random access request, including:

When the token bucket is empty, the UE sends a back-off index to the UE corresponding to the unscheduled contention request, where the back-off index is used to indicate that the corresponding UE performs the rollback operation.

Optionally, the method further includes:

Generate a new token according to the preset token generation rate; or,

The new token is generated according to the network configuration and the current system load.

Optionally, the generating the new token according to the network configuration and the current system load, including:

Acquiring a system configuration factor and a cell load factor, where the system configuration factor is used to represent physical hardware performance of the network side device, where the cell load factor is used to represent a current running performance of a cell of the network side device;

Calculating and obtaining a real-time token generation rate according to the system configuration factor and the cell load factor;

The new token is generated according to the real-time token generation rate.

An embodiment of the present invention further provides a network side device, including a receiving unit, a dividing unit, and a scheduling unit, where

The receiving unit is configured to receive a random access request from at least one user equipment UE;

The dividing unit is configured to divide the random access request into non-competitive random access And obtaining a competitive random access request, wherein the non-competitive random access request has a higher priority than the competitive random access request;

The scheduling unit is configured to schedule the non-competitive random access request and the competitive random access request according to the priority.

Optionally, the scheduling unit is configured to preferentially schedule the non-competitive random access request according to the priority, and after the non-competitive random access request completes scheduling, A competitive random access request is scheduled.

Optionally, the scheduling unit performs scheduling on the competitive random access request by using a token bucket mechanism to schedule the competitive random access request.

Optionally, the scheduling unit implements, by using a token bucket mechanism, scheduling the competitive random access request: when the token bucket is empty, requesting an unscheduled competitive random access The corresponding UE sends a back-off index, where the back-off index is used to indicate that the corresponding UE performs a rollback operation.

Optionally, the network side device further includes: a scheduling maintenance unit configured to generate a new token according to a preset token generation rate; or generate the new token according to the network configuration and the current system load.

Optionally, the scheduling maintenance unit generates the new token according to a network configuration and a current system load by acquiring a system configuration factor and a cell load factor, where the system configuration factor is used to represent the network. The physical hardware performance of the side device, the cell load factor is used to represent the current running performance of the cell of the network side device; and the real-time token generation rate is calculated according to the system configuration factor and the cell load factor; The real-time token generation rate is generated, and the new token is generated.

The embodiment of the invention further provides a computer readable storage medium, wherein the computer readable storage medium stores computer executable instructions, and the computer executable instructions are implemented to implement a scheduling method.

The scheduling method and the network side device provided by the embodiment of the present invention, the network side device divides the received random access request of the UE into a non-competitive random access request and a competitive random access request, where non-competitive random access The priority of the access request is higher than the priority of the competitive random access request. Then, the non-competitive random access request and the competitive random access request are scheduled according to the priority. In the embodiment of the present invention, since the priority of the non-competitive random access request is higher than the priority of the competitive random access request, the non-competitive random access request is preferentially scheduled in the scheduling process, and then The competitive random access request is then scheduled. In this way, the network side device can respond to the non-competitive random access request in time, so that the UE that has been registered in the network side device can access in time, reduce the UE handover failure probability, avoid the dropped UE from dropping the call, and improve the system. Access performance. Other aspects will be apparent upon reading and understanding the drawings and detailed description.

DRAWINGS

FIG. 1 is a schematic flowchart of a scheduling method according to Embodiment 1 of the present invention;

2 is a schematic structural diagram of a network device according to Embodiment 2 of the present invention;

FIG. 3 is a schematic structural diagram of another network device according to Embodiment 2 of the present invention.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in the following with reference to the accompanying drawings.

The embodiment of the present invention provides a scheduling method, which is applied to a network side device, such as an eNodeB (Evolved Node B) in an LTE system, and a wireless network in a Universal Mobile Telecommunications System (UMTS). The controller (RNC, Radio Network Controller) and the like access the network side devices, and the access network side devices perform control plane interaction with the UE and the core network.

FIG. 1 is a schematic flowchart of a scheduling method according to an embodiment of the present invention. Referring to FIG. 1, the method includes:

S101: Receive a random access request from at least one UE.

Specifically, in the wireless communication system, when the UE needs to request access to the network, the UE sends a random access request to the network side device, and the network side device receives the random access request from the at least one UE.

Illustratively, there are five different situations in the LTE system that can trigger a random access procedure, including: random access initiated in idle mode, RRC (Radio Resource Control) connection reestablishment, handover (RRC connection status) Downlink from the serving cell to the target cell), downlink data arrival in the RRC connected state (no uplink synchronization but downlink data reception) and uplink data arrival in the RRC connected state (uplink synchronization is not obtained but uplink data and control are required) The information is not required to be uplinked but needs to be applied for uplink resources through random access. The non-competitive random access refers to the case where the downlink data arrives in the handover and RRC connection state; the competitive random access refers to The random access initiated in the idle mode, the RRC connection reestablishment, and the uplink data in the RRC connected state arrive in three cases.

Here, the random access request sent in the random access procedure carries a preamble (Preamble). The network side device can divide the random access request into a non-competitive random access request belonging to non-competitive random access or a competitive random access request belonging to competitive random access according to the preamble.

S102: Divide the random access request into a non-competitive random access request and a competitive random access request.

Here, since the non-competitive random access request is in the case of the downlink data arrival in the handover and the RRC connection state, it can be seen that the UE that issues the non-competitive random access request has already existed on the network side device. The RRC is connected, so the priority of the non-competitive random access request is higher than the priority of the competitive random access request.

Specifically, the network side device may determine, according to the preamble type in the random access request, whether the random access request is a non-competitive random access request or a competitive random access request. If the preamble is selected by the UE's Media Access Control (MAC, Media Access Control), it is a competitive random access request; if the preamble is allocated by control signaling, it is a non-competitive random access request.

Then, the network side device divides all random access requests received within one Transmission Time Interval (TTI) into non-competitive random access requests and competitive random access requests according to its preamble type.

S103: Scheduling the non-competitive random access request and the competitive random access request according to the priority.

Specifically, the network side device first schedules the non-competitive random access request according to the priority order, and dispatches it to the next level processor to respond. If the UE is allowed to access, the random access response message is sent to the UE. If the UE is not allowed to access, the UE sends a fallback index to the UE to instruct the user to perform the rollback operation.

In this way, the scheduling of non-competitive random access requests is completed. Since the number of non-competitive random access requests is limited, the network side device can timely process these requests in time when the system resources are limited, reduce the handover failure rate, and avoid the dropped calls of the accessed UEs. The situation has happened.

Optionally, in a specific implementation process, the S103 may include: preferentially scheduling the non-competitive random access request according to the priority, and performing the competitive random access request after the non-competitive random access request is completed. Schedule.

Specifically, after the network side device preferentially schedules the non-competitive random access request, scheduling the competitive random access request.

Illustratively, a competitive random access request can be scheduled using a token bucket mechanism.

Further, in the process of the network side device scheduling the competitive random access request by using the token bucket mechanism, each time a competitive random access request is scheduled, the number of tokens in the token bucket is decremented by one until the token is exhausted. That is, when the token bucket is empty, the scheduling of the competitive random access request is stopped, and the UE corresponding to the unscheduled contention random access request is sent a back-off index, indicating that the corresponding UE performs the rollback operation until the token bucket Available, and then continue to schedule other competing random access requests. The token bucket mechanism is used to schedule the random access request, so that when the network system has limited access resources and the system load is high, the network side device speeds up the processing of the random access request and reduces the number of random access requests. The impact caused by the network side device, at the same time, can effectively utilize system resources, and reduce the probability of handover failure and dropped calls of the accessed UE.

In practical applications, in order to maintain the stable and continuous scheduling of the competitive random access request, the impact of the random access request on the system is better mitigated, and the network access device is scheduled while the competitive random access request is scheduled. A new token is continuously generated according to a preset policy. For example, the network side device may generate a new token according to a preset token generation rate; or generate a new token according to the network configuration and the current system load. To maintain the token in the token bucket.

Specifically, the token bucket contains two parameters, one is the maximum capacity m of the token bucket, and the other is the token generation rate K, where m is a natural number greater than or equal to 0, and k is a natural number greater than 0. The maximum capacity m of the token bucket limits the maximum number of competing random access requests that the network side device can schedule at the same time. In practical applications, in order to ensure the completion of the scheduling, m is determined according to the performance of the system and the business requirements; the generation rate K of the token affects the degree of completion of the scheduling, and a suitable generation rate K can ensure that the scheduling is better completed. It can also ensure the stability of the operation of the network side equipment.

Further, the generation rate K of the token is and is not limited to the following two cases.

The first type, K is a preset value, that is, the network side device generates a new token at a preset token generation rate;

Second, K is a value determined in real time according to network settings and current system load, that is, the network side device generates a new token according to the network configuration and the current system load.

Specifically, first, the network side device acquires a cell load factor (Cellfactor) and a system configuration factor (Configfactor), and then calculates a token generation rate K in real time according to the following formula (1);

K=Cellfactor×Configfactor formula (1)

The cell factor (Cellfactor) is used to characterize the current running performance of the cell, and the system configuration factor (Configfactor) is used to characterize the physical hardware performance of the network side device. Here, the unit of K is: every millisecond (pieces/ms).

In the actual application, the Configfactor may be determined according to parameters such as the maximum number of cells supported by the board, the maximum number of activated UEs, and the maximum number of antennas. The corresponding parameters of the configured parameters and the Configfactor are pre-stored at the network side device. relationship. The above-mentioned cell load factor Cellfactor is mainly determined according to the number of UEs currently accommodated by the network side device, the maximum number of UEs that the network side device can accommodate at the same time, and the situation of multiple cells in the system, for example, according to the actually established cell. The number and the type of the cell, the number of activated UEs, the situation of accessing the UE in a period of time, and the service type of the current cell accessing the UE are determined. The same as the Configfactor, the configured parameters are pre-stored at the network side device. The corresponding relationship with the Cellfactor enables the network side device to find the corresponding Cellfactor according to the situation of activation and access to the UE during operation, and further Ensure that K is a dynamically adjusted value.

Finally, after calculating the token generation rate K, the network side device generates a new token according to K.

Certainly, the generation rate K of the token may be other conditions, which are not specifically limited in the embodiment of the present invention.

So far, the scheduling for the competitive random access request is completed. The token bucket mechanism is used to schedule the competitive random access request, so that when the network system has limited access resources and the system load is high, the network side device speeds up the processing of the random access request and reduces the random access network. The impact caused by the side equipment.

Embodiment 2

Based on the same inventive concept, the embodiment of the present invention provides a network side device, which is consistent with the network side device described in one or more of the foregoing embodiments.

2 is a schematic structural diagram of a network side device according to an embodiment of the present invention. Referring to FIG. 2, the network side device 20 includes: a receiving unit 201, a dividing unit 202, and a scheduling unit 203. The receiving unit 201 is configured to Receiving a random access request from at least one UE; the dividing unit 202 is configured to divide the random access request into a non-competitive random access request and a competitive random access request, where the non-competitive random access request is prioritized The level is higher than the competitive random access request; the scheduling unit 203 is configured to schedule the non-competitive random access request and the competitive random access request according to the priority.

Optionally, the scheduling unit 203 is configured to preferentially schedule the non-competitive random access request according to the priority, and schedule the competitive random access request after the non-competitive random access request completes the scheduling. .

Optionally, the scheduling unit 203 implements scheduling of the competitive random access request by using a token bucket mechanism to schedule a competitive random access request.

Optionally, the scheduling unit 203, by using a token bucket mechanism, scheduling the competitive random access request by: when the token bucket is empty, corresponding to the unscheduled competitive random access request The UE sends a back-off index, where the back-off index is used to indicate the corresponding UE Perform a rollback operation.

Optionally, FIG. 3 is another schematic structural diagram of a network side device according to an embodiment of the present invention. Referring to FIG. 3, the network side device 20 further includes: a scheduling maintenance unit 301. To generate a new token according to the preset token generation rate, or obtain a system configuration factor and a cell load factor according to the network configuration and the current system load, calculate a real-time token generation rate, and generate the new token.

Optionally, the scheduling maintenance unit 301 is configured to generate the new token according to the network configuration and the current system load by acquiring a system configuration factor and a cell load factor, where the system configuration factor is used to represent the physicality of the network side device. The hardware performance, the cell load factor is used to represent the current running performance of the cell of the network side device; the real-time token generation rate is calculated according to the system configuration factor and the cell load factor; and the new token is generated according to the real-time token generation rate.

It should be noted that the description of the above network side device embodiment item is similar to the above method description, and has the same beneficial effects as the method embodiment, and therefore will not be described again. For the technical details that are not disclosed in the embodiment of the network side device of the present application, those skilled in the art should understand that the description of the method embodiment of the present application is omitted.

Those skilled in the art will appreciate that embodiments of the present application can be provided as a method, system, or computer program product. Accordingly, the application can take the form of a hardware embodiment, a software embodiment, or an embodiment in combination with software and hardware. Moreover, the application can take the form of a computer program product embodied on one or more computer readable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code. Alternatively, all or part of the steps of the above embodiments may also be implemented using one or more integrated circuits. Correspondingly, each module/unit in the above embodiment may be implemented in the form of hardware, for example, by implementing an integrated circuit to implement its corresponding function, or may be implemented in the form of a software function module, for example, executing a program stored in the memory by a processor. / instruction to achieve its corresponding function.

The present application refers to a method, device (system), and computer program according to an embodiment of the present invention. The flow chart and/or block diagram of the product is described. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

The above is only an optional embodiment of the present application, and is not intended to limit the scope of the present application. A person skilled in the art should understand that the technical solutions of the present application can be modified or equivalent, without departing from the spirit and scope of the technical solutions of the present application, and should be included in the scope of the claims of the present application.

Industrial applicability

The foregoing technical solution can reduce the UE handover failure probability, avoid the dropped call of the accessed UE, and improve the access performance of the system.

Claims

A scheduling method is applied to a network side device, where the method includes:

Receiving a random access request from at least one user equipment UE;

And dividing the random access request into a non-competitive random access request and a competitive random access request, where the priority of the non-competitive random access request is higher than the priority of the competitive random access request level;

And scheduling the non-competitive random access request and the competitive random access request according to the priority.
The method according to claim 1, wherein: said said non-competitive random access request and said competitive random access request according to said priority, comprising:

The non-competitive random access request is preferentially scheduled according to the priority, and the competitive random access request is scheduled after the non-competitive random access request is scheduled.
The method according to claim 1 or 2, wherein the scheduling the competitive random access request comprises:

The competitive random access request is scheduled by using a token bucket mechanism.
The method according to claim 3, wherein: the token bucket mechanism is used to schedule the competitive random access request, including:

When the token bucket is empty, the UE sends a back-off index to the UE corresponding to the unscheduled contention request, where the back-off index is used to indicate that the corresponding UE performs the rollback operation.
The method of claim 4, further comprising:

Generate a new token according to the preset token generation rate; or,

The new token is generated according to the network configuration and the current system load.
The method of claim 5, wherein: the generating the new token according to a network configuration and a current system load comprises:

Obtaining a system configuration factor and a cell load factor, wherein the system configuration factor is used to characterize physical hardware performance of the network side device, and the cell load factor is used to represent the network side The current running performance of the cell of the device;

Calculating and obtaining a real-time token generation rate according to the system configuration factor and the cell load factor;

The new token is generated according to the real-time token generation rate.
A network side device, including a receiving unit, a dividing unit, and a scheduling unit; wherein

The receiving unit is configured to receive a random access request from at least one user equipment UE;

The dividing unit is configured to divide the random access request into a non-competitive random access request and a competitive random access request, where the non-competitive random access request has a higher priority than the contention Priority of sexual random access request;

The scheduling unit is configured to schedule the non-competitive random access request and the competitive random access request according to the priority.
The network side device according to claim 7, wherein: the scheduling unit is configured to preferentially schedule the non-competitive random access request according to the priority, and perform the non-competitive random access After the incoming request completes the scheduling, the competitive random access request is scheduled.
The network side device according to claim 7 or 8, wherein the scheduling unit performs scheduling on the competitive random access request by using a token bucket mechanism to request the competitive random access Schedule.
The network side device according to claim 9, wherein the scheduling unit implements scheduling of the competitive random access request by using a token bucket mechanism by: when the token bucket is empty, The UE corresponding to the unscheduled contention random access request sends a back-off index, where the back-off index is used to indicate that the corresponding UE performs a rollback operation.
The network side device according to claim 10, the network side device further comprising: a scheduling maintenance unit configured to generate a new token according to a preset token generation rate; or generate according to a network configuration and a current system load The new token.
The network side device according to claim 11, wherein the scheduling maintenance unit generates the new token according to a network configuration and a current system load by acquiring a system configuration factor and a cell load factor, where System configuration factor is used to characterize the network side The physical hardware performance, the cell load factor is used to represent the current running performance of the cell of the network side device; and the real-time token generation rate is calculated according to the system configuration factor and the cell load factor; The real-time token generation rate, the new token is generated.