CN107786472A - A kind of efficient tcp session reconstruction units - Google Patents
A kind of efficient tcp session reconstruction units Download PDFInfo
- Publication number
- CN107786472A CN107786472A CN201711052423.8A CN201711052423A CN107786472A CN 107786472 A CN107786472 A CN 107786472A CN 201711052423 A CN201711052423 A CN 201711052423A CN 107786472 A CN107786472 A CN 107786472A
- Authority
- CN
- China
- Prior art keywords
- data
- data block
- conversation
- session
- message
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9057—Arrangements for supporting packet reassembly or resequencing
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of efficient tcp session reconstruction units are related to areas of information technology, and the present invention is made up of data cache module and data reorganization module；Data cache module offsets logging modle by session enquiry module, conversation start, conversation end offsets logging modle, data block numbering calculates logging modle and B+ tree generation modules form；Compared with conventional Packet reassembling scheme, message is directly organized into orderly data structure by this programme by B+ trees, can ensure that also recombination efficiency will not be reduced because of frequently data search when out of order message is more, this innovatory algorithm can be obviously improved the efficiency and overall performance of the recombination system under the more scene of out of order message, this programme simplifies SEQ comparison flow and the regrouping process of TCP sessions simultaneously, TCP sessions regrouping process and software realization is become simple efficient.
Description
Technical field
The present invention relates to the communications processing field in areas of information technology, especially data communication field.
Background technology
ICP/IP protocol has widely been applied in Data Communication in Computer Networks now.Data use TCP/IP on network
It is transmitted when agreement is transmitted, it is necessary to which data are split into multiple messages.And network security, DPI data acquisitions,
The fields such as internet behavior audit can all use the recombinant technique of TCP sessions.Only by after data package-restructuring, could reduce once
Complete TCP sessions, to reach the purpose for obtaining network transmission true content.On the one hand, due to many reasons of network transmission,
One group of packet by network transmission to same destination when, different routed path can be passed through and reach same destination, by
Network quality in different paths is not quite identical, may result in up to destination one group of packet may order of occurrence change
Become.On the other hand, in transmitting procedure, because Transmission Control Protocol has retransmission mechanism, in data transfer, if there occurs certain
Individual message dropping or the excessive situation of transmission delay, then Transmission Control Protocol may require that this message retransmission, and can be caused by retransmitting by a certain group
Very serious order entanglement occurs when network delivery for orderly TCP message.The meeting of the problem of both the above message sequence entanglement
Have a strong impact on the success rate of TCP sessions restructuring and reduction.
Mentioned in Application No. CN201510705482.5 patent application document：When receiving TCP message, root
Session entry corresponding to the IP address included according to the TCP message and interface querying；According to the direction of the TCP message, institute
State the sequence number of TCP message and the sequence number of TCP message that the direction received in-order arrives, determine the classification of the TCP message；If
The TCP message is out of order message, then the TCP message is added to the out of order message chained list in the direction；If the TCP message
For order message, then judge in the out of order message chained list in the direction with the presence or absence of the chained list node matched with the TCP message；
If in the presence of the chained list node and the TCP message to be added to the order message chained list in the direction；Otherwise, the TCP is reported
Text adds the order message chained list in the direction.
The problem of Application No. CN201510705482.5 schemes is：It can be brought using the out of order node of storage of linked list out of order
Node checks task, in the case that out of order message is relatively more, there can be substantial amounts of out of order node traverses and search task, excessively
Traversal searches the efficiency that can have a strong impact on Packet reassembling.It can not fixed because of the size of message when being stored in addition to out of order message
And the problem of triggering complicated memory management efficiency and internal memory to hit, applying for the internal memory of excessive cause not of uniform size also easily causes
RAM fragmentation and reduce recombination efficiency.
For the low efficiency problem of TCP session regrouping process generally existings, this programme realizes a kind of simple efficient TCP
Message recombining method.By the way that TCP message to be organized into the data block of fixed size, tissue is then carried out with the structure type of B+ trees
Management, so as to improve the recombination efficiency of TCP sessions and success rate, realizes high performance TCP sessions reassembly algorithm and software
Module.
The content of the invention
Based on the deficiencies in the prior art the invention provides a kind of efficient tcp session reconstruction units, by data buffer storage mould
Block and data reorganization module composition；Data cache module offsets logging modle, conversation end by session enquiry module, conversation start
Offset logging modle, data block numbering calculates logging modle and B+ trees generation module composition；
The effect of session enquiry module is the IP address and interface querying included when receiving TCP message according to TCP message
Corresponding session entry；Session entry includes conversation start skew, conversation end skew, conversation end mark and storage number
According to the B+ tree constructions of block；
The effect of conversation start skew logging modle is when receiving the first packet of TCP message, according to the IP of TCP message and port
Information creating session entry, recording conversation start offset, terminate skew；The value of start offset is the SEQ values+1 of first packet, is terminated inclined
Shifting is initialized as identical with start offset；The basis for estimation of first packet is that type of message is SYN or SYN+ACK messages；
The effect of conversation end skew logging modle is when the TCP message received is last bag of this TCP message, more
End skew in new session information, terminates the SEQ values that deviant should be message；Simultaneous session terminates to offset logging modle in meeting
Talk about and conversation end mark is placed in list item；
Data block numbering calculate and the effect of logging modle be when receiving TCP message, according to the SEQ values of current TCP message,
The conversation start that is preserved in payload length, and session entry, terminate skew, calculate rising for current data packet corresponding data block
Begin skew, end skew and data block numbering；Starting, the computational methods of end deviant are：If the SEQ of current TCP message
Value is less than conversation start deviant, and then start offset should be the SEQ values of current TCP message and add the maximums of 32 signless integers
It is worth, otherwise start offset value should be the SEQ values of current TCP message, and end skew should be start offset value and add data packet length；
The effect of B+ tree generation modules is：
1. when receiving TCP message, the data block numbering of the TCP message received according to rigid connection, from B+ trees corresponding to lookup
Data block；
2. when the data block for the TCP message that rigid connection is received is not in B+ trees, request for data block internal memory, initialization data block number,
The data block for the TCP message that rigid connection is received is inserted into B+ trees as new request for data block；
3. when the data block for the TCP message that rigid connection is received is in B+ trees, the data block found in B+ trees is updated, specific side
Method is specified location of the data copy in the data block for the TCP message for receiving rigid connection to the data block found, and is updated the data
Block uses mark；
Data reorganization module is used for processing during TCP conversation ends, when detecting TCP conversation ends mark, will delay in B+ trees
The data of the ordered data block deposited are taken out, and carry out data recombination, the B+ trees in session entry need to be only traveled through during restructuring, by corresponding blocks
Data output in structure, when traveling through the B+ trees in session entry, it is inclined with conversation end need to only to verify conversation start skew
Data between shifting are using mark, if being marked as effectively, by the data output in corresponding block structure to complete session weight
Group, otherwise this session are considered as data incomplete session, abandon data recombination, then reclaim the memory block of this each node of B+ trees.
Present invention additionally comprises a kind of efficient tcp session recombination methods, by session cache step, data recombination step, number
Completed according to block number step；
（1）Session cache step
1）After receiving TCP message, the session entry information according to corresponding to going out IP and interface querying；
2）According to the SEQ values of current TCP message, the conversation start that is preserved in payload length, and session entry, terminate skew,
The start offset of current data packet corresponding data block is calculated, terminates skew and data block numbering；
Starting, the computational methods of end deviant are：The start offset if the SEQ values of current message are less than conversation start deviant
Maximum of the SEQ values plus 32 signless integers of current message is should be, otherwise start offset value should be the SEQ of current message
Value；End skew should be start offset value and add data packet length；
3）The data block information according to corresponding to data block numbering is searched in B+ trees；Data block information includes the starting of notebook data block
Skew, terminate skew, and the use state of notebook data block, the use state of notebook data block are a data in data block
Section, a byte information is represented with each, 1 is set to if the byte of corresponding data bit has been filled with, with represent with
Filling；
4）When can not find data block, then apply for new data block internal memory, initialization data block number, data block starting, terminate partially
Move, and be inserted into B+ trees；
Data block start offset is that data block numbering is multiplied by data block size, and end of data block skew adds for data block start offset
Upper data block size；
5）Data in the data for the data block that renewal is found and the data block newly inserted, synchronized update data block use mark
Note；
Specifically update method is：By the data copy of notebook data block corresponding data bag to the data storage position of data block to be updated
Put, and update the data block using mark, be 1 by corresponding data position mark；
（2）Data recombination step
1）TCP message is received from driving or other message capturing devices；
2）Judge whether message is up or downlink message first packet, if message is SYN or SYN+ACK messages, basis
The IP and port information of this message create session entry, and recording conversation start offset, end skew；
Start offset, the SEQ values+1 that the value for terminating to offset is first packet；
Session entry include session data process of caching needed for B+ tree constructions and, conversation start, terminate skew, conversation end
Mark；
Wherein B+ tree constructions will be numbered using data block and be used as KEY；
3）Whether the message for judging to receive is last bag of this session, if then updating the end skew in session information,
Terminate the SEQ values that deviant should be message；
Conversation end mark is put in session entry simultaneously；
4）Message data caching is performed to data message；
5）Conversation end mark is checked whether there is, data recombination is performed if having；
The B+ trees in session entry need to be only traveled through during restructuring, by the data output in corresponding block structure；
Use state mark in regrouping process in data block, is confirmed whether there is dropout of data block, according to the starting of session
Skew and the end for terminating skew confirmation recombination data；
Completion is recombinated if all data between having recombinated conversation start skew and having terminated to offset and no data lost block, it is no
Conversation failure is then represented, restructuring can not be completed, and abandon recombination data；
（3）Data block numbering step
1）Current offset is initialized as packet start offset value；
2）Data block fixed size value defined in start offset value divided by system is obtained into quotient, as current data offset numbers
According to block number；
3）End of data block deviant corresponding to current data block numbering<The end deviant of=packet represents current data
Bag belongs to more data blocks, and current offset is updated into end of data block deviant+1, iterates to calculate next data block
Numbering.
Beneficial effect
Compared with conventional Packet reassembling scheme, message is directly organized into orderly data structure by this programme by B+ trees, can
To ensure that also recombination efficiency will not be reduced because of frequently data search when out of order message is more, this innovatory algorithm
The efficiency and overall performance of the recombination system under the more scene of out of order message can be obviously improved, while this programme simplifies SEQ
Comparison flow and TCP sessions regrouping process, make TCP sessions regrouping process and software realize become it is simple efficiently.
Brief description of the drawings
Fig. 1 is the system architecture diagram of the present invention；
Fig. 2 is the flow chart of the session cache process of the present invention；
Fig. 3 is the data recombination overview flow chart of the present invention；
Fig. 4 is the data block numbering calculation flow chart of the present invention.
Embodiment
Embodiment one
A kind of efficient tcp session reconstruction units for realizing the present invention with reference to figure 1 include：Data cache module A and data recombination
Module B；Data cache module A offsets logging modle 12, conversation end skew record mould by session enquiry module 11, conversation start
Block 13, data block numbering calculates logging modle 14 and B+ trees generation module 15 forms；
The effect of session enquiry module 11 is the IP address and end included when receiving TCP message 10 according to TCP message 10
Session entry corresponding to mouth inquiry；Session entry include conversation start skew, conversation end skew, conversation end mark and
The B+ tree constructions of data storage block；
The effect of conversation start skew logging modle 12 is when receiving the first packet of TCP message 10, according to the IP of TCP message 10
Session entry is created with port information, recording conversation start offset, terminates skew；The value of start offset is the SEQ values+1 of first packet,
End skew is initialized as identical with start offset；The basis for estimation of first packet is that type of message is SYN or SYN+ACK messages；
Conversation end skew logging modle 13 effect be the TCP message 10 received be this TCP message 10 last
Bao Shi, the end skew in session information is updated, terminates the SEQ values that deviant should be message；Simultaneous session terminates skew record
Module places conversation end mark in session entry；
Data block numbering calculates and the effect of logging modle 14 is when receiving TCP message 10, according to current TCP message 10
SEQ values, the conversation start preserved in payload length, and session entry, terminate skew, calculate current data packet corresponding data
The start offset of block, terminate skew and data block numbering；Starting, the computational methods of end deviant are：If current TCP message
SEQ values be less than conversation start deviant then start offset should be the SEQ values of current TCP message 10 and add 32 signless integers
Maximum, otherwise start offset value should be the SEQ values of current TCP message 10, terminate skew and should be start offset value plus number
According to packet length；
The effect of B+ trees generation module 15 is：
1. when receiving TCP message 10, the data block numbering of the TCP message 10 received according to rigid connection, the lookup pair from B+ trees
The data block answered；
2. when the data block for the TCP message 10 that rigid connection is received is not in B+ trees, request for data block internal memory, initialization data block is compiled
Number, the data block for the TCP message 10 that rigid connection is received is inserted into B+ trees as new request for data block；
3. when the data block for the TCP message 10 that rigid connection is received is in B+ trees, the data block found in B+ trees is updated, specifically
Method is specified location of the data copy in the data block for the TCP message 10 for receiving rigid connection to the data block found, and is updated
Data block uses mark；
Data reorganization module B is used for processing during TCP conversation ends, when detecting TCP conversation ends mark, will delay in B+ trees
The data of the ordered data block deposited are taken out, and carry out data recombination, the B+ trees in session entry need to be only traveled through during restructuring, by corresponding blocks
Data output in structure, when traveling through the B+ trees in session entry, it is inclined with conversation end need to only to verify conversation start skew
Data between shifting are using mark, if being marked as effectively, by the data output in corresponding block structure to complete session weight
Group, otherwise this session are considered as data incomplete session, abandon data recombination, then reclaim the memory block of this each node of B+ trees.
Embodiment two
Referring to Fig. 3, the step of realizing the data recombination overall procedure of the present invention, is as follows：
Step 1：TCP message is received from driving or other message capturing devices；
Step 2：Judge whether message is up or downlink message first packet, if message is SYN or SYN+ACK messages,
Session entry, and recording conversation start offset, end skew are created according to the IP of this message and port information.Start offset, knot
The value of beam skew is the SEQ values+1 of first packet.Session entry include session data process of caching needed for B+ tree constructions and, session
Starting, terminate skew, conversation end mark.Wherein B+ tree constructions will be numbered using data block and be used as KEY；
Step 3：Whether the message for judging to receive is last bag of this session, if then updating the end in session information
Skew, terminate the SEQ values that deviant should be message.Conversation end mark is put in session entry simultaneously；
Step 4：Message data caching is performed to data message；
Step 5：Conversation end mark is checked whether there is, data recombination is performed if having.It need to only be traveled through during restructuring in session entry
B+ trees, by the data output in corresponding block structure.Use state mark in regrouping process in data block, confirms
Whether there is dropout of data block, according to the start offset of session and terminate to offset the end for confirming recombination data.If the meeting is recombinated
All data and no data lost block between words start offset and end skew then recombinate completion, otherwise represent conversation failure,
Restructuring can not be completed, and abandon recombination data.
Embodiment three
Referring to Fig. 2, realize the present invention session cache process flow the step of it is as follows：
Step 1：After receiving TCP message, the session entry information according to corresponding to going out IP and interface querying；
Step 2：According to the SEQ values of current message, the conversation start that is preserved in payload length, and session entry, terminate it is inclined
Move, calculate the start offset of current data packet corresponding data block, terminate skew and data block numbering；
Starting, the computational methods of end deviant are：The start offset if the SEQ values of current message are less than conversation start deviant
Maximum of the SEQ values plus 32 signless integers of current message is should be, otherwise start offset value should be the SEQ of current message
Value；End skew should be start offset value and add data packet length；The computational methods of data block numbering illustrate referring to accompanying drawing 4；
Step 3：
The data block information according to corresponding to data block numbering is searched in B+ trees.The starting that data block information includes notebook data block is inclined
Move, terminate skew, and the use state of notebook data block, the use state of notebook data block are a data segments in data block,
One byte information is represented with each, 1 is set to if the byte of corresponding data bit has been filled with, is filled out with representing
Fill；
Step 4：
If can not find data block, apply for new data block internal memory, initialization data block number, data block starting, terminate skew,
And it is inserted into B+ trees；
Data block start offset is that data block numbering is multiplied by data block size, and end of data block skew adds for data block start offset
Upper data block size；
Step 5：
The data for finding or newly inserting in data block are updated, synchronized update data block uses mark；
Specifically update method is：By the data copy of notebook data block corresponding data bag to the data storage position of data block to be updated
Put, and update the data block using mark, be 1 by corresponding data position.
Example IV
Referring to Fig. 4, the step of realizing the data block numbering calculation process of the present invention, is as follows：
Step 1：Current offset is initialized as packet start offset value；
Step 2：Data block fixed size value defined in start offset value divided by system is obtained into quotient, as current data
Offset data block number；
Step 3：If end of data block deviant corresponding to current data block numbering<The end deviant of=packet represents to work as
Preceding packet belongs to more data blocks, current offset is updated into end of data block deviant+1, iterative calculation is next
Data block is numbered.
Claims (1)
1. a kind of efficient tcp session reconstruction units, it is characterised in that be made up of data cache module and data reorganization module；Number
Logging modle is offset by session enquiry module, conversation start according to cache module, conversation end offsets logging modle, data block is numbered
Calculate logging modle and B+ trees generation module composition；
The effect of session enquiry module is the IP address and interface querying included when receiving TCP message according to TCP message
Corresponding session entry；Session entry includes conversation start skew, conversation end skew, conversation end mark and storage number
According to the B+ tree constructions of block；
The effect of conversation start skew logging modle is when receiving the first packet of TCP message, according to the IP of TCP message and port
Information creating session entry, recording conversation start offset, terminate skew；The value of start offset is the SEQ values+1 of first packet, is terminated inclined
Shifting is initialized as identical with start offset；The basis for estimation of first packet is that type of message is SYN or SYN+ACK messages；
The effect of conversation end skew logging modle is when the TCP message received is last bag of this TCP message, more
End skew in new session information, terminates the SEQ values that deviant should be message；Simultaneous session terminates to offset logging modle in meeting
Talk about and conversation end mark is placed in list item；
Data block numbering calculate and the effect of logging modle be when receiving TCP message, according to the SEQ values of current TCP message,
The conversation start that is preserved in payload length, and session entry, terminate skew, calculate rising for current data packet corresponding data block
Begin skew, end skew and data block numbering；Starting, the computational methods of end deviant are：If the SEQ of current TCP message
Value is less than conversation start deviant, and then start offset should be the SEQ values of current TCP message and add the maximums of 32 signless integers
It is worth, otherwise start offset value should be the SEQ values of current TCP message, and end skew should be start offset value and add data packet length；
The effect of B+ tree generation modules is：
1. when receiving TCP message, the data block numbering of the TCP message received according to rigid connection, from B+ trees corresponding to lookup
Data block；
2. when the data block for the TCP message that rigid connection is received is not in B+ trees, request for data block internal memory, initialization data block number,
The data block for the TCP message that rigid connection is received is inserted into B+ trees as new request for data block；
When the data block for the TCP message that rigid connection is received is in B+ trees, the data block found in B+ trees is updated, specific method is
Data copy in the data block for the TCP message that rigid connection is received and updates the data block and made to the specified location of the data block found
With mark；
Data reorganization module is used for processing during TCP conversation ends, when detecting TCP conversation ends mark, will delay in B+ trees
The data of the ordered data block deposited are taken out, and carry out data recombination, the B+ trees in session entry need to be only traveled through during restructuring, by corresponding blocks
Data output in structure, when traveling through the B+ trees in session entry, it is inclined with conversation end need to only to verify conversation start skew
Data between shifting are using mark, if being marked as effectively, by the data output in corresponding block structure to complete session weight
Group, otherwise this session are considered as data incomplete session, abandon data recombination, then reclaim the memory block of this each node of B+ trees.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711052423.8A CN107786472B (en) | 2017-10-31 | 2017-10-31 | Efficient tcp session reorganization device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711052423.8A CN107786472B (en) | 2017-10-31 | 2017-10-31 | Efficient tcp session reorganization device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107786472A true CN107786472A (en) | 2018-03-09 |
| CN107786472B CN107786472B (en) | 2020-03-31 |
Family
ID=61431645
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711052423.8A Active CN107786472B (en) | 2017-10-31 | 2017-10-31 | Efficient tcp session reorganization device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107786472B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112491871A (en) * | 2020-11-25 | 2021-03-12 | 北京宝兰德软件股份有限公司 | TCP (Transmission control protocol) recombination method and device, electronic equipment and storage medium |
| CN114244785A (en) * | 2021-12-20 | 2022-03-25 | 中国电信集团系统集成有限责任公司 | 5G data flow out-of-order processing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741473A (en) * | 2005-09-05 | 2006-03-01 | 北京启明星辰信息技术有限公司 | A network data packet availability deciding method and system |
| CN101567003A (en) * | 2009-05-27 | 2009-10-28 | 清华大学 | Method for managing and allocating resource in parallel file system |
| KR101701348B1 (en) * | 2016-04-08 | 2017-02-03 | 엠티디아이 주식회사 | Real-time data processing method and system therefor wireless remote control of the full automatic grinding machine |
| CN106850547A (en) * | 2016-12-15 | 2017-06-13 | 华北计算技术研究所（中国电子科技集团公司第十五研究所） | A kind of data restoration method and system based on http protocol |
-
2017
- 2017-10-31 CN CN201711052423.8A patent/CN107786472B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741473A (en) * | 2005-09-05 | 2006-03-01 | 北京启明星辰信息技术有限公司 | A network data packet availability deciding method and system |
| CN101567003A (en) * | 2009-05-27 | 2009-10-28 | 清华大学 | Method for managing and allocating resource in parallel file system |
| KR101701348B1 (en) * | 2016-04-08 | 2017-02-03 | 엠티디아이 주식회사 | Real-time data processing method and system therefor wireless remote control of the full automatic grinding machine |
| CN106850547A (en) * | 2016-12-15 | 2017-06-13 | 华北计算技术研究所（中国电子科技集团公司第十五研究所） | A kind of data restoration method and system based on http protocol |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112491871A (en) * | 2020-11-25 | 2021-03-12 | 北京宝兰德软件股份有限公司 | TCP (Transmission control protocol) recombination method and device, electronic equipment and storage medium |
| CN112491871B (en) * | 2020-11-25 | 2023-07-28 | 北京宝兰德软件股份有限公司 | TCP reorganization method, TCP reorganization device, electronic equipment and storage medium |
| CN114244785A (en) * | 2021-12-20 | 2022-03-25 | 中国电信集团系统集成有限责任公司 | 5G data flow out-of-order processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107786472B (en) | 2020-03-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104967502B (en) | Data transmission method for uplink and device, data receiver method and device | |
| CA2576038C (en) | System and method for higher throughput through a transportation network | |
| US7502860B1 (en) | Method and apparatus for client-side flow control in a transport protocol | |
| US7899056B2 (en) | Device and method for reducing overhead in a wireless network | |
| CN108881008A (en) | A kind of methods, devices and systems of data transmission | |
| Ghali et al. | Secure fragmentation for content-centric networks | |
| CN107547436A (en) | The coding and decoding method of transmission control protocol based on network code | |
| CN105610744A (en) | IP (Internet Protocol) message fragmenting and recombining method and device | |
| US20120300781A1 (en) | Packet Routing in a Network | |
| CN106331117A (en) | Data transmission method | |
| CN105635058B (en) | Go-between's processing method of TCP is directed under a kind of no-protocol mode stack | |
| CN104967498B (en) | A kind of satellite network data packet compressing transmission method based on history | |
| CN107786472A (en) | A kind of efficient tcp session reconstruction units | |
| CN107743102A (en) | A kind of efficient tcp session recombination methods | |
| CN106302213A (en) | A kind of method and device of data transmission | |
| Ahmad et al. | Enhancing fast TCP’s performance using single TCP connection for parallel traffic flows to prevent head-of-line blocking | |
| CN101827020A (en) | Method and system for speeding up built persistent connection without disconnection | |
| CN102427452A (en) | Synchronize (SYN) message transmitting method and device and network equipment | |
| Papadopoulos et al. | RFC 4944: per-hop fragmentation and reassembly issues | |
| CN114499777B (en) | Data transmission method for cluster unmanned system | |
| CN102714617B (en) | Connection establishment method, device and communication system | |
| CN106657322B (en) | A kind of method for transmitting deep space file based on the more session aggregation strategies of LTP | |
| CN106603202A (en) | Satellite link transmission method, system and gateway | |
| TWI752747B (en) | Multimedia and complete file parallel transmission method | |
| CN109005015B (en) | Laser microwave composite communication method for reducing laser communication error rate |
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 |