Method and device for scheduling service queue

Abstract

The invention discloses a method for scheduling a service queue, which comprises the following steps of: establishing a plurality of service queues on a network element; using the network element to measure a service quality (Qos) parameter of a service flow on each Real-time Transport Protocol (RTP) passage in a transmission layer; using the network element to distribute the service flow on each RTP passage to corresponding service queue in a network layer; adjusting a band width of each service flow and a weight value of the service queue according to the Qos parameter of each service flow and sending the service flow in each service queue to a lower layer according to weighted cyclic scheduling. Meanwhile, the invention also discloses a device for scheduling the service queue. According to the scheme of the invention, cross-layer optimized scheduling of the service queue can be realized, and the band width of the service flow and the weight of the service queue can be adjusted in real time.

Description

technical field [0001] The invention relates to the field of mobile communication, in particular to a method and device for dispatching service queues. Background technique [0002] In the current Global System for Mobile Communications (GSM, Global System for Mobile Communications) system, the interfaces between network elements basically adopt an increasingly common Internet Protocol (IP) structure, that is, two Interfaces between network elements use packets for data transmission and exchange, usually in the form of Real-time Transport Protocol (RTP) / User Datagram Protocol (UDP) / IP / Media Access Control Protocol (MAC) packets. [0003] Between these network elements in the GSM system, there may be multiple service flows at the same time. When one party has too many IP packets, if they cannot be sent from the other egress in time, the network element needs to perform differentiated control according to the QoS requirements of each service. For network elements, different ...

AI Technical Summary

Problems solved by technology

The method of PQ is to classify the traffic first, and then schedule the traffic strictly according to the priority of the classified traffic, process the high priority traffic first, and then process the low priority traffic; the defect is: if the high priority traffic always exists, then it will be prioritized Low-level traffic will never be dispatched

If the preset weight value is unreasonable or the volume of each business changes greatly, it will lead to large Qos differences between different services, or the Qos of some services cannot reach the expected weight value, which will affect the scheduling of service queues

[0005] In terms of business queues, such as figure 1 As shown, the traditional WRR scheduling method is classified according to the business type, without further differentiation within the same business, and it is impossible to further distinguish and control different services of the same type

Images