Queue dispatching method and apparatus in data network

Abstract

A method for dispatching queue in data network includes confirming weight of weighted dispatch for each queue and confirming relevant weighted dispatch interval in a weighted dispatch cycle according to weight of each queue, relevantly dispatching each queue data to be out of queue for being sent out according to confirmed weighted ¿C dispatch interval of each queue. In addition, a relevant queue dispatching device is also disclosed.

Description

technical field [0001] The invention relates to the technical field of data communication, in particular to a queue scheduling method and device for performing weighted round-robin scheduling on data of multiple queues in a data network. Background technique [0002] The amount of data processed by the current network is increasing, and network congestion is extremely common. Congestion prevents traffic from obtaining resources in a timely manner, which is the source of service performance degradation. Congestion may cause the following negative effects: Congestion increases packet transmission delay and delay jitter, and excessive delay will cause packet retransmission; congestion It will reduce the effective throughput of the network and cause damage to network resources; increased congestion will consume a lot of network resources (especially storage resources), and unreasonable resource allocation may even cause the system to fall into resource deadlock and collapse. Wh...

AI Technical Summary

Problems solved by technology

However, in the late period of the scheduling cycle, there is still a situation where the data of a queue is sent continuously. The final result is that there are instantaneous burst packets in the late stage of the scheduling cycle. The burst is still relatively large, and the transmission delay and jitter of the data packets are also large. For a queue with a larger weight, the burst at the end of the scheduling cycle is larger, and the jitter is also larger

Images