Method for dispatching variable length data packet queue in crossbar switching matrix

Abstract

The present invention discloses a crossbar type exchange matrix data package queue method. It contains A, judging scheduling generation position, if scheduling generating at crossbar input port then executing B; if scheduling generating at crossbar crossing node cache then executing C; B, judging arriving crossbar input port data package queue type, if data package queue being unicast data package queue then adopting Deficit Round Robin (DRR) based scheduling algorithm to make scheduling; if data package queue being multicasting data package queue then adopting fan out partitional swap mode to make scheduling; C, OS adopting Deficit Round Robin (DRR) based scheduling algorithm to make scheduling to crossbar crossing cache unicast data package queue. The present invention greatly raises scheduling fairness, reducing total system data transmission average time delay, balancing every port load.

Description

technical field [0001] The invention relates to the technical field of data communication, in particular to a method for scheduling variable-length data packet queues in a crossbar. Background technique [0002] Crossbar is a switching structure, which is composed of 2N bus lines connecting N input ports (Input) and N output ports (Output), and is also called cross-connect matrix or switched lattice. [0003] Such as figure 1 as shown, figure 1 It is a schematic diagram of the internal structure of a 4×4 crossbar. The 4 buses connecting Input1, 2, 3, and 4 are connected vertically and horizontally with the 4 buses connecting Output1, 2, 3, and 4. There is a control switch at the intersection node (crosspoint) between the horizontal line where the Input is located and the vertical line where the Output is located. , used to control the crosspoint to connect the connection between Input and Output. [0004] Crossbar is mainly used in the Asynchronous Transfer Mode (ATM) ne...

AI Technical Summary

Problems solved by technology

[0013] When the IS and OS use the RR-based scheduling algorithm to schedule the unicast data packet queue, if the lengths of the data packets in the rows of the unicast data packet queue are different, the data packets scheduled by the IS and the OS will be longer each time. Then a data packet with a large length will receive more services than a data packet with a small length, and it will also take up more time, which will cause unfair scheduling between rows

At the same time, this scheduling algorithm cannot provide a delay guarantee, which increases the average delay of data transmission in the entire system, and thus leads to an extremely unbalanced load on each port.

Images