Multi-service scheduling method and system

Abstract

The invention discloses a multi-service scheduling method, which comprises the following steps: A, calculating a service transmission rate in a certain time period prior to a current scheduling time slot, counting packet loss of L2 packets and waiting time lengths of first packets of services, and then calculating scheduling priorities among the services; B, acquiring the service with the highestpriority from a scheduling queue and allocating resources for the service through a GBR token bucket if the service is determined as a GBR service; and C, updating available resources, continuing allocating resources for the GBR service through an MBR token bucket if the available resources are determined to be not null, and combining the resources allocated for the service respectively through the GBR token bucket and the MBR token bucket. The invention simultaneously discloses a multi-service scheduling system. The method and the system fully consider the Quality of Service QoS attribute ofthe service, and meet the GBR requirement of the service at the same time of avoiding the occurrence of a 'hunger' situation.

Description

technical field [0001] The present invention relates to multi-service scheduling technology, in particular to a multi-service scheduling method and system. Background technique [0002] In protocols of the third generation partnership project (3GPP) R4 and previous versions, the function of packet scheduling is mainly performed by a radio network controller (RNC). Its main feature is: when resources are adjusted between different users or business flows, it is generally notified through high-level signaling. The 3GPP R5 protocol introduced the High Speed ​​Downlink Packet Access (HSDPA) technology, and the 3GPP R6 protocol introduced the High Speed ​​Uplink Packet Access (HSUPA) technology, which are used to improve the system throughput and peak rate in the downlink and uplink directions respectively. HSDPA and HSUPA mainly adopt three scheduling technologies: adaptive modulation and coding (AMC), hybrid automatic repeat request (HARQ) and fast scheduling (FS). The advanta...

AI Technical Summary

Problems solved by technology

[0007] However, it can be known from the above description that among the above three traditional scheduling algorithms, the polling algorithm does not consider the channel condition differences between different users, which is not conducive to improving the overall throughput performance of the cell; while the maximum carrier / interference algorithm improves the system total throughput, but cannot guarantee service fairness among users; although the proportional fairness algorithm achieves a certain compromise between the total throughput of the system and the service fairness of users, this algorithm can only be applied to single business conditions

Therefore, none of the above-mentioned traditional scheduling algorithms can meet the needs of fully considering the QoS attributes of services and controlling the rate of each service in the case of multiple services in the LTE system

Images