A method and system for sending and scheduling network node multi-service data

Abstract

The invention provides a method for dispatching and dispatching multi-service data of network nodes, and achieves the purpose of shortening the dispatching time and ensuring the timing relationship between data through single-stage dispatching. The implementation process of the present invention includes: 1) the priority of sending data is stored in the sending data priority FIFO group, and each FIFO wherein is all corresponding to a kind of sending data; 2) the priority register group according to the content of effective sending priority FIFO Set the value of each element in the group; 3) select the effective line with the highest priority in the priority register group, and store it in the priority request register; 4) take the priority request register as input, and use the R-R scheduler Get the scheduling result and write it into the scheduling result FIFO; at the same time, send a read clear signal to the corresponding sending data priority FIFO. The invention has short scheduling time, saves the use of on-chip buffers, and guarantees the timing relationship among sending data to the greatest extent.

Description

technical field

[0001] The invention relates to a sending scheduling method, in particular to a sending scheduling method of network node multi-service data. Background technique

[0002] In the field of network communication, the transmission scheduling method determines key performances such as delay and timing relationship of data transmission. In the current network nodes, multi-service data transmission from different sources generally adopts a two-level scheduling method. First, a scheduling is performed in the data group of the same source, and the transmitted data is read into the on-chip cache corresponding to the source according to the scheduling result. Then schedule the data in the on-chip cache to obtain the final scheduling result. Although this method can realize the data sending and scheduling function, it has the disadvantages that the scheduling takes a long time and will destroy the timing relationship between the data. Contents of the invention [00...

Examples

Embodiment Construction

[0033] Such as figure 1 As shown, each bit of the send data enable register corresponds to a send data priority FIFO, and the corresponding FIFO is controlled by setting the value of each bit of the send data enable register; the send data priority FIFO group uses First-Word The Fall-Through type FIFO is used to store the priority of sending data, each of which corresponds to a type of sending data; the priority register group is a two-dimensional register group, each row corresponds to a priority, and each column corresponds to A sending priority FIFO, when the sending priority FIFO corresponding to a certain type of data is valid, the corresponding element can be set to be valid according to the priority; the priority request register is used to store the highest priority in the priority register group Valid row; the priority scheduling state machine controls the entire sending scheduling process; the R-R scheduler selects an element (representing what should be sent) from t...

technical field

[0001] The invention relates to a sending scheduling method, in particular to a sending scheduling method of network node multi-service data. Background technique

[0002] In the field of network communication, the transmission scheduling method determines key performances such as delay and timing relationship of data transmission. In the current network nodes, multi-service data transmission from different sources generally adopts a two-level scheduling method. First, a scheduling is performed in the data group of the same source, and the transmitted data is read into the on-chip cache corresponding to the source according to the scheduling result. Then schedule the data in the on-chip cache to obtain the final scheduling result. Although this method can realize the data sending and scheduling function, it has the disadvantages that the scheduling takes a long time and will destroy the timing relationship between the data. Contents of the invention [00...

Examples

Embodiment Construction

[0033] Such as figure 1 As shown, each bit of the send data enable register corresponds to a send data priority FIFO, and the corresponding FIFO is controlled by setting the value of each bit of the send data enable register; the send data priority FIFO group uses First-Word The Fall-Through type FIFO is used to store the priority of sending data, each of which corresponds to a type of sending data; the priority register group is a two-dimensional register group, each row corresponds to a priority, and each column corresponds to A sending priority FIFO, when the sending priority FIFO corresponding to a certain type of data is valid, the corresponding element can be set to be valid according to the priority; the priority request register is used to store the highest priority in the priority register group Valid row; the priority scheduling state machine controls the entire sending scheduling process; the R-R scheduler selects an element (representing what should be sent) from t...

Images