Credit scheduling method and device and bypass device for solving linear speed of packet

Abstract

The embodiment of the invention provides a credit scheduling method and device and a bypass device for solving a linear speed of a packet. The method comprises the following steps of: receiving a queue number and a packet length value of a data packet entering a queue corresponding to the queue number; increasing the packet length value to a length value of the queen corresponding to the queue number to obtain an updated queue length value; judging whether the difference value between the updated queue length value of the queue and a current token credit of the queue is larger than zero, if so, applying scheduling, or non applying the scheduling; allocating the credit which does not exceed the updated queue length value to the queue when the scheduling is not applied; and removing the credit allocated to the queue already from the updated queue length value and the current credit. By virtue of the method, a situation of scheduler idling caused by allocating no necessary scheduling to the queue with a remaining credit by a scheduler is avoided, and linear speed is favorably reached at an outlet in a packet occasion. Moreover, bandwidth resources of the credit scheduler are saved, and more reasonable and efficient scheduling is realized.

Description

technical field [0001] The invention relates to a dispatching method of a service flow queue in a network, in particular to a credit dispatching method, a dispatching device and a bypass device for solving the line speed of small packets. Background technique [0002] Scheduling is the key technology to realize QoS (Quality of Service). The outbound port of a node in the network has the maximum processing capacity. When the inbound port flow of a node is greater than the outbound processing capacity, the node will be congested. Congestion The result is packet loss. In the network nodes that do not provide QoS guarantee, the FIFO (First In First Out) method is usually adopted to temporarily store data packets. Once the FIFO is full due to congestion, the new data packets entering the node will be discarded instead of It cares about what data packets are discarded, and adopts the drop tail mechanism (drop tail) to discard new incoming data packets. In order to provide differ...

AI Technical Summary

Problems solved by technology

First of all, if the total scheduling capacity configured by the scheduler is equal to the line-speed processing capacity of the export, and there is no acceleration ratio, then the number of idle cycles will make the credits scheduled by the scheduler insufficient to send enough data packets, and the export cannot reach the line-speed , resulting in a waste of bandwidth; secondly, even if the scheduler has a certain speed-up ratio, if the queue is full of small packets (less than 128B), then the small packets will not be line-speed

Images