Method for quickly processing data adhesion

Abstract

The invention discloses a method for quickly processing data adhesion. The method is characterized by comprising the following steps that data blocks are combined into a single-cycle read-write link list in an array form; a data processing service thread names the read-write link list in a process address space through a memory file mapping technology; a write thread finds a read-write link list memory in the process address space through a name; and a program starts to wait for data. According to the method, an idle region of a program memory can be fully used and a large amount of CPU time slices generated by unwanted kernel and user mode conversion can be avoided to greatly increase the receiving speed.

Description

technical field [0001] The invention relates to the field of communication, in particular to a method for rapidly processing sticky packets of data. Background technique [0002] The TCP protocol (Transmission Control Protocol), as the most basic protocol of the Internet and the basis of Internet communication, is composed of the IP protocol (Internet Protocol) at the network layer and the TCP protocol at the transport layer. It defines how various electronic devices access the Internet and how data is transmitted between devices. [0003] The TCP protocol provides a reliable unbounded transmission method based on stream data, and cooperates with the congestion control algorithm of the sliding window to adjust the sending rate. Therefore, in the actual network environment, the data stream of the TCP protocol will produce sticky packets where the head and tail cannot be distinguished and the complete data packet is broken at the receiving end, and in video streams, for examp...

AI Technical Summary

Problems solved by technology

Therefore, in the actual network environment, the data stream of the TCP protocol will produce sticky packets where the head and tail cannot be distinguished and the complete data packet is broken at the receiving end, and in video streams, for example, the data is long, the amount of data is huge, and the real-time requirements are high. In the case of untimely reception, the congestion control algorithm actively reduces the size of the sliding window and seriously reduces the sending rate.

[0004] The existing methods for splitting sticky packets are limited to opening up space in the default stack memory area of ​​a single process for data header parsing and caching to achieve the purpose of splitting, which cannot make full use of today's increasingly large memory addressing space and use more excellent data structure

Moreover, in the existing process of splitting and sticking packets, the data cache protection mechanism consumes a lot of time for the CPU time slice conversion of the program kernel state and user state suspend and wake up, resulting in a large amount of idle memory and a limit on the receiving rate.

Images