WO2011116579A1

WO2011116579A1 - Scheduling method and device for multi-user multi-service in wireless communication network

Info

Publication number: WO2011116579A1
Application number: PCT/CN2010/076084
Authority: WO
Inventors: 任泰云
Original assignee: 中兴通讯股份有限公司
Priority date: 2010-03-23
Filing date: 2010-08-17
Publication date: 2011-09-29
Also published as: CN102202410A

Abstract

The present invention discloses a scheduling method and device for multi-user multi-service in a wireless communication network, said method includes: sequencing multiple users to be processed and generating a user scheduling queue; processing in turn a predetermined number of data packets of service of each user in the user scheduling queue, wherein the predetermined number is preset according to the user priority. In the present invention, scheduling processing for multi-user multi-service in a wireless communication network is performed by using a user scheduling queue, and only a predetermined number of data packets of one user are processed each time, so fairness and real time performance of service scheduling between users are fully guaranteed.

Description

TECHNICAL FIELD The present invention relates to the field of wireless communication technologies, and in particular, to a multi-user and multi-service scheduling method and apparatus for a wireless communication network. BACKGROUND OF THE INVENTION Scheduling technology is widely used in the field of telecommunication wireless transmission. The scheduling scheme based on wireless transmission mainly includes: (1) a packet-driven scheduling scheme, which schedules scheduling according to the priority of received data, first-coming data. Process first, and then post-process the data. (2) A priority-based scheduling scheme, the scheduling scheme is processed according to the priority of the packet, and each time the scheduling is required, the data processing is first obtained from the high-priority data queue, and only after the high-priority data processing is completed Can handle the priority data. However, when scheduling, the scheme (1) is processed according to the arrival order of the packets, and the fairness of the multi-user service scheduling cannot be controlled. When a user's data is particularly large, the user may be processed for a long time. The data makes other users' data unprocessable, which causes other users' data processing to time out. The scheme (2) is processed according to the priority of the packet. If the high-priority packet arrives continuously, the packet of the priority packet cannot be processed in time, and thus the fairness of the multi-user service scheduling cannot be guaranteed. In order to solve the service scheduling fairness of the foregoing schemes (1) and (2), a mainstream scheduling method based on the radio bearer scheduling scheme is currently used. The scheduling method performs scheduling processing according to the service established by the user, processes one packet each time on each service, and then processes data of the next service. Does not distinguish between users. This scheduling mode is scheduled according to the priority of the service, and each service processes one packet at a time. For example, user A has 10 services processing data at the same time, each service has 10 pending data packets, user B has 1 service processing data, and this service also has 10 pending data packets, and user A and user B each. The number of times that a packet can be processed is one, which causes User B to wait until User A processes 10 packets before processing User B's 1 packet. Therefore, although the scheduling method implements fair scheduling of services, it cannot guarantee fair scheduling at the user level. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a method and apparatus for scheduling multi-user and multi-service in a wireless communication network, so as to solve the problem of fairness and real-time in the current scheduling technology for multi-user and multi-service scheduling. According to an aspect of the present invention, a method for scheduling a multi-user multi-service of a wireless communication network is provided, comprising the steps of: sorting a plurality of users to be processed, generating a user scheduling queue; and sequentially processing each of the user scheduling queues A predetermined number of data packets of the user's service, wherein the predetermined number is preset according to the priority of the user. Further, the multi-user multi-service scheduling method of the wireless communication network further includes: determining, during the processing, whether the currently processed user's service is empty; if yes, deleting the user from the user scheduling queue; if not, Link the user to the end of the queue of the user's dispatch queue. Further, the step of sequentially processing a predetermined number of data packets of each user in the user scheduling queue includes: sorting a plurality of services of each user to generate a service queue, where each service includes at least one data packet Processing one packet of each service of the service queue in turn until the number of processed packets reaches a predetermined number; the processed packets are deleted from the service to which they belong. Further, the step of sequentially processing the predetermined number of data packets of the service of each user in the user scheduling queue further includes: determining, in the processing process of each service, whether the currently processed service has a remaining data packet; if yes, Then the service is linked to the tail of the service queue; if not, the service is deleted from the service queue. Further, the step of sorting the plurality of users to be processed includes: sorting the plurality of users to be processed in chronological order. According to another aspect of the present invention, a multi-user multi-service scheduling apparatus for a wireless communication network is provided, including: a queue generation module, configured to sort a plurality of users to be processed, and generate a user scheduling queue; a service processing module, A predetermined number of data packets for sequentially processing the services of each user in the user scheduling queue, wherein the predetermined number is preset according to the priority of the user. Further, the multi-user multi-service scheduling apparatus of the wireless communication network further includes: a service judging module, configured to determine, in the process of processing, whether the currently processed user's service is empty; the user deletion module is configured to be used by the service judging module If the judgment result is yes, the user is dispatched from the user scheduling queue. The user link module is configured to link the user to the tail of the user scheduling queue if the judgment result of the service judgment module is no. Further, the service processing module includes: a service queue generating module, configured to sort multiple services of each user, and generate a service queue, where each service includes at least one data packet; a data packet processing module, configured to sequentially process A packet of each service of the service queue until the number of processed packets reaches a predetermined number; a packet deletion module is configured to delete the processed packet from the service to which it belongs. Further, the service processing module further includes: a data packet determining module, configured to determine, in a processing process of each service, whether the currently processed service has a remaining data packet; and a service linking module, configured to determine a result of the data packet determining module If yes, the service is linked to the end of the service queue; the service deletion module is configured to delete the service from the service queue if the judgment result of the data packet determination module is no. Further, the queue generation module includes: a time queue generation module, configured to sequentially sort the plurality of users to be processed in chronological order. The invention performs scheduling processing on the multi-user multi-service of the wireless communication network by using the user scheduling queue, and processes only a predetermined number of data packets for one user at a time, which fully ensures the fairness and real-time performance of the service scheduling between users. At the same time, according to the priority of the user, the number of data packets of the service that the user can handle each time is set, and the higher the priority, the more the number of data packets that can be processed each time, thereby being a high priority user. Provide better and more timely scheduling services. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a structural diagram of a user and service of a wireless communication network according to the present invention; FIG. 2 is a flow chart showing steps of a multi-user and multi-service scheduling method for a wireless communication network according to an embodiment of the present invention; 3 is a flow chart showing the steps of a multi-user multi-service scheduling method for another wireless communication network according to an embodiment of the present invention; 4 is a flow chart of steps of a multi-user multi-service scheduling method for a wireless communication network according to an embodiment of the present invention; FIG. 5 is a schematic diagram of a multi-user multi-service scheduling apparatus for a wireless communication network according to an embodiment of the present invention; FIG. 6 is a structural block diagram of a multi-user multi-service scheduling apparatus of another wireless communication network according to an embodiment of the present invention; FIG. 7 is a schematic structural diagram of a user and a service node of a wireless communication network according to the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. In the field of telecommunication wireless transmission, with the increasing number of end users, the scheduling of multi-user and multi-service has become an important indicator for measuring the performance of control stations such as base stations. The prior art more considers the scheduling fairness between multiple services, but when one user's business is far more than the other less business users, it is impossible to balance the fairness of scheduling between users. The present invention is directed to this problem, and a user only processes a certain amount of services at a time, thereby ensuring fairness of scheduling between users. Referring to Fig. 1, an organization structure diagram of users and services of a wireless communication network of the present invention is shown. When there are multiple users, such as user-1 to user-n, which need to control the service of the service, the control station sorts user-1 to user-n, for example, the control station sorts the user according to the order in which they are accessed. Thereby generating a user scheduling queue. Each user corresponds to a service queue, and the service queue includes services to be processed by the user, such as service-1 to service-N. Each service corresponds to one radio bearer, and includes at least one data packet to be processed (not shown in the figure). Referring to FIG. 2, a flow chart of steps of a multi-user multi-service scheduling method for a wireless communication network according to an embodiment of the present invention is shown. Specifically, the method may include: Step 202: Sorting multiple users to be processed, and generating a user scheduling queue . In this step, a person skilled in the art may sort the multiple users to be processed according to actual needs, such as in chronological order, or in order of priority, etc., and the present invention does not need to be limited. Step 204: Process a predetermined number of data packets of each user's service in the user scheduling queue in sequence. The predetermined number is preset according to the priority of the user. That is, the predetermined number of services are processed according to the priority of the user-1, then the user-2, the user-3, and the user-n. The present embodiment effectively solves the problem that the prior art only considers the scheduling fairness of the service when scheduling the multi-user multi-service, and does not consider the scheduling fairness of the user, and the present embodiment treats one user at a time. Only a predetermined number of data packets are processed, which fully guarantees the fairness and real-time performance of service scheduling between users. At the same time, according to the priority of the user, the number of data packets of the service that the user can process each time is set, and the higher the priority, the more the number of data packets that the user can process each time, thereby providing more high-priority users. Better and more timely scheduling services. Referring to FIG. 3, a step-by-step flowchart of a multi-user multi-service scheduling method for another wireless communication network according to an embodiment of the present invention is shown. In this embodiment, a user plane scheduling scheme in a Long Term Evolution (LTE) system is taken as an example. Two UEs are to be processed, UE-1 and UE-2, and UE-1 has two pending services. RB-1 and RB-2, UE-2 has a pending service RB-3. Among them, RB-1 has three data to be processed DATA-1 and DATA-2 and DATA-3, RB-2 has two data to be processed DATA-4 and DATA-5, and RB-3 has one data to be processed DATA-6. . The priority level of ^_"& UE-1 is higher than that of UE-2, and the number of data packets that can be processed by UE-1 is two, and the number of data packets that UE-2 can process at one time is one. scheduling multiuser present embodiment is a multi-service specifically includes the following steps: step 302: the UE-1 and UE-2 are sorted to generate a user scheduling queue Example ^ ^{1 UE-1} to UE-2 in time to the present embodiment. In the sequence of 4, the UE-1 is the head node of the queue for the user before the UE-2. Step 304: Acquire the head node user UE-1 of the user scheduling queue. Step 306: Obtain the number of pending services of UE-1 2, the number of packets to be processed is

5, the predetermined number of packets that can be processed each time is 2. Step 308: Acquire the service RB-1 of the UE-1, take out the DATA-1 for processing, and delete the processed DATA-1 from the service of the UE-1. In this step, RB-1 is processed first, but those skilled in the art should understand that when processing the service, it is also possible to process DATA-2 or DATA-3 first, or first process the service of RB-2. . Step 310: It is determined that the number of data packets processed in this time does not reach the predetermined number of UE-1, and the service of UE-1 is not empty, and the service RB-2 of UE-1 is obtained, and DATA-4 is taken out for processing, and the processing is performed. The DATA-4 was removed from the UE-1 service. In this step, you can also choose to continue processing DATA-2 of RB-1. Step 312: It is determined that the number of data packets processed this time has reached the predetermined number of UE-1, and the service of UE-1 is not empty, and UE-1 is linked to the tail of the user scheduling queue. After the UE-1 is linked to the UE-2, the service of the UE-1 is processed next time after the current scheduling process. On the one hand, the timeliness of the UE-2 service scheduling process is guaranteed, and on the other hand, the guaranteed UE- 1 The integrity of the business scheduling process. Step 314: Acquire a head node user UE-2 of the user scheduling queue. Step 316: The number of the to-be-processed services of the UE-2 is 1 and the number of the data packets to be processed is 1, and the predetermined number of data packets that can be processed is 1. Step 318: Obtain the service RB-3 of the UE-2, take out the DATA-6 for processing, and delete the processed DATA-6 from the service of the UE-2. Step 320: It is determined that the number of data packets processed this time has reached the predetermined number of UE-2, and the service of UE-2 is empty, and UE-2 is deleted from the user scheduling queue. Step 322: Acquire a head node user UE-1 of the user scheduling queue. Step 324: Acquire the service RB-1 of the UE-1, take out the DATA-2 for processing, and delete the processed DATA-2 from the service of the UE-1. Step 326: It is determined that the number of data packets processed this time does not reach the predetermined number of UE-1, and the service of UE-1 is not empty, the service RB-2 of UE-1 is obtained, and DATA-5 is taken out for processing, and the processing is performed. The DATA-5 is removed from the UE-1 service. Step 328: It is determined that the number of data packets processed this time has reached the predetermined number of UE-1, and the service of UE-1 is not empty, and UE-1 is linked to the tail of the user scheduling queue. At this time, only the user UE-1 is in the user scheduling queue. Step 330: Acquire a head node user UE-1 of the user scheduling queue. Step 332: Acquire the service RB-1 of the UE-1, take out the DATA-3 for processing, and delete the processed DATA-3 from the service of the UE-1. Step 334: It is determined that the number of data packets processed this time does not reach the predetermined number of UE-1, and the service of UE-1 is empty, and UE-1 is deleted from the user scheduling queue. Step 4: 336: There is no user in the user scheduling queue, and the scheduling is completed. Referring to FIG. 4, a flow chart of a step-by-step manner of a multi-user multi-service scheduling method for another wireless communication network according to an embodiment of the present invention is shown. In this embodiment, the user plane scheduling scheme in the LTE system is taken as an example, and two UEs to be processed, UE-1 and UE-2, are supported. UE-1 has two services to be processed, RB-1 and RB-2, UE- 2 There is a pending business RB-3. Among them, RB-1 has one data to be processed DATA-1, RB-2 has two data to be processed DATA-2 and DATA-3, and RB-3 has one data to be processed DATA-4. The number of data packets that UE-1 and UE-2 can process at one time is one. The multi-user multi-service scheduling method in this embodiment may specifically include the following steps: Step 4: 402: Perform a sequence on the user to generate a user scheduling queue. In this step, UE-1 and UE-2 are sorted in chronological order, and UE-1 precedes UE-2, and the head node of the queue is scheduled for the user. The multiple users are sorted in chronological order. The first-time users are processed first, which fully considers the fairness of multi-user scheduling, ensures the fairness of multiple users waiting for the processing time, and avoids the waiting time ratio of the first-time users. Later, the user's situation improved the user experience. Step 404: Sort the services corresponding to the user, and generate a service queue corresponding to the user. In this step, the services of the user are sorted in chronological order, and the service RB-1 and RB-2 sequences of the UE-1 are used to generate the service queue of the UE-1, and the RB-1 precedes the RB-2 as an example. The -2 service RB-3 is sorted to generate a UE-2 service queue. The use of the service scheduling queue inside each user ensures the fairness of each service scheduling within the user. Step 406: Determine whether there is a user in the user scheduling queue. If yes, go to step 408; if not, Go to step 428. Step 408: Acquire a head node user of the user scheduling queue. Step 410: Acquire the number of pending services of the head node user, the number of data packets to be processed, and the predetermined number of data packets that can be processed each time. In this embodiment, the number of to-be-processed services of UE-1 is 2, the number of data packets to be processed is 3, and the predetermined number of data packets that can be processed each time is 1; the number of pending services of UE-2 is 1 The number of packets to be processed is 1, and the predetermined number of packets that can be processed each time is 1. Step 412: Acquire a head service node in a service queue of the head node user. Step 414: Take a data packet from the first service node for processing, and delete the processed data packet from the service to which it belongs. Step 416: Determine whether there are any remaining data packets in the current service node. If no, go to step 418; if yes, go to step 420. Step 418: The current service node is deleted from the service queue, and the process proceeds to step 422. The service node that has no service is deleted from the service queue in time, which can ensure the timely update of the service queue, and facilitate the control station to obtain real-time information of multiple users and multiple services. Step 420: Link the current service node to the tail of the service queue. Linking the service node with the service to the tail of the service queue ensures the integrity of the service scheduling while ensuring the fairness of the service scheduling in the service queue. Step 422: Determine whether the number of data packets processed this time reaches a predetermined number, and if yes, go to step 424; if no, go to step 4 to 412. Step 424: Determine whether the current user node has any remaining service nodes, and if yes, go to step 426; if no, delete the current user node from the user scheduling queue, and go to step 406. Step 426: Link the current user node to the tail of the user scheduling queue, and go to step 406. Step 428: The scheduling ends. In this embodiment, UE-1 and UE-2 are first sorted in chronological order, and UE-1 is a user. The head node of the dispatch queue. Then, the services of UE-1 and UE-2 are sorted to generate a service queue. Among them, in the service queue of UE-1, RB-1 precedes RB-2, which is the head node of the service queue, and only the service RB-3 in the service queue of UE-2. Obtaining the head node UE-1 of the user scheduling queue, the number of to-be-processed services for acquiring UE-1 is 2, the number of data packets to be processed is 3, and the predetermined number of data packets that can be processed each time is 1. The first service node RB-1 in the service queue of UE-1 is obtained, the first data packet DATA-1 is taken out from RB-1 for processing, and the processed DATA-1 is deleted from RB-1. It is judged that there is no pending data packet in RB-1, RB-1 is deleted from the service queue of UE-1, and RB-2 becomes the head service node of the service queue. At this time, there is only one service in the service queue of UE-1. Node RB-2. It is judged that the number of data packets processed this time has reached a predetermined number of 1, and it is judged that there are still remaining service node RB-2 in UE-1, and UE-1 is linked to the tail of the user scheduling queue, that is, after UE-2. When it is determined that there are still users UE-2 and UE-1, jt匕 in the user scheduling queue, UE-2 is the head node of the user scheduling queue. Obtaining the head node UE-2 of the user scheduling queue, the number of pending services of the UE-2 is 1, the number of data packets to be processed is 1, and the predetermined number of data packets that can be processed each time is 1. The first service node RB-3 in the service queue of the UE-2 is obtained, the first data packet DATA-4 is taken out from the RB-3 for processing, and the processed DATA-4 is deleted from the RB-3. It is judged that there is no remaining data packet in the RB-3, and the RB-3 is deleted from the service queue of the UE-2. At this time, there is no service node in the service queue of the UE-2. It is judged that the number of data packets processed this time has reached a predetermined number of 1, and it is judged that there is no remaining service node in the UE-2, and the UE-2 is deleted from the user scheduling queue. At this time, the user debug queue has only the user node UE-1. Obtaining the head node UE-1 of the user scheduling queue, the number of pending services of the UE-1 is 1 at this time, the number of data packets to be processed is 2, and the predetermined number of data packets that can be processed each time is 1. The first service node RB-2 in the service queue of the UE-1 is obtained, the first data packet DATA-2 is taken out from the RB-2 for processing, and the DATA-2 processed by the ^ ¹ is deleted from the RB-2. It is judged that there are remaining data packets to be processed in the RB-2. At this time, only the service node RB-2 is in the service queue of the UE-1, and the RB-2 is the head service node of the service queue. It is judged that the number of data packets processed this time has reached a predetermined number of 1, and it is judged that there are remaining service node RB-2 to be processed in UE-1. At this time, only the user node UE-1 is in the user scheduling queue. Obtaining the head node UE-1 of the user scheduling queue, the number of pending services of the UE-1 is 1 at this time, the number of data packets to be processed is 1, and the predetermined number of data packets that can be processed each time is 1. Obtain

The head service node RB-2 in the service queue of UE-1, takes the first data packet DATA-3 at this time from the RB-2 for processing, and deletes the processed DATA-3 from the RB-2. Judge RB-2 There are no remaining data packets to be processed, and RB-2 is deleted from the service queue of UE-1. It is judged that the number of data packets processed this time has reached a predetermined number of 1, and it is judged that there is no remaining service node remaining in UE-1, and UE-1 is deleted from the user scheduling queue. At this point, there is no user node in the user scheduling queue, and the scheduling ends. In this embodiment, the user layer performs fair scheduling according to the user, performs fair scheduling according to the service within the user, and implements an efficient and fair multi-user multi-service scheduling scheme. Referring to FIG. 5, a block diagram of a multi-user multi-service scheduling apparatus for a wireless communication network according to an embodiment of the present invention is shown, which specifically includes: a queue generation module 502, which is used to sort multiple users to be processed, and generate a user. The scheduling queue is connected to the queue generating module 502, and is configured to sequentially process a predetermined number of data packets of each user in the user scheduling queue. The predetermined number is preset according to the priority of the user. Through the embodiment, the fairness and real-time performance of the service scheduling between users are fully ensured. At the same time, according to the priority of the user, the number of data packets of the service that the user can process each time is set, and the higher the priority, the more the number of data packets that can be processed each time, thereby providing more high-priority users. Better and more timely scheduling services. Referring to FIG. 6, a block diagram of a multi-user multi-service scheduling apparatus of another wireless communication network according to an embodiment of the present invention is shown, which specifically includes: a queue generation module 602, which is used to sort and generate multiple users to be processed. The user scheduling queue; the service processing module 604 is connected to the queue generating module 502, and is configured to sequentially process a predetermined number of data packets of each user in the user scheduling queue. The predetermined number is preset according to the priority of the user. Preferably, the multi-user multi-service scheduling apparatus of the embodiment may further include: a service judging module 606, configured to be connected to the service processing module 604, configured to determine whether the currently processed user's service is empty during the processing; The deleting module 608 is connected to the service judging module 606, and is configured to: if the judgment result of the service judging module is yes, delete the user from the user scheduling queue; the user linking module 610 is connected to the service judging module 606, and is used for the service. If the judgment result of the judgment module is no, the user is linked to the tail of the user dispatch queue. The queue generation module 602 can include: a time queue generation module 6022, configured to treat Multiple users processed are sorted in chronological order. The service processing module 604 may include: a service queue generating module 6042, configured to sort a plurality of services of each user, and generate a service queue, where each service includes at least one data packet; a data packet processing module 6044, and a service queue The generating module 6042 is connected to sequentially process one data packet of each service of the service queue until the number of processed data packets reaches a predetermined number; the data packet deleting module 6046 is connected to the data packet processing module 6044 for processing The packet is removed from the business it belongs to. And the data packet determining module 6048 is connected to the data packet deleting module 6046, and is configured to determine, in the processing process of each service, whether the currently processed service has a remaining data packet; the service linking module 60410 is connected to the data packet determining module 6048. And if the judgment result of the data packet judging module is yes, the service is linked to the tail of the service queue; the service deletion module 60412 is connected to the data packet judging module 6048, and is used if the judgment result of the data packet judging module is No, the service is removed from the service queue. Referring to FIG. 7, a schematic structural diagram of a user and a service node of a wireless communication network according to the present invention is shown. In this structure, one user node includes the total number of data packets to be processed by the user, the number of data packets that the user can process each time, and the service queue of the user. The service queue includes thousands of service nodes, and each service node includes the number of data packets to be processed by the current service node, and information of the next to-be-processed service node. Through the total number of data packets to be processed by the user, the number of data packets that the user can process each time, and the number of data packets to be processed of the current service node of each service node in the service queue of the user and the information of the next pending service node, so that the control The station can easily obtain the users and business conditions to be processed, and it is convenient to implement fair scheduling for multi-user and multi-service efficiently and reasonably. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Where in the invention ^" God and Within the principles, any modifications, equivalent substitutions, improvements, etc., are intended to be included within the scope of the present invention.

Claims

A multi-user and multi-service scheduling method for a wireless communication network, characterized in that it comprises the following steps:

Sorting multiple users to be processed to generate a user scheduling queue;

A predetermined number of data packets of each user's service in the user scheduling queue are sequentially processed, wherein the predetermined number is preset according to the priority of the user. The method according to claim 1, wherein the method further comprises:

During processing, it is determined whether the currently processed user's service is empty;

If yes, the user is deleted from the user scheduling queue;

If not, the user is linked to the end of the user's dispatch queue. The method according to claim 2, wherein the step of sequentially processing a predetermined number of data packets of each user's service in the user scheduling queue comprises:

Sorting a plurality of services of each user to generate a service queue, where each service includes at least one data packet;

Processing one packet of each service of the service queue in turn until the number of processed data packets reaches the predetermined number;

The processed packet is deleted from the business to which it belongs. The method according to claim 3, wherein the step of sequentially processing a predetermined number of data packets of the service of each user in the user scheduling queue further comprises:

In the process of each service, determining whether the currently processed service has a remaining data packet; if yes, linking the service to the tail of the service queue;

If not, the service is deleted from the service queue. The method according to claim 1, wherein the step of sorting the plurality of users to be processed comprises:

Sorting the plurality of users to be processed in chronological order.

A multi-user multi-service scheduling apparatus for a wireless communication network, comprising: a queue generation module, configured to sort a plurality of users to be processed, and generate a user scheduling queue;

And a service processing module, configured to sequentially process a predetermined number of data packets of each user in the user scheduling queue, wherein the predetermined number is preset according to the priority of the user.

The scheduling device according to claim 6, wherein the device further comprises: a service determining module, configured to determine, during the processing, whether the service of the currently processed user is empty;

a user deletion module, configured to: if the judgment result of the service judging module is yes, delete the user from the user scheduling queue;

The user link module is configured to link the user to the tail of the user scheduling queue if the judgment result of the service judging module is no.

The scheduling apparatus according to claim 7, wherein the service processing module comprises: a service queue generating module, configured to sort a plurality of services of each user, and generate a service queue, where each Services include at least one data packet;

a packet processing module, configured to sequentially process one data packet of each service of the service queue until the number of processed data packets reaches the predetermined number;

A packet deletion module is used to delete a processed packet from the service to which it belongs.

The scheduling device according to claim 8, wherein the service processing module further comprises:

a data packet judging module, configured to determine, in a processing process of each service, whether the currently processed service has a remaining data packet;

a service linking module, configured to link the service to a tail of the service queue if the judgment result of the data packet determining module is yes;

The service deletion module is configured to delete the service from the service queue if the judgment result of the data packet determination module is negative. The scheduling apparatus according to claim 6, wherein the queue generating module comprises: a time queue generating module, configured to sort the plurality of users to be processed in chronological order.