CN100566295C - A kind of Packet Service scheduling method for wireless resource based on service quality guarantee - Google Patents

Abstract

The present invention discloses a kind of Packet Service scheduling method for wireless resource based on QOS, comprising: determine the priority of each type of service, carry out wireless resource scheduling according to determined priority; User for same line of business, be preferably current mean data rate less than the user resource allocation that guarantees bit rate GBR, according to present rate, Mean Speed and the overtime time limit of service-user and/or based on the scheduling of resource priority of buffer memory, be each user's distributing radio resource according to priority order from big to small than each user of calculating.Adopt method provided by the invention that the system wireless resource management is combined with the transport service type, make resource allocation more reasonable and flexible, thereby can realize adapting to the management of the required Radio Resource of mixed service in the future mobile communication system better.

Description

A wireless resource scheduling method for packet services based on quality of service guarantee

technical field

The invention relates to the technical field of mobile communication, in particular to a wireless resource scheduling method for packet services.

Background technique

High Speed Downlink Packet Access (HSDPA) is a technology to improve the downlink data transmission rate of Time Division-Synchronous Code Division Multiple Access (TD-SCDMA) system. (Release 5) version of the system standard, under the existing TD-SCDMA system network structure, the data rate of the user's downlink service can be increased to more than 2.8Mbps.

FIG. 1 is a schematic diagram of a partial structure of a cell in a WCDMA or TD-SCDMA system. As shown in Fig. 1, the system includes a radio network controller (RNC), a base station and a user equipment (UE). The resources related to HSDPA in the cells of the TD-SCDMA system include High Speed-Physical Downlink Shared Channel (HS-PDSCH, High Speed-Physical Downlink Shared Channel), which is used to transmit service data; High-speed shared control channel (HS-SCCH, High Speed -Shared Control Channel), used to transmit signaling information and high-speed shared information channel (HS-SICH, High Speed-Shared Information Channel), used to transmit control information fed back by user equipment.

Schedule and configure related HSDPA resources in the cell according to the load condition and service type of the cell. The RNC decides whether to allocate related HSDPA resources for a UE according to factors such as the data throughput and QoS of the UE.

In an all-packet wireless multimedia network, reasonable scheduling of packet services is required to ensure the QoS requirements of various services. It is the requirement of wireless high-speed data network to provide QoS guarantee and meet the data rate and packet delay limit of real-time users.

In 3GPP, the services carried in the future communication system are divided into four categories according to their QoS requirements: Conversational, Streaming, Inter-active, and Background, as shown in Table 1. Show. Simultaneous communication of so many services with different characteristics requires a simple, effective and robust radio resource management mechanism for coordination, and the burst transmission characteristics of packet services will bring greater challenges to radio resource management .

To ensure system stability, when a user initiates a wireless resource request to the network, the system needs to control access to services. Through access control, the system load is controlled to an acceptable level, so that the scheduling algorithm can play a better role.

Here, it is assumed that the scheduling scheme is based on ideal access control. All packet services need to be scheduled by the packet scheduling system to obtain radio resources, for example, each TTI allocates radio resources. Therefore, the packet scheduling system is at the core of the radio resource management architecture. Since the session service has a high sensitivity to time delay, a dedicated channel (DCH) is generally allocated for transmission during access control, and is not considered during scheduling. Therefore, the services that need to be scheduled and allocated resources are mainly streaming media services, interactive services, and background services. Streaming media services and interactive services have certain delay sensitivity and need to ensure the minimum transmission bit rate to ensure their business service quality. Fast Packet Scheduling (FPS) is a scheduling algorithm located in the MAC layer. The HSDPA system can use the FPS algorithm to implement service scheduling on the HS-DSCH channel, and manage the physical layer air interface resources related to the HSDPA channel and UE. For mixed services, the Fast Packet Scheduling (FPS) algorithm usually needs to comprehensively consider factors such as system throughput, fairness, and service QoS indicators to schedule resources.

The most basic packet scheduling algorithms described in the document 3GPP TS25.848, Physical layer aspects of UTRA High Speed Downlink Packet Access, 2001.3 include MaxC/I algorithm and polling algorithm (Round Robin, RR), Max C/I scheduling algorithm It is a typical scheduling algorithm that uses "multi-user diversity effect" to maximize system capacity. Its basic idea is to sort all mobile stations to be served according to their received signal C/I prediction values, and send them in descending order. Round Robin (RR for short): The basic idea of the RR algorithm is to ensure that users in the cell cycle occupy wireless resources of equal time in a certain order to communicate. Each user corresponds to a queue to store data to be transmitted, and the non-empty queues receive services in a round-robin manner to transmit data during scheduling. The round robin algorithm can not only guarantee the long-term fairness among users, but also ensure the short-term fairness of users, and the algorithm is simple to implement. But this algorithm does not take into account the specific situation of different users' wireless channels, so the system throughput is very low. Generally, the RR algorithm is considered to be the fairest, because it guarantees that all users take an equal amount of time to communicate; at the same time, the algorithm is considered to be the lowest in performance (its system throughput is the lowest in the actual system). The RR algorithm is the upper bound of fairness and the lower bound of algorithm performance.

The above two algorithms obtain the upper and lower bounds of the system throughput respectively. However, an ideal packet scheduling algorithm should take all factors into consideration and seek to achieve a certain balance in real time.

Contents of the invention

In view of this, the object of the present invention is to provide a kind of QoS-based packet service wireless resource scheduling method, to mix packet service, based on QoS guarantee, instantaneous channel quality, long-term fairness between users to TDD-HSDPA system downlink resources Scheduling and management.

A kind of QoS-based packet service wireless resource scheduling method provided by the present invention comprises steps:

(a) determining the scheduling priority according to the service type of each user;

(b) For users of the same service type in step (a), assign resources to users whose current average data rate is less than the guaranteed bit rate GBR, and calculate the priority Pi of each user, from large to small according to the calculated priority Allocate wireless resources for each user in sequence, wherein the priority Pi is calculated according to the following formula:

${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Timeou</span>}{\mathrm{<span\; class="notranslate">\; t</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}$

Timeout _i (t) = DT _i -QT _i (t) - MTT _i

Among them, R _i (t) is the average transmission rate of user i, R _i (t) is the current signal-to-interference ratio (SIR) of user i to obtain the instantaneous transmission rate corresponding to the modulation and coding mode MCS, and DT _i is the packet loss timing: packet loss overtime And set the time threshold parameter, MTT _i is the maximum transmission time: the transmission time of the data packet on the air interface after the maximum retransmission, QT _i is the queuing timing: at the current moment i user and packet data queue head packet is placed in the base station buffer device time difference.

Wherein step (a) comprises:

Allocate users of different service types to different service queues, so as to distinguish the QoS requirements of different service types for group scheduling.

The method further includes allocating resources according to the scheduling priority calculated based on the cache ratio, wherein the scheduling priority is calculated according to the following formula:

${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; BR</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; Timeout</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}$

Among them, R _i (t) is the average transmission rate of user i, R _i (t) is the current signal-to-interference ratio (SIR) of user i to obtain the instantaneous transmission rate corresponding to the modulation and coding mode MCS, and DT _i is the packet loss timing: packet loss overtime And set the time threshold parameter, MTT _i is the maximum transmission time: the transmission time of the data packet on the air interface after the maximum retransmission, QT _i is the queuing timing: at the current moment i user and packet data queue head packet is placed in the base station buffer BR _i (t) is the buffer ratio of the i-th user, that is, the ratio of the space capacity occupied by the i-th user data in the base station buffer to the total capacity of the base station buffer.

Each time the wireless resource scheduling is completed, the resource pool is updated, and if there are remaining resources, the resource scheduling is continued according to the priority.

To sum up, the present invention provides a feasible scheme of wireless resource scheduling mechanism suitable for TDD-HSDPA system that takes into account the QoS requirements of mixed packet services, system short-term throughput and long-term fairness among users. This solution calculates the priority of different services and their users, and performs wireless resource allocation and scheduling according to the priority. Compared with the traditional Max C/I algorithm or polling algorithm for fast packet scheduling, this technical solution can ensure real-time service QoS requirements, and improve system throughput as much as possible on the basis of ensuring long-term fairness among users. The method provided by the invention can combine system wireless resource management with transmission service type, make resource allocation more reasonable and flexible, and thus can better realize the management of wireless resources required by mixed services in future mobile communication systems.

Description of drawings

FIG. 1 is a schematic diagram of a partial architecture of a cell in a CDMA system;

Fig. 2 is a schematic diagram of the HSDPA data subframe structure according to the present invention;

Fig. 3 is a flow chart of a scheduling method based on QOS guarantee according to the present invention.

Detailed ways

Network service quality of service (QoS for short) is a qualitative agreement on information transmission and sharing between users on the network and between users communicating with each other on the network. In 3GPP, the services carried in the future communication system are divided into four categories according to their QoS requirements: conversational services, streaming services, interactive services, and background services. As shown in Table 1, the rates and delays required by various services are different.

business type business characteristics business example Latency and rate requirements conversational business There is a close correlation between each information unit in the business flow, and it is most sensitive to delay Voice service, VoIP video phone 80-D_max(ms)＜2.048(Mb/s) streaming business There is a close correlation between each information unit in the business flow, which is sensitive to delay video stream audio stream 250-D_max(ms)＜2.048(Mb/s) interactive business Request-response model, payload content requires high security www web browsing database search no limit background business It is not necessary to complete the response within the specified time, and the payload content requires high security E-mailSMS no limit

Manage and allocate resources according to different types of QoS. For example, allocate larger bandwidth resources to real-time services; users put forward QoS requirements according to different applications. According to the use of resources in the network, users are allowed to enter the network for multimedia information transmission and control and negotiate their QoS. In order to provide users with satisfactory QoS, corresponding resources such as peer systems, routers, and transmission bandwidth must be provided to ensure that these resources are preferentially allocated to resource scheduling and management. After the resources are reserved, whether these resources can be obtained also depends on the corresponding resource scheduling and management system.

For packet services that guarantee service quality, it is necessary to apply for a guaranteed bit rate GBR (Guaranteed Bit Rate). For example, from an application point of view, Video users require a higher GBR, so apply for a higher service rate, such as 64kbps, 128kbps or higher; if the www business needs to guarantee a lower GBR, for example, set it to 8kbps.

In addition, a time threshold parameter is set for packet loss over time: packet loss timing (DT). 3GPP defines the packet delay requirement as 95% of the cumulative distribution function (CDF) of all correctly received packet times is less than the delay threshold, such as streaming services corresponding to 280ms, therefore, for a single packet, its delay can exceed 280ms but needs to be less than a certain threshold DT to ensure that the packet delay requirement is met in a statistical sense. In order to reduce the packet loss rate, it is necessary to prioritize the scheduling of data packets close to DT at the sending end;

Queue timing (QT) is defined as the time difference between the current moment and the head packet of a certain user packet data queue being placed in the base station buffer, which can be used as an indicator to measure the fairness of user scheduling and guarantee delay;

The retransmission data refers to the data that needs to be retransmitted through HARQ after the previous transmission failure. The reason why its priority is increased is that the subsequent data cannot be reassembled and delivered to the upper layer until it is successfully received. The transmission time of the data packet on the air interface after the maximum retransmission, defines the maximum transmission time (MTT);

Due to the limited buffer memory of the base station, in order to avoid buffer data overflow, priority scheduling should also be considered for users whose buffer data is close to the memory limit. Here, the buffer ratio (BR) is defined as the ratio of the space capacity occupied by user data in the base station buffer to the total capacity of the base station buffer.

In order to further understand the principles, characteristics and advantages of the present invention, the present invention will be described in detail below in conjunction with the TDD-HSDPA packet scheduling strategy of the TD-SCDMA system. Figure 2 shows the HSDPA data subframe structure. For TDD-HSDPA, the 6 service time slots are divided into 1 uplink time slot and 5 downlink time slots, and the uplink time slot is used to transmit channel quality feedback (CQI), ACK/NAK feedback and uplink data from UE to base station etc., the spreading factor is 16; the downlink time slot is mainly used to send transmission instructions and downlink data from the base station to the UE, and the spreading factor is 1 or 16.

The present invention mainly relates to the scheduling management of wireless resources. It is assumed that the scheduling of wireless resources is performed on the premise that group users normally access the network, that is, when a user applies for access to the network, the system needs to perform access control to control the load at Within a certain range, the connected users are guaranteed to be able to communicate normally.

Fig. 3 is a flow chart of scheduling based on QoS guarantee according to the present invention, showing a specific implementation process of a radio resource management solution including packet access and packet scheduling. Referring to Figure 3, when users access the system, the base station assigns users of different service types to different service queues to differentiate the QoS requirements of different service types for group scheduling. Users accessing through packets will wait for the packet scheduler to allocate resources for them.

According to the scheduling priority, it is necessary to schedule the business packets that need to be transmitted in real time first, such as Video retransmission packets, and update the resource pool;

For newly transmitted video users who need to guarantee the bit rate GBR, that is, users who transmit data for the first time, when the current average data rate of this user is lower than GBR, that is, users who urgently need resource scheduling, priority scheduling is required. That is, video users with R _i (t)<GBR _i are allocated wireless resources; and resources are allocated to this type of users according to the scheduling priority, and the scheduling priority calculation formula is:

${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Timeou</span>}{\mathrm{<span\; class="notranslate">\; t</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; )</span>$

Timeout _i (t) = DT _i -QT _i (t) - MTT _i (2)

In the formula, P _i is the scheduling priority, and the scheduling order is from large to small; R _i (t) is the average transmission rate of user i; R _i (t) is the current SIR (Signal Interference Ratio) of user i to get the MCS The corresponding instantaneous transmission rate. And update the resource pool after scheduling.

According to the scheduling priority, allocate resources for interactive service users who need to guarantee the bit rate GBR, such as WWW users with R _i (t)<GBR _i , and update the resource pool;

Scheduling priority calculation formula:

${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Timeou</span>}{\mathrm{<span\; class="notranslate">\; t</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 3</span>}<span\; class="notranslate">\; )</span>$

Timeout _i (t) = DT _i - QT _i (t) - MTT _i (4)

Here, the GBR used as the judgment condition and the DT parameter in the priority formula correspond to the value of the corresponding service.

Finally, based on the situation of the remaining resources, use the best effort (best effort) method to schedule business users who have no time limit requirements and do not require GBR protection, such as video and WWW (FTP); considering the two factors of cache space and packet loss time, The present invention improves the PFS and M-LWDF algorithms, and the scheduling priority calculation formula is:

${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; BR</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; Timeout</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 5</span>}<span\; class="notranslate">\; )</span>$

Wherein BR _i (t) is the buffering ratio of the i-th user, that is, the ratio of the space capacity occupied by the i-th user's data in the buffer of the base station to the total capacity of the buffer of the base station.

The present invention will be further described below by taking resource scheduling in a TDD-HSDPA system with video, www, and FTP mixed services as an example.

Various service data in the TDD-HSDPA system have different priorities. Assume that in the TDD-HSDPA system, there are users User1 and User2 of the video service, users User3 and User4 of the www service, and users User5 and User6 of the ftp service. At a certain time t, the parameters of each user are:

User1: R _i (t) is 704kbps, R _i (t) is 350kbps, GBR is 384kbps, DT is 3s, QT is 2s, MTT is 0.06s, BR is 0.6.

User2: R _i (t) is 352kbps, R _i (t) is 100kbps, GBR is 128kbps, DT is 3s, QT is 1.5s, MTT is 0.06s, BR is 0.4.

User3: R _i (t) is 352kbps, R _i (t) is 6kbps, GBR is 8kbps, DT is 30s, QT is 10s, MTT is 0.06s, BR is 0.8.

User4: R _i (t) is 352kbps, R _i (t) is 10kbps, GBR is 8kbps, DT is 30s, QT is 2s, MTT is 0.06s, BR is 0.4.

User5: R _i (t) is 1056kbps, R _i (t) is 1000kbps, DT is 300s, QT is 20s, MTT is 0.06s, BR is 0.5.

User6: R _i (t) is 704kbps, R _i (t) is 300kbps, DT is 300s, QT is 30s, MTT is 0.06s, BR is 0.5.

The whole scheduling process is as follows:

1) First, schedule retransmission data of user User1 and user User2 of the video service.

2) After scheduling the previous high-priority data, if there is still resource scheduling left, schedule the newly transmitted data of the video satisfying R _i (t)<GBR _i . Both user User1 and user User2 satisfy this condition and belong to the users who need to obtain service quality assurance. Their priorities are calculated according to (1) to get P ₁ =2.14, P ₂ =2.44, the resources are allocated to User 2 first, and User 1 uses the remaining resources after User 2 uses them.

3) After scheduling the previous high-priority data, if there is resource scheduling remaining, schedule retransmission data of users User3 and User4 of the www service.

4) After scheduling the previous high-priority data, if there is still resource scheduling left, schedule newly transmitted data satisfying R _i (t)<GBR _i . User User3 satisfies this condition, but User4 does not. Therefore, user User3 is prioritized for scheduling, and user User4 is not scheduled temporarily. If there are multiple users who meet the conditions for priority scheduling, their priorities are calculated according to formula (3).

After scheduling all the previous data, if there is still resource scheduling remaining, calculate the priorities of all video, www, and FTP users according to formula (5), and the users with higher priorities calculated will be prioritized for scheduling.

The above descriptions are only exemplary embodiments of the present invention, and are not intended to limit the protection scope of the present invention. All modifications, equivalent replacements, changes, etc. made within the spirit and principles of the present invention are included within the protection scope of the present invention.

Claims (4)

1. A QoS-based packet service wireless resource scheduling method, characterized in that it comprises: (a) determining the scheduling priority according to the service type of each user; (b) For users of the same service type in step (a), assign resources to users whose current average data rate is less than the guaranteed bit rate GBR, and calculate the priority Pi of each user, from large to small according to the calculated priority Allocate wireless resources for each user in order, and the priority Pi is calculated according to the following formula: ${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; /</span>{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Timeou</span>}{\mathrm{<span\; class="notranslate">\; t</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}$ Timeout _i (t) = DT _i -QT _i (t) - MTT _i Among them, R _i (t) is the average transmission rate of user i, R _i (t) is the current signal-to-interference ratio (SIR) of user i to obtain the instantaneous transmission rate corresponding to the modulation and coding mode MCS, and DT _i is the packet loss timing: packet loss overtime And set the time threshold parameter, MTT _i is the maximum transmission time: the transmission time of the data packet on the air interface after the maximum retransmission, QT _i is the queuing timing: at the current moment i user and packet data queue head packet is placed in the base station buffer device time difference. 2. The packet service radio resource scheduling method according to claim 1, wherein the step (a) comprises: Allocate users of different service types to different service queues, so as to distinguish the QoS requirements of different service types for group scheduling. 3. The wireless resource scheduling method for packet services according to claim 1, characterized in that the method further comprises resource allocation according to the scheduling priority calculated based on the buffer ratio, wherein the scheduling priority is calculated according to the following formula: ${\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; R</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; BR</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}{{\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{\mathrm{<span\; class="notranslate">\; R</span>}}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; \&times;</span>{\mathrm{<span\; class="notranslate">\; Timeout</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; t</span>}<span\; class="notranslate">\; )</span>}$ Among them, R _i (t) is the average transmission rate of user i, R _i (t) is the current signal-to-interference ratio (SIR) of user i to obtain the instantaneous transmission rate corresponding to the modulation and coding mode MCS, and DT _i is the packet loss timing: packet loss overtime And set the time threshold parameter, MTT _i is the maximum transmission time: the transmission time of the data packet on the air interface after the maximum retransmission, QT _i is the queuing timing: at the current moment i user and packet data queue head packet is placed in the base station buffer BR _i (t) is the buffer ratio of the i-th user, that is, the ratio of the space capacity occupied by the i-th user data in the base station buffer to the total capacity of the base station buffer. 4. The wireless resource scheduling method for packet services according to claim 1, wherein the resource pool is updated each time the wireless resource scheduling is completed, and if there are remaining resources, the resource scheduling continues according to the priority.

Images