TWI385981B - Network package transmission apparatus and sequence method thereof - Google Patents

Description

Network packet transmission device and scheduling method thereof

The invention relates to a network packet transmission device and a scheduling method thereof.

With the advent of the information age, the Internet has become an indispensable tool in people's lives. In a complex network system, in order to effectively transmit packets transmitted from all sides, a so-called network server or network switch needs to be constructed to control the flow of packets between networks.

In a conventional network server or network switch, a method for scheduling a packet transfer includes a Weighted Round Robin (WRR), a Weighted Fair Queue (WFQ), Strict Priority (SP) and Deficit Weighted Round Robin (DWRR). In the strict queue buffer using strict priority, if there are packets waiting to be delivered, the packets in the non-strict queue buffer using other scheduling methods cannot be transmitted. At this point, the network server or network switch will pass all the packets in the strict queue buffer until all the packets in the strict buffer are delivered.

It can be known from the above description that in a conventional network server or network switch, once the strict buffer is always transmitted, the network server or the network switch is always in the Pass the state of the packets in the strict queue buffer. At this time, the packet temporarily stored in the non-strict queue buffer will be put in the non-strict queue buffer for a long time and will not be delivered. This will cause problems with packet transmission throughout the network.

The invention provides a scheduling method for packet delivery, which effectively avoids the serious delay of the transmission of packets of non-strict queue buffers.

The present invention provides a network packet delivery device that effectively avoids the transmission of packets that are not strictly queued buffers from being severely delayed.

The invention provides a scheduling method for packet transmission, which is suitable for transmission of a network device, wherein the transmission port is configured with at least one strict buffer and a plurality of non-strict buffer buffers, including: first, the count is transmitted to the strict The number of packet bytes in the buffer is buffered to obtain the cumulative number of packet bytes. Compare the accumulated number of packet bytes and the threshold value of the number of packet bytes and obtain the comparison result. Finally, based on the comparison result, it is decided to transmit the packets in the strict buffer buffer or the non-strict buffer buffer.

In an embodiment of the present invention, when the comparison result is that the accumulated number of packet bytes is less than the threshold value of the number of packet bytes, the packet in the non-strict queue buffer is delivered.

In an embodiment of the present invention, the method of transmitting a packet in a non-strict queue buffer includes a weighted round robin, a weighted fair queue, or a deductive weighted method. Round robin).

In an embodiment of the present invention, the foregoing packet delivery scheduling method, wherein when the comparison result is that the accumulated number of packet bytes is greater than or equal to the threshold value of the number of packet bytes, all packets in the strict buffer are transmitted. .

In an embodiment of the present invention, the above-described packet delivery method, wherein the method of transmitting the packets in the strict buffer is a strict priority.

In an embodiment of the present invention, the foregoing scheduling method for packet delivery, wherein all packets in the strict buffer must be all transmitted within a critical time of transmission, and the critical time of transmission is equal to the threshold value of the number of packets. The unit delivery time of the upper packet byte.

The invention provides a network packet transmission device, comprising at least one transmission port, at least one strict queue buffer, at least one delay counter, a plurality of non-strict queue buffers and a scheduler. The transmission port is coupled to a strict buffer. The delay counter is coupled to the strict buffer buffer to count the number of packet bytes passed to the strict buffer and obtain the accumulated number of packet bytes. The non-strict queue buffer is coupled to the transport, and the scheduler is coupled to the transport port, the strict buffer, the delay counter, and the non-strict queue buffer. The scheduler decides to transmit the packets in the strict buffer buffer packet or the non-strict queue buffer according to the comparison result of the comparison packet byte accumulation number and the packet byte group threshold value.

Based on the above, the present invention uses a set delay counter to count the accumulated number of packet bytes, and compares the threshold value of the set number of packet bytes with the accumulated number of packet bytes to discriminate the transmission of the non-strict queue buffer or Strictly queue the packets in the buffer. This allows all packets to be efficiently transmitted without the problem that only packets in the strict buffer can be transmitted. In addition, the threshold value of the packet byte number can be dynamically programmed to dynamically adjust the transfer critical time.

The above described features and advantages of the present invention will be more apparent from the following description.

FIG. 1 is a flow chart of a scheduling method for packet delivery according to an embodiment of the present invention. The steps include: first, setting a delivery critical time (step S110), which can be accomplished in a stylized manner. Moreover, the delivery critical time can also be dynamically changed through a stylized way, and does not have to be fixed forever.

Next, the transmitted packet is received, and it is checked whether the packet is to be delivered to the strict queue buffer (step S120). If so, the packet is passed to the strict queue buffer, and then step S140 is performed. Conversely, if the packet is not to be passed to the strict queue buffer, the packet will be transferred to the non-strict queue buffer, and the stored packets will be ordered according to the schedule of the non-strict queue buffer delivery packet. Passed out (step S130). Here, the scheduling manner of the non-strict buffer buffer delivery packet includes a weighted round robin method, a weighted balanced queue method, or a scheduling weighted round robin method.

Continuing the above step S120, if the packet is to be delivered to the strict buffer, the accumulated number of packets is accumulated (step S140). The packet byte accumulation number is used to count the number of packet bytes in the strict buffer. In other words, when the packets in the strict buffer are all passed out, the total number of packets is accumulated. Can be reset to "0".

When the accumulated number of packet bytes changes, the size of the accumulated number of packet bytes and the critical value of the packet byte are determined. When it is determined that the accumulated number of packet bytes is greater than or equal to the threshold value of the packet byte, it indicates that a sufficient buffer is already filled in the strict buffer and must be transmitted. Therefore, step S160 is performed to transmit the buffer in the strict buffer. All packets. Conversely, if it is determined that the accumulated number of packet bytes is less than the threshold value of the packet byte, it means that the packet in the strict buffer is not required to be transmitted immediately. Of course, since the packets in the strict queue buffer are not transmitted at this time, the packets in the non-strict queue buffer can be transmitted during this gap.

Here, the so-called packet byte threshold is preset, and the packet byte threshold can be multiplied by the previous packet byte by the threshold value of the programmed packet byte in step S110. The unit delivery time required to pass is obtained. For example, at a Giga Hz packet transfer speed, a byte packet requires a unit transfer time of nanoseconds (ns). If the user needs to set a delivery critical time of 8000 ns, the threshold value of the number of packet bytes must be programmed to be 8000/8=1000.

Please refer to FIG. 2A. FIG. 2A is a schematic diagram of a network packet transmission apparatus 200 according to an embodiment of the present invention. The network packet delivery device 200 can be a network server or a network switch. The network packet delivery device 200 includes a transport port 210, a strict queue buffer 220-230, a non-strict queue buffer 240-260, a scheduler 270, and delay counters 281-282. When a packet is to be transmitted through the transport port 210, it is first determined whether the buffer to be temporarily stored in each packet is a strict buffer 220-230 or a non-strict buffer 240-260. If the packet needs to be stored in the strict buffer 220, the delay counter 281 correspondingly coupled to the buffer 220 will accumulate the accumulated number of packets and the number of packets, if the packet needs to be After being stored in the strict queue buffer 230, the delay counter 282 coupled to the strict buffer buffer 230 accumulates the accumulated number of packet bytes and the number of packet bytes.

When the strict buffer buffers 220, 230 are not full, the packet sequence 290 transmitted by the transport port 210 is a packet temporarily stored in the non-strict queue buffers 240-260 (in the drawing of FIG. 2A, The packets in the non-strict queue buffers 240 to 260 are represented by "0", "1", and "2", respectively. At this time, the packet sequence 290 transmitted by the transmission port 210 can be determined by a weighted round robin method, a weighted balanced queue method, or a scheduling weighted round robin method.

In addition, the foregoing determination of whether the strict queue buffers 220 and 230 have been filled may be compared by comparing the accumulated number of packet bytes counted by the delay counters 281 and 282 with the threshold value of the number of packet bytes. The comparison, and the result of the comparison is used to determine the transmission 埠210 that transmits the strict buffer buffer 220~230 or the non-strict buffer buffer 240~260. It is worth mentioning that, in this embodiment, the threshold value of the packet byte number is equal to the memory capacity of the strict buffer buffer 220, 230 corresponding thereto.

For example, when the strict buffer buffers 220 and 230 are full, please refer to FIG. 2B. FIG. 2B is a schematic diagram of another embodiment of the network packet transmission apparatus 200 according to an embodiment of the present invention. In the illustration of FIG. 2B, the strict queue buffers 220, 230 are already full of packets. The scheduler 270 receives the accumulated number of packet bytes generated by the delay counters 281, 282, and compares the received number of accumulated packet bytes with the threshold value of the number of packet bytes, and learns strict 伫The column buffers 220, 230 are all full of packets and begin to transmit packets in the strict queue buffers 220, 230. Therefore, the packet sequence 290 transmitted by the transmission port 210 at this time is "4", "4", "4", "3", and represents a packet stored in the strict queue buffer 220, 230.

Please note that the number of strict buffers and non-strict buffers (two and three, respectively) in the above-mentioned Figures 2A and 2B is only an example, and is not intended to limit the network of the present invention. The strict array buffer of the embodiment of the packet transfer device and the number of non-strict queue buffers.

In summary, the present invention utilizes a delay counter to count the number of packet bytes in a strict queue buffer, and based on the count of the accumulated number of packet bytes obtained by counting and a preset threshold value of the number of packet bytes. To compare, the strict queue buffer can be transported before the packet is filled in the non-strict buffer buffer, thereby improving the smoothness of the network.

Although the present invention has been disclosed in the above embodiments, it is not intended to limit the invention, and any one of ordinary skill in the art can make some modifications and refinements without departing from the spirit and scope of the invention. The scope of the invention is defined by the scope of the appended claims.

S110~S160. . . Steps in the scheduling method

200. . . Network packet delivery device

210. . . Transmission

220~230. . . Strict array buffer

240~260. . . Non-strict queue buffer

270. . . Scheduler

281~282. . . Delay counter

FIG. 1 is a flow chart of a scheduling method for packet delivery according to an embodiment of the present invention.

2A is a schematic diagram of a network packet delivery device 200 in accordance with an embodiment of the present invention.

FIG. 2B is a schematic diagram of another embodiment of a network packet delivery device 200 according to an embodiment of the invention.

S110~S160. . . Steps in the scheduling method

Claims (10)

A packet delivery scheduling method is applicable to a transmission port of a network device, wherein the transmission port is configured with at least one strict queue buffer and a plurality of non-strict queue buffers, including: counting is passed to the strict queue buffer The number of packet bytes in the zone, and obtain a cumulative number of packet tuples; compare the accumulated number of packet bytes and a threshold value of a packet tuple and obtain a comparison result; and determine the transmission according to the comparison result The strict queue buffer packet or the packet in the non-strict queue buffer, wherein when the comparison result is that the cumulative number of the packet byte is less than the threshold value of the packet byte, the non-strict 伫 is transmitted The packet in the column buffer. The scheduling method for packet delivery as described in claim 1, wherein the method of transmitting the packets in the non-strict queue buffer includes a weighted round robin and a weighted fair method Queue) or deficient weighted round robin. The scheduling method for packet delivery as described in claim 1, wherein when the comparison result is that the cumulative number of the packet bytes is greater than or equal to a threshold value of the number of packet bytes, the strict queue buffer is transmitted. All the packets. The scheduling method for packet delivery as described in claim 3, wherein the method of transmitting the packet in the strict queue buffer is strict Strict priority. The scheduling method for packet delivery as described in claim 3, wherein all packets in the strict queue buffer must be completely transmitted within a delivery critical time, and the delivery critical time is equal to the number of packet bytes. The threshold is multiplied by the unit delivery time of the packet. A network packet transmission device includes: at least one transmission buffer; at least one strict buffer buffer coupled to the transmission buffer; at least one delay counter coupled to the strict buffer buffer for counting transmission to the strict The number of packets in the buffer buffer is obtained to obtain a cumulative number of packet bytes; a plurality of non-strict buffer buffers are coupled to the transmission buffer; and a scheduler coupled to the transmission buffer, the strict buffer buffer The delay counter and the non-strict queue buffers are configured to determine the transmission of the strict queue buffer packet or the non-comparison based on a comparison result of comparing the packet byte accumulation number and a packet byte number threshold value. Strictly arranging the packets in the buffer, wherein when the comparison result obtained by the scheduler is that the cumulative number of the packet bytes is less than the critical value of the number of packets, the scheduler passes the non-strict queues The packet in the buffer. The method for transmitting a network packet according to claim 6, wherein the method for transmitting the packets in the non-strict queue buffer comprises a weighted round robin and a weighted fair method (weighted fair) Queue or deferred weighted Round robin). The device for transmitting a network packet according to claim 6, wherein when the comparison result obtained by the scheduler is that the cumulative number of the packet bytes is greater than or equal to a threshold value of the number of packet bytes, the row The program passes all the packets in the strict queue buffer. The method of transmitting a network packet as described in claim 8 wherein the method of transmitting the packet in the strict queue buffer is a strict priority. The device for transmitting a network packet according to claim 8, wherein all the packets in the strict queue buffer must be all transmitted within a delivery critical time, and the delivery critical time is equal to the number of the packet bytes. The threshold is multiplied by the unit delivery time of the packet.