CN112491871B - TCP reorganization method, TCP reorganization device, electronic equipment and storage medium - Google Patents
TCP reorganization method, TCP reorganization device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112491871B CN112491871B CN202011337249.3A CN202011337249A CN112491871B CN 112491871 B CN112491871 B CN 112491871B CN 202011337249 A CN202011337249 A CN 202011337249A CN 112491871 B CN112491871 B CN 112491871B
- Authority
- CN
- China
- Prior art keywords
- tcp packet
- tcp
- packet
- current
- cache
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/163—In-band adaptation of TCP data exchange; In-band control procedures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/565—Conversion or adaptation of application format or content
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Memory System Of A Hierarchy Structure (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a TCP reorganization method, a TCP reorganization device, electronic equipment and a storage medium, wherein the method comprises the following steps: storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations; under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet; and sending the target TCP packet to a service layer for processing. And when the number of the TCP packets cached in the cache chain table is found to exceed the preset number, sending a packet loss event to the service layer, and determining whether to discard the data currently being processed by the service layer or not by the service layer, wherein the total number stored in the cache chain table is detected for each storage.
Description
Technical Field
The present invention relates to the field of information processing technologies, and in particular, to a TCP reorganization method, a device, an electronic apparatus, and a storage medium.
Background
The development of the Internet is not separated from network communication, and the most widely used TCP/IP protocol is currently adopted. The IP layer is mainly responsible for sending data to the right place, but it cannot guarantee that the data will be sent to, nor cannot guarantee to control the transmission rate of the data and the order of arrival of the data. TCP, in turn, solves the above-mentioned problems primarily as a connection-oriented, reliable, byte-stream based transport layer communication protocol. TCP controls the transmission rate of the flow through a sliding window protocol, and ensures the data order through a mode of overtime retransmission and sequence number piggybacking.
In general, monitoring service indexes requires adding a statistical function to the implementation of the service, so that the coupling degree is too high, especially when the statistical terms are relatively large and complex. For decoupling the service function and monitoring service index, one method is to copy the network traffic into one copy by using the switch data mirroring function and forward to the designated monitoring service for analysis.
Conventional TCP packet loss processing flow: and judging whether the received TCP packet seq is matched or not, and if not, caching. After a period of time, the expected TCP packet has not been received, and the other party is required to retransmit the packet. And receiving the retransmitted TCP packets, and processing the TCP packets according to the seq order.
After the conventional TCP loses a packet, the transmission of the lost packet can be directly required to ensure the quality of communication. However, the packet loss of data generated in the mirroring process cannot be the same as the conventional TCP transmission, and the sender can also be required to retransmit after the packet loss, at this time, the loss of the TCP packet cannot be avoided, so that the conventional TCP packet is not suitable for such a scenario.
Therefore, how to solve the problem of TCP packet loss in the mirror mode has become a problem to be solved in the industry.
Disclosure of Invention
The invention provides a TCP reorganization method, a TCP reorganization device, electronic equipment and a storage medium, which are used for solving the defect that the TCP packet loss problem in a mirror image mode cannot be processed in the prior art and realizing the TCP reorganization method.
The invention provides a TCP recombination method, which comprises the following steps:
storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations;
under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet;
and sending the target TCP packet to a service layer for processing.
According to the TCP reorganization method provided by the invention, the method further comprises the following steps:
under the condition that the sequence of the current TCP packet meets the expected sequence, the current TCP packet is sent to a service layer for processing, and the expected sequence is updated;
detecting whether the sequence of the first TCP packet in the cache linked list meets the updated expectations or not;
and when the sequence of the first TCP packet in the cache linked list meets the updated expectation, sending the first TCP packet in the cache linked list as a target TCP packet to a service layer for processing.
According to the method for reorganizing TCP provided by the invention, after detecting whether the sequence of the first TCP packet in the cache linked list meets the updated expected step, the method further comprises the following steps:
when the first TCP packet in the cache chain table does not meet the updated expectations, detecting whether the number of TCP packets in the cache chain table exceeds a preset number;
under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, sending a packet loss event to a service layer, and extracting the first TCP packet in the cache chain table as a target TCP packet;
and sending the target TCP packet to a service layer for processing.
According to the TCP reorganization method provided by the invention, the method further comprises the following steps:
triggering timing detection at preset time intervals to acquire a cache chain table at the current moment;
traversing a buffer chain table at the current moment, and detecting whether a first TCP packet in the buffer chain table of the connection is overtime or not when an un-traversed connection exists in the buffer chain table at the current moment;
if the first TCP packet in the connected cache chain table is overtime, a packet loss event is sent to a service layer;
and sending the first TCP packet in the connected cache chain table to a service layer for processing.
According to the method for reorganizing TCP provided by the present invention, after the step of sending a packet loss event to the service layer, the method further includes:
deleting the first TCP packet in the connected cache linked list to obtain an updated cache linked list;
calculating the next expected of the current expected to obtain an updated expected;
and when the first TCP packet in the updated cache linked list does not accord with the updated expectation, continuing to traverse the cache linked list at the current moment.
According to the method for reorganizing TCP provided by the present invention, after the step of calculating the next expected of the current expected and obtaining the updated expected, the method further includes:
when the first TCP packet in the updated cache chain table accords with the updated expectation, the first TCP packet in the updated cache chain table is sent to a service layer for processing;
deleting the first TCP packet in the updated cache linked list to obtain a target cache linked list, and continuously updating the updated expectation to obtain a target expectation.
The invention also provides a TCP reorganization device, which comprises:
the buffer module is used for storing the current TCP packet into a buffer chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations;
the processing module is used for sending a packet loss event to the service layer and extracting a first TCP packet in the cache chain table as a target TCP packet under the condition that the TCP packets cached in the cache chain table exceed the preset quantity;
and the sending module is used for sending the target TCP packet to a service layer for processing.
According to the invention, a TCP reorganizing device is provided, which further comprises:
the updating module is used for sending the current TCP packet to a service layer for processing and updating expectations under the condition that the sequence of the current TCP packet meets the expected sequence;
the detection module is used for detecting whether the sequence of the first TCP packet in the cache chain table meets the updated expectation;
and the calculation module is used for sending the first TCP packet in the cache chain table as a target TCP packet to a service layer for processing when the sequence of the first TCP packet in the cache chain table meets the updated expectation.
The invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of any one of the TCP reassembly methods described above when executing the program.
The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of a TCP reassembly method as described in any one of the above.
According to the TCP reorganization method, the device, the electronic equipment and the storage medium, the current TCP packets which do not meet the requirements are stored in the cache chain table, the total number stored in the cache chain table is detected every time, under the condition that the number of the TCP packets cached in the cache chain table is found to exceed the preset number, the TCP packets cannot be cached continuously, at the moment, a packet loss event is sent to the service layer, the service layer determines whether to discard the data which are currently processed, and the first TCP packet in the cache chain table is extracted continuously and sent to the service layer for processing, so that the range of influence of packet loss on service processing can be reduced as far as possible.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a TCP reassembly method provided by the present invention;
fig. 2 is a flow chart corresponding to the TCP packet reassembly provided by the invention;
FIG. 3 is a schematic diagram of a timing detection flow provided by the present invention;
FIG. 4 is a schematic diagram of a TCP reassembly apparatus provided by the present invention;
fig. 5 is a schematic diagram of an entity structure of an electronic device according to the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The TCP reassembly method of the present invention is described below in conjunction with FIGS. 1-3.
Fig. 1 is a flow chart of a TCP reassembly method provided by the present invention, as shown in fig. 1, including:
step S1, storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations;
specifically, the current TCP packet described in the present invention specifically refers to a TCP packet generated in the mirroring process, that is, a TCP packet of network mirroring data.
When a new TCP packet is received, the packet is used as a current TCP packet, the source address and the destination address of the current TCP packet are sequenced and then are simply hashed to obtain the unique identifier of the connection, the unique identifier of the connection is used for searching the service processing object of the connection, and the flow direction of the current TCP packet is calculated to obtain the corresponding cache linked list and the expected seq.
Assuming that the two addresses of the interaction are A, B, the processing object of each service has an a- > B buffer TCP packet linked list, a B- > a buffer TCP packet linked list, and a respective expected seq.
When the sequence of the current TCP packet does not meet the expected seq, the condition that the packet is lost currently is indicated, and in order to avoid the current packet loss and influence the processing of subsequent data, the sequence of the TCP packet is firstly stored in a buffer chain table in sequence, and the TCP packet stored in the buffer chain table can be issued to a service layer for continuous processing after the packet loss problem is solved, so that the service blocking is effectively avoided.
Step S2, under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet;
in the invention, after TCP packets are stored in the cache chain table each time, whether the stored TCP packets in the cache chain table exceed the preset number is detected, so that the situation that a large amount of service data are lost because the cache cannot be continuously carried out after the cache chain table is full is avoided.
When the invention detects that the TCP packets cached in the cache chain table exceeds the preset quantity, the cache chain table is not suitable for continuing to store the TCP packets, and a packet loss event can be sent to the service layer under the condition that the packet loss event is not solved, so that the service layer judges whether the data need to be discarded.
Meanwhile, after the item service layer sends a packet loss event, the method can be equivalent to solving the problem that the sequence of the original current TCP packet does not meet the expected packet loss event, and extracting the first TCP packet in the cache chain table as a target TCP packet, namely processing the data in the cache chain table, thereby effectively avoiding service blocking.
And step S3, the target TCP packet is sent to a service layer for processing.
The first TCP packet in the cache chain table is extracted to be used as a target TCP packet; the target TCP packet is sent to a service layer for processing, so that the problem of TCP packet loss is solved, and then service processing is continued, thereby avoiding continuous service blocking caused by TCP packet loss.
The invention stores the current TCP packets which do not meet the requirements into the cache linked list, and detects the total number stored in the cache linked list every time, when the number of the TCP packets cached in the cache linked list is found to exceed the preset number, the TCP packets cannot be cached continuously, a packet loss event is sent to the service layer, the service layer determines whether to discard the data which are currently processed, and the first TCP packet in the cache linked list is extracted continuously and sent to the service layer for processing, so that the range of influence of packet loss on service processing can be reduced as much as possible.
In another embodiment, the method further comprises:
under the condition that the sequence of the current TCP packet meets the expectations, sending the current TCP packet to a service layer for processing, and updating expectations;
detecting whether the sequence of the first TCP packet in the cache linked list meets the updated expectations or not;
and when the sequence of the first TCP packet in the cache linked list meets the updated expectation, sending the first TCP packet in the cache linked list as a target TCP packet to a service layer for processing.
Specifically, if the sequence of the current TCP packet meets the expectations, that is, if the packet loss has not occurred at present, the next processing is continued.
The updating of the expectations described in the present invention refers in particular to the current seq+ data length. If the syn flag is set, an additional 1 is required.
After the expectation is updated each time, the method and the system can detect whether the sequence of the first TCP packet in the cache chain table meets the new expectation, can effectively ensure that the TCP packet in the cache chain table is missed, and ensure that the service is normally carried out.
The first TCP packet in the cache chain table is extracted to be used as a target TCP packet; the target TCP packet is sent to a service layer for processing, so that the problem of TCP packet loss is solved, and then service processing is continued, thereby avoiding continuous service blocking caused by TCP packet loss.
The invention detects whether the sequence of the first TCP packet in the cache chain table meets the updated expectation or not after updating the expectation, thereby ensuring that the TCP packet in the cache chain table can be normally issued after solving the packet loss problem, and ensuring that the service is normally carried out.
In another embodiment, after detecting whether the sequence of the first TCP packet in the cache link table meets the updated expected step, the method further comprises:
when the first TCP packet in the cache chain table does not meet the updated expectations, detecting whether the number of TCP packets in the cache chain table exceeds a preset number;
under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, sending a packet loss event to a service layer, and extracting the first TCP packet in the cache chain table as a target TCP packet;
and sending the target TCP packet to a service layer for processing.
Specifically, when the first TCP packet in the cache chain table does not meet the updated expectations, it is indicated that the TCP packet in the cache chain table still cannot be issued at this time, and whether the number of TCP packets in the cache chain table exceeds the preset number is detected.
When the invention detects that the TCP packets cached in the cache chain table exceeds the preset quantity, the cache chain table is not suitable for continuing to store the TCP packets, and the service layer can send a packet loss event under the condition that the packet loss event is not solved, so that the service layer judges whether the data need to be discarded.
In another embodiment, the method further comprises:
triggering timing detection at preset time intervals to acquire a cache chain table at the current moment;
traversing a buffer chain table at the current moment, and detecting whether a first TCP packet in the buffer chain table of the connection is overtime or not when an un-traversed connection exists in the buffer chain table at the current moment;
if the first TCP packet in the connected cache chain table is overtime, a packet loss event is sent to a service layer;
and sending the first TCP packet in the connected cache chain table to a service layer for processing.
Specifically, the preset time interval in the present invention may be preset as required, for example, 10s or 15s triggers a timing monitor.
The timing monitoring in the invention means that each preset time detection is automatically performed in the following detection process.
The buffer linked list at the current time described in the present invention may specifically refer to a buffer linked list triggering timing detection time.
The method and the device for detecting the first TCP packet in the buffer chain table of the connection detect whether the time of the first TCP packet exceeds the preset time under the condition of keeping the connection, and judge that the first TCP packet is lost if the buffered TCP packet exceeds the preset time and is not sent to a service layer for processing, so that the situation that the service is blocked due to the fact that the packetized TCP packet cannot be carried out for a long time can be effectively avoided.
The step of traversing the buffer chain table at the current moment refers to the step of analyzing each connection in the buffer chain table according to the steps.
The invention carries out timing detection through each preset time and judges whether the first TCP packet in each connected cache chain table is overtime, thereby avoiding the situation that when the connection is accidentally disconnected or the packet of which the connection is disconnected is lost, the part of the cached memory can not be released forever and the memory is leaked.
In another embodiment, after the step of sending the packet loss event to the service layer, the method further includes:
deleting the first TCP packet in the connected cache linked list to obtain an updated cache linked list;
calculating the next expected of the current expected to obtain an updated expected;
and when the first TCP packet in the updated cache linked list does not accord with the updated expectation, continuing to traverse the cache linked list at the current moment.
The first TCP packet in the connected cache chain table is deleted in the invention because the first TCP packet is issued to the service layer before, and the related data in the cache chain table should be deleted at this time, thereby realizing the update of the first TCP packet in the cache chain table.
Also, since the first TCP packet has been delivered to the service layer before, a corresponding update of the expected packet is also required, resulting in an updated expected packet.
When the first TCP packet in the updated cache chain table does not accord with the updated expectation, the fact that the TCP packet in the cache chain table still cannot be issued at the moment is indicated, and the cache chain table at the current moment is continuously traversed.
When the first TCP packet in the updated cache chain table accords with the updated expectation, the first TCP packet in the updated cache chain table is sent to a service layer for processing;
deleting the first TCP packet in the updated cache linked list to obtain a target cache linked list, and continuously updating the updated expectation to obtain a target expectation.
The invention stores the current TCP packets which do not meet the requirements into the cache linked list, and detects the total number stored in the cache linked list every time, when the number of the TCP packets cached in the cache linked list is found to exceed the preset number, the TCP packets cannot be cached continuously, a packet loss event is sent to the service layer, the service layer determines whether to discard the data which are currently processed, and the first TCP packet in the cache linked list is extracted continuously and sent to the service layer for processing, so that the range of influence of packet loss on service processing can be reduced as much as possible.
In the above embodiment, the timeout time of TCP reassembly and the buffer packet size of each TCP connection may be extracted as a configuration, and when any one of them satisfies a condition, a packet loss event is triggered. Thus, reasonable values can be prepared according to the physical machine configuration (mainly the memory size) of actual deployment and the service requirement.
Given the limitation of the timeout, if the packet is lost, the memory may be violently protected by too fast a transmission speed. If there is only a cache packet size limitation, when a connection is accidentally broken or a broken packet (a packet containing the fin flag) is lost, the portion of the cache memory will never be released, resulting in a memory leak.
When the seq of the received TCP packet is not expected, it is cached in a doubly linked list. Starting from the tail of the linked list, it is determined whether the just received TCP packet is behind the packet in the linked list. Since TCP packets are in most cases sequential, most only one comparison is needed. The problem of seq wrap-around also needs to be considered when comparing the order of two TCP packets.
If seq2 is after seq1, then the right condition (c code) is satisfied: (s 32) ((u 32) seq2- (u 32) seq 1) >0
Why a simple row can determine the woolen cloth. The following scenarios were analyzed:
1. no wrap-around occurs, assuming that seq1=0x01, seq2=0x80000000, seq2-seq1=0x7fffff, the final result is strongly converted into 32 bits signed, the result is positive, the condition is satisfied, the order is seq1→seq2, and the same as the actual one.
2. No wrap-around occurs, assuming that seq1=0x01, seq2=0x80000001, seq2-seq1=0x80000000, the final result is strongly turned to 32 bits signed, the highest bit is located 1 at this time, and the negative condition is not satisfied, so the order is seq2- > seq1, which is actually inconsistent.
3. Wrapping occurs assuming seq1=0xffffffff, seq2=0x01. seq2-seq 1=2, since the computation overflows and the final condition holds, the order is seq1- > seq2, consistent with reality.
4. Wrapping occurs assuming seq1=0xffffffff, seq2=0x 80000000.seq2-seq 1=0x80000001, the final result is strongly converted into 32 bits with sign, the highest position is 1 at this time, and the negative condition is not satisfied, so the sequence is seq2- > seq1, which is inconsistent with reality.
From the above scene analysis, the premise of using the above judgment is that the increment after wrapping is smaller than 2 (32-1) -1, so that data of near 2G can be supported, but the buffer size of the actual single connection is not so large, so that the use requirement can be met.
In another embodiment, fig. 2 is a flow chart corresponding to the TCP packet reassembly provided in the present invention, as shown in fig. 2, first, a new TCP packet is received, and the new TCP packet is taken as the currently processed TCP packet. And sorting the source address and the destination address of the current TCP packet, performing simple hash to obtain the unique identifier of the connection, namely using the network quadruple as a key, searching the service processing object of the connection by using the unique identifier of the connection, calculating the flow direction of the current TCP packet, obtaining a corresponding cache linked list and an expected seq, if not, creating, and initializing the expected seq to be 0. Assuming that the two addresses of the interaction are A, B, the processing object of each service has an a- > B buffer TCP packet linked list, a B- > a buffer TCP packet linked list, and a respective expected seq.
It is then determined whether the currently processed TCP packet is the expected seq. The judging method comprises the following steps: the seq of the current TCP packet is calculated, and whether the current seq is equal to the next expected seq or whether the next expected seq is 0 is judged. Since it is a packet on the direct mirror network, it is likely that the access packet will begin halfway, so the first TCP packet is the first packet directly.
If the expected seq packet is the expected one, the current TCP packet is issued to the business layer for processing, and the next expected seq of the TCP packet is calculated. The next expected seq is calculated as the current seq+data length. If the syn flag is set, 1 is additionally needed; the currently processed TCP packets are stored in the linked list in the order desired by the seq. The seq wrap scene needs to be considered in the ordering process. It is checked whether the first TCP packet seq in the buffer chain table corresponding to the connection is expected.
And if the first TCP packet seq in the buffer chain table corresponding to the connection is expected, taking the first TCP packet in the buffer chain table as the current processed packet, and removing the first TCP packet from the buffer chain table.
If the first TCP packet seq in the buffer chain table corresponding to the connection is not expected, judging whether the size of the current buffer packet exceeds the limit, returning to the step of taking the first TCP packet in the buffer chain table as the current processing packet if the size of the current buffer packet exceeds the limit, removing the first TCP packet from the buffer chain table, and ending the flow if the size of the current buffer packet does not exceed the limit.
If the first TCP packet seq in the buffer chain table corresponding to the connection is not expected, the packets are stored in the chain table according to the expected sequence of the seq, whether the size of the currently buffered packets exceeds the limit is continuously monitored, if yes, the step of taking the first TCP packet in the buffer chain table as the currently processed packet is returned, the first TCP packet is removed from the buffer chain table, and if not, the flow is ended.
Fig. 3 is a schematic diagram of a timing detection flow provided in the present invention, as shown in fig. 3, including: triggering timing detection, detecting whether non-traversed connection exists or not, and ending the flow if the non-traversed connection does not exist; if the connection which is not traversed exists, the current connection is removed, whether the first TCP packet cached by the current connection is overtime or not is detected, and if the first TCP packet cached by the current connection is detected not to be overtime, the operation of detecting whether the connection which is not traversed exists is returned to;
if the condition that the first TCP packet of the current connection buffer is overtime is detected, a packet loss message is issued to a service layer, the first TCP packet of the buffer is deleted, issued to the service layer, the next expected seq is calculated, then whether the first TCP packet of the buffer linked list matches the expected seq is detected, if the first TCP packet of the buffer linked list matches the expected seq, the first TCP packet of the buffer is returned to be deleted, issued to the service layer, and the next expected seq is calculated;
if the first TCP packet in the cache link table does not match the expected seq, then the operation is returned to detecting whether there is an un-traversed connection.
In another embodiment, assume that all packets are in the correct order of 1, 2, 3, 4, 5 … …
Example 1
It is assumed that packets coming over a TCP connection are sequentially 1, 3, 4, 2.
After receiving the packet 1, the connection finds that the connection receives the packet for the first time and immediately transmits the packet to the service layer, at this time, the buffer chain table is empty, and the number of the next expected packet is 2.
After receiving the packet 3, if the packet is found to be not matched with the expected packet 2, the packet is cached, and the cache chain table is 3.
After receiving the packet number 4, if the packet is found to be not matched with the expected packet number 2, the packet is cached, and at the moment, the cache linked list is 3 and 4.
After receiving the number 2 packet, finding out that the number 2 packet is matched with the expected packet 2, immediately issuing the number 2 packet to a service layer, and calculating the next expected packet. And the number is 3, then the packet is matched with the first packet 3 of the cache chain table, the packet 3 is immediately issued to the service layer, the first packet (number 3) of the cache chain table is deleted, the next expected packet is calculated to be 4, then the packet 4 is immediately issued to the service layer, the first packet (number 4) of the cache chain table is deleted, the next expected packet is calculated to be 5, and at the moment, the cache is empty and the process is ended.
Example 2
Suppose that the packets coming over a TCP connection are in turn 3,5,6,7, … … 100000.
After receiving the number 3 packet, the connection finds that the connection receives the packet for the first time and immediately transmits the packet to the service layer, at this time, the buffer chain table is empty, and the number of the next expected packet is 4.
After receiving the packet number 5, if the packet is found to be not matched with the expected packet number 4, the packet is cached, and the cache chain table is 5.
After receiving the packet number 6, if the packet number 6 is found to be not matched with the expected packet number 4, the packet is cached, and at the moment, the cache linked list is 5 and 6.
……
After receiving the 999 # packet, finding out that the packet is not matched with the expected packet 4, judging that the total size of the buffered packet exceeds a threshold value at the moment, firstly issuing a packet loss message to a service layer, then forcibly issuing the first packet (No. 5) in the buffered packet, then circularly calculating and judging whether the packet in the linked list accords with the expected packet and issuing, and finally issuing all the packets to the service layer.
Example 3
It is assumed that packets coming over a TCP connection are 5,7,8 in turn, always connected and no longer sent.
After receiving the number 5 packet, the connection finds that the connection receives the packet for the first time and immediately transmits the packet to the service layer, at this time, the buffer chain table is empty, and the number of the next expected packet is 6.
After receiving the packet number 7, if the packet number 7 is found to be not matched with the expected packet number 6, the packet is cached, and the cache chain table is 7.
After receiving the packet number 8, if the packet number 8 is found to be not matched with the expected packet number 6, the packet is cached, and at the moment, the cache linked lists are 7 and 8.
……
After a period of time, triggering overtime, transmitting a packet loss message to a service layer, then forcibly transmitting the first packet (No. 7) in the buffer memory, and then circularly calculating and judging whether the packet in the linked list accords with expectations and transmitting.
This example requires that the connection be maintained at all times because disconnection triggers the transmission of the fin flag, and upon receipt of the fin packet, it is necessary to trigger the packet loss message determination immediately and force transmission of all packets in the buffer.
The TCP reassembly apparatus provided by the present invention will be described below, and the TCP reassembly apparatus described below and the TCP reassembly method described above may be referred to correspondingly.
Fig. 4 is a schematic diagram of a TCP reassembly apparatus provided by the present invention, as shown in fig. 4, including: a buffering module 410, a processing module 420 and a sending module 430; the buffer module 410 is configured to store the current TCP packet into the buffer chain table according to the sequence order of the current TCP packet when the sequence of the current TCP packet does not meet the expectations; the processing module 420 is configured to send a packet loss event to the service layer and extract a first TCP packet in the buffer chain table as a target TCP packet when the number of the buffered TCP packets in the buffer chain table exceeds a preset number; the sending module 430 is configured to send the target TCP packet to a service layer for processing.
The apparatus further comprises: the updating module is used for sending the current TCP packet to a service layer for processing and updating expectations under the condition that the sequence of the current TCP packet meets the expected sequence; the detection module is used for detecting whether the sequence of the first TCP packet in the cache chain table meets the updated expectation; and the calculation module is used for sending the first TCP packet in the cache chain table as a target TCP packet to a service layer for processing when the sequence of the first TCP packet in the cache chain table meets the updated expectation.
The detection module is also used for: when the first TCP packet in the cache chain table does not meet the updated expectations, detecting whether the number of TCP packets in the cache chain table exceeds a preset number; under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, sending a packet loss event to a service layer, and extracting the first TCP packet in the cache chain table as a target TCP packet; and sending the target TCP packet to a service layer for processing.
The device also comprises a timing monitoring module, wherein the timing monitoring module is used for triggering timing detection at intervals of preset time to acquire a cache linked list at the current moment;
traversing a buffer chain table at the current moment, and detecting whether a first TCP packet in the buffer chain table of the connection is overtime or not when an un-traversed connection exists in the buffer chain table at the current moment;
if the first TCP packet in the connected cache chain table is overtime, a packet loss event is sent to a service layer;
and sending the first TCP packet in the connected cache chain table to a service layer for processing.
The timing monitoring module is also used for calculating the next expected of the current expected to obtain the updated expected;
and when the first TCP packet in the updated cache linked list does not accord with the updated expectation, continuing to traverse the cache linked list at the current moment.
When the first TCP packet in the updated cache chain table accords with the updated expectation, the first TCP packet in the updated cache chain table is sent to a service layer for processing;
deleting the first TCP packet in the updated cache linked list to obtain a target cache linked list, and continuously updating the updated expectation to obtain a target expectation.
The invention stores the current TCP packets which do not meet the requirements into the cache linked list, and detects the total number stored in the cache linked list every time, when the number of the TCP packets cached in the cache linked list is found to exceed the preset number, the TCP packets cannot be cached continuously, a packet loss event is sent to the service layer, the service layer determines whether to discard the data which are currently processed, and the first TCP packet in the cache linked list is extracted continuously and sent to the service layer for processing, so that the range of influence of packet loss on service processing can be reduced as much as possible.
Fig. 5 is a schematic diagram of an entity structure of an electronic device according to the present invention, as shown in fig. 5, the electronic device may include: processor 510, communication interface (Communications Interface) 520, memory 530, and communication bus 540, wherein processor 510, communication interface 520, memory 530 complete communication with each other through communication bus 540. Processor 510 may invoke logic instructions in memory 530 to perform a TCP reassembly method comprising: storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations; under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet; and sending the target TCP packet to a service layer for processing.
Further, the logic instructions in the memory 530 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the method of TCP reassembly provided by the methods described above, the method comprising: storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations; under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet; and sending the target TCP packet to a service layer for processing.
In yet another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the TCP reassembly method provided by the above embodiments, the method comprising: storing the current TCP packet into a cache chain table according to the sequence order of the current TCP packet under the condition that the sequence of the current TCP packet does not meet the expectations; under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet; and sending the target TCP packet to a service layer for processing.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A method of TCP reassembly comprising:
under the condition that the sequence of the current TCP packet does not meet the expectations, carrying out hash according to the source address and the target address of the current TCP packet to obtain an identification, calculating according to the identification to obtain a cache linked list and the current expectations of the current TCP packet, and storing the current TCP packet into the cache linked list according to the sequence of the current TCP packet;
under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, a packet loss event is sent to a service layer, and the first TCP packet in the cache chain table is extracted and used as a target TCP packet;
sending the target TCP packet to a service layer for processing;
and the method further comprises: when the sequence of the current TCP packet meets the expectations, sending the current TCP packet to a service layer for processing, and updating the expectations of the current TCP packet;
wherein updating the expectations of the current TCP packet includes:
acquiring the data length of the current TCP packet, and determining whether a syn flag is set;
if the syn flag is not set, adding the data length to the current expected value of the current TCP packet to obtain the updated expected value of the current TCP packet;
and if the syn flag is set, adding the data length to the current expected value of the current TCP packet, and adding one to the added result to obtain the updated expected value of the current TCP packet.
2. The TCP reassembly method of claim 1, further comprising:
under the condition that the sequence of the current TCP packet meets the expectations, sending the current TCP packet to a service layer for processing, and updating expectations;
detecting whether the sequence of the first TCP packet in the cache linked list meets the updated expectations or not;
and when the sequence of the first TCP packet in the cache linked list meets the updated expectation, sending the first TCP packet in the cache linked list as a target TCP packet to a service layer for processing.
3. The TCP reassembly method of claim 2, wherein after the step of detecting whether the sequence of the first TCP packet in the buffer chain table meets the updated expectations, the method further comprises:
when the first TCP packet in the cache chain table does not meet the updated expectations, detecting whether the number of TCP packets in the cache chain table exceeds a preset number;
under the condition that the cached TCP packets in the cache chain table exceed the preset quantity, sending a packet loss event to a service layer, and extracting the first TCP packet in the cache chain table as a target TCP packet;
and sending the target TCP packet to a service layer for processing.
4. The TCP reassembly method of claim 1, further comprising:
triggering timing detection at preset time intervals to acquire a cache chain table at the current moment;
traversing a buffer chain table at the current moment, and detecting whether a first TCP packet in the buffer chain table of the connection is overtime or not when an un-traversed connection exists in the buffer chain table at the current moment;
if the first TCP packet in the connected cache chain table is overtime, a packet loss event is sent to a service layer;
and sending the first TCP packet in the connected cache chain table to a service layer for processing.
5. The TCP reassembly method of claim 4, wherein after said step of sending said packet loss event to the traffic layer, said method further comprises:
deleting the first TCP packet in the connected cache linked list to obtain an updated cache linked list;
calculating the next expected of the current expected to obtain an updated expected;
and when the first TCP packet in the updated cache linked list does not accord with the updated expectation, continuing to traverse the cache linked list at the current moment.
6. The TCP reassembly method of claim 5, wherein after said step of calculating a next expected current, updated expected, the method further comprises:
when the first TCP packet in the updated cache chain table accords with the updated expectation, the first TCP packet in the updated cache chain table is sent to a service layer for processing;
deleting the first TCP packet in the updated cache linked list to obtain a target cache linked list, and continuously updating the updated expectation to obtain a target expectation.
7. A TCP reassembly apparatus, comprising:
the buffer module is used for carrying out hash according to the source address and the target address of the current TCP packet to obtain an identification under the condition that the sequence of the current TCP packet does not meet the expectations, calculating a buffer linked list and the current expectations of the current TCP packet according to the identification, and storing the current TCP packet into the buffer linked list according to the sequence of the current TCP packet;
the processing module is used for sending a packet loss event to the service layer and extracting a first TCP packet in the cache chain table as a target TCP packet under the condition that the TCP packets cached in the cache chain table exceed the preset quantity;
the sending module is used for sending the target TCP packet to a service layer for processing;
and the cache module is further configured to: when the sequence of the current TCP packet meets the expectations, sending the current TCP packet to a service layer for processing, and updating the expectations of the current TCP packet;
wherein updating the expectations of the current TCP packet includes:
acquiring the data length of the current TCP packet, and determining whether a syn flag is set;
if the syn flag is not set, adding the data length to the current expected value of the current TCP packet to obtain the updated expected value of the current TCP packet;
and if the syn flag is set, adding the data length to the current expected value of the current TCP packet, and adding one to the added result to obtain the updated expected value of the current TCP packet.
8. The TCP reassembly device of claim 7, further comprising:
the updating module is used for sending the current TCP packet to a service layer for processing and updating expectations under the condition that the sequence of the current TCP packet meets the expected sequence;
the detection module is used for detecting whether the sequence of the first TCP packet in the cache chain table meets the updated expectation;
and the calculation module is used for sending the first TCP packet in the cache chain table as a target TCP packet to a service layer for processing when the sequence of the first TCP packet in the cache chain table meets the updated expectation.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the TCP reassembly method according to any one of claims 1 to 6 when the program is executed by the processor.
10. A non-transitory computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when executed by a processor, implements the steps of the TCP reassembly method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011337249.3A CN112491871B (en) | 2020-11-25 | 2020-11-25 | TCP reorganization method, TCP reorganization device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011337249.3A CN112491871B (en) | 2020-11-25 | 2020-11-25 | TCP reorganization method, TCP reorganization device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112491871A CN112491871A (en) | 2021-03-12 |
| CN112491871B true CN112491871B (en) | 2023-07-28 |
Family
ID=74934569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011337249.3A Active CN112491871B (en) | 2020-11-25 | 2020-11-25 | TCP reorganization method, TCP reorganization device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112491871B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113364862B (en) * | 2021-06-03 | 2022-10-11 | 上海天旦网络科技发展有限公司 | Packet decoding system and method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2012186780A (en) * | 2011-02-17 | 2012-09-27 | Nippon Telegr & Teleph Corp <Ntt> | Packet loss rate estimation device and method and program |
| CN103179039A (en) * | 2012-10-25 | 2013-06-26 | 四川省电力公司信息通信公司 | Method for effectively filtering normal network data package |
| JP2013179486A (en) * | 2012-02-28 | 2013-09-09 | Nippon Telegr & Teleph Corp <Ntt> | Packet monitoring device, packet monitoring method, and packet monitoring system |
| CN105337892A (en) * | 2014-08-15 | 2016-02-17 | 深圳市中兴微电子技术有限公司 | Data processing method and data processing device |
| WO2018041043A1 (en) * | 2016-08-29 | 2018-03-08 | 烽火通信科技股份有限公司 | Streaming media-based system and method for second retransmission of lost packet |
| CN107786472A (en) * | 2017-10-31 | 2018-03-09 | 北京亚鸿世纪科技发展有限公司 | A kind of efficient tcp session reconstruction units |
| CN111385068A (en) * | 2018-12-29 | 2020-07-07 | 阿里巴巴集团控股有限公司 | Data transmission method and device, electronic equipment and communication system |
| CN111930740A (en) * | 2020-06-28 | 2020-11-13 | 腾讯科技(成都)有限公司 | Game data processing method and device, server and storage medium |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7257840B2 (en) * | 2004-01-16 | 2007-08-14 | Cisco Technology, Inc. | Preventing network data injection attacks using duplicate-ACK and reassembly gap approaches |
| US7382733B2 (en) * | 2004-02-12 | 2008-06-03 | International Business Machines Corporation | Method for handling reordered data packets |
| CN101123580A (en) * | 2007-09-11 | 2008-02-13 | 华为技术有限公司 | Packet transmission method and base station device |
| CN102891883B (en) * | 2007-12-27 | 2014-12-31 | 华为技术有限公司 | Wireless transmission control protocol processing method and equipment |
| CN101547473A (en) * | 2009-03-24 | 2009-09-30 | 中兴通讯股份有限公司 | Method for discarding service data unit (SDU) of link layer in TD-SCDMA system |
| CN103166912B (en) * | 2011-12-09 | 2016-08-10 | 华为技术有限公司 | The transmission method of a kind of packet, system |
| CN102823207A (en) * | 2012-05-18 | 2012-12-12 | 华为技术有限公司 | Method and device for forwarding data packet |
| WO2016095198A1 (en) * | 2014-12-19 | 2016-06-23 | 华为技术有限公司 | Apparatus, system and method for preventing tcp connection interruption |
| CN105045723A (en) * | 2015-06-26 | 2015-11-11 | 深圳市腾讯计算机系统有限公司 | Processing method, apparatus and system for cached data |
| CN108206787A (en) * | 2016-12-17 | 2018-06-26 | 北京华为数字技术有限公司 | A kind of congestion-preventing approach and device |
| CN108632177A (en) * | 2017-03-24 | 2018-10-09 | 中兴通讯股份有限公司 | A kind of transmission method and electronic equipment of control packet |
| CN108667755B (en) * | 2017-03-27 | 2021-10-22 | 中兴通讯股份有限公司 | Message fragment storage and reassembly method and device |
| CN108174008A (en) * | 2017-12-22 | 2018-06-15 | 天津七二通信广播股份有限公司 | A kind of voice packet storage method for communication speech Transmission system |
| CN109818884A (en) * | 2019-02-01 | 2019-05-28 | 深圳市比速智网技术有限公司 | Multilink data transmission method, sending device, reception device and storage medium |
-
2020
- 2020-11-25 CN CN202011337249.3A patent/CN112491871B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2012186780A (en) * | 2011-02-17 | 2012-09-27 | Nippon Telegr & Teleph Corp <Ntt> | Packet loss rate estimation device and method and program |
| JP2013179486A (en) * | 2012-02-28 | 2013-09-09 | Nippon Telegr & Teleph Corp <Ntt> | Packet monitoring device, packet monitoring method, and packet monitoring system |
| CN103179039A (en) * | 2012-10-25 | 2013-06-26 | 四川省电力公司信息通信公司 | Method for effectively filtering normal network data package |
| CN105337892A (en) * | 2014-08-15 | 2016-02-17 | 深圳市中兴微电子技术有限公司 | Data processing method and data processing device |
| WO2018041043A1 (en) * | 2016-08-29 | 2018-03-08 | 烽火通信科技股份有限公司 | Streaming media-based system and method for second retransmission of lost packet |
| CN107786472A (en) * | 2017-10-31 | 2018-03-09 | 北京亚鸿世纪科技发展有限公司 | A kind of efficient tcp session reconstruction units |
| CN111385068A (en) * | 2018-12-29 | 2020-07-07 | 阿里巴巴集团控股有限公司 | Data transmission method and device, electronic equipment and communication system |
| CN111930740A (en) * | 2020-06-28 | 2020-11-13 | 腾讯科技(成都)有限公司 | Game data processing method and device, server and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112491871A (en) | 2021-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1968074B (en) | Network flow/stream simulation method | |
| US7180896B1 (en) | Method and system for packet retransmission | |
| CN102890631B (en) | Method based on persistent message queue transmission message and massage transmission device | |
| CN113055127B (en) | Data message duplicate removal and transmission method, electronic equipment and storage medium | |
| CN107454276B (en) | User terminal equipment, data forwarding method thereof and communication system | |
| CN111314358B (en) | Attack protection method, device, system, computer storage medium and electronic equipment | |
| CN108183893B (en) | Fragment packet detection method, detection device, storage medium and electronic equipment | |
| CN110519377B (en) | Communication data transmission method and device | |
| WO2005072118B1 (en) | Preventing network data injection attacks using duplicate-ack and reassembly gap approaches | |
| CN108234087B (en) | Data transmission method and sending end | |
| CN113765626B (en) | Data transmission method and device of mobile communication system | |
| KR101086397B1 (en) | IP packet error handling apparatus and method using the same, and computer readable medium on which program executing the method is recorded | |
| CN109981629A (en) | Antivirus protection method, apparatus, equipment and storage medium | |
| CN109257143A (en) | Method for there is sliced transmission data packet in the network transmission protocol of length limitation | |
| CN112491871B (en) | TCP reorganization method, TCP reorganization device, electronic equipment and storage medium | |
| US10680922B2 (en) | Communication control apparatus and communication control method | |
| CN113965482A (en) | Data transmission method and device based on gRPC and storage medium | |
| CN111107182B (en) | MAC address synchronization method, device, system, equipment and medium | |
| US10742602B2 (en) | Intrusion prevention | |
| CN110198290B (en) | Information processing method, equipment, device and storage medium | |
| CN116032649A (en) | Attack detection method, device, equipment and readable storage medium | |
| CN114244785B (en) | 5G data flow out-of-order processing method and device | |
| CN116155826A (en) | Message receiving and transmitting method, network equipment, system and storage medium | |
| CN109547389B (en) | Code stream file recombination method and device | |
| CN112511573B (en) | Transmission control method of UDP (user Datagram protocol) data packet |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |