A method and device for processing fragmented messages

Abstract

The invention discloses a method and device for processing fragmented messages, comprising: creating a correct queue list and an error queue list in advance, and creating a head pointer, a tail pointer, and a virtual tail pointer for each queue list; when there is a new fragment When it arrives, assign an address for the new fragment, store the address of the new fragment into the tail node of the correct queue list and the error queue list respectively, and point the correct virtual tail pointer and the wrong virtual tail pointer to the address of the new fragment respectively; check the new Whether the shard is correct and whether the new shard is a tail shard; if it is correct and it is a tail shard, update the correct chain tail pointer to the value of the correct virtual tail pointer, and update the wrong virtual tail pointer to the value of the wrong chain tail pointer; If it is wrong, update the correct virtual tail pointer to the value of the correct chain tail pointer, and update the wrong chain tail pointer to the value of the wrong virtual tail pointer. The present invention saves storage resources and improves message checking efficiency by creating a linked list and adopting a virtual enqueue method.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to a method and device for processing fragmented messages. Background technique [0002] Due to the low cost of Ethernet, flexible networking and good scalability, more and more IP (Internet Protocol) data is carried on Ethernet, but because Ethernet has an upper limit of 1500 bytes for the payload length, As a result, when IP packets pass through the Ethernet, the packets that are too long must be fragmented and reassembled. [0003] However, due to the delay or jitter in the network that transmits the message, errors such as loss and out-of-sequence of the fragmented message may occur. A traditional method for checking fragmentation errors is to first apply for a large buffer, and the message When the first fragment of the message arrives, put the first fragment of the message into the cache, such as figure 1 As shown, the fragments are stored in the location of ca...

AI Technical Summary

Problems solved by technology

The disadvantage of the above method is that when different types of packets arrive interspersedly, when the tail fragments of one type of packets do not arrive completely, the first fragments of other types may have arrived. Allocate a new piece of storage space for the first fragment to wait for its error checking and reorganization to complete

Therefore, the existing technical solutions need to apply for a large cache. When the connection is large, a large amount of storage space is required; and the speed of message inspection and reassembly is slow, the transmission rate of message data is not fast, and it is easy to cause congestion when there is a large flow

Images