CN114629963B - Network protocol header compression method based on hierarchical clustering - Google Patents
Network protocol header compression method based on hierarchical clustering Download PDFInfo
- Publication number
- CN114629963B CN114629963B CN202210259671.4A CN202210259671A CN114629963B CN 114629963 B CN114629963 B CN 114629963B CN 202210259671 A CN202210259671 A CN 202210259671A CN 114629963 B CN114629963 B CN 114629963B
- Authority
- CN
- China
- Prior art keywords
- data
- network protocol
- protocol header
- byte
- flag
- 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/04—Protocols for data compression, e.g. ROHC
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/231—Hierarchical techniques, i.e. dividing or merging pattern sets so as to obtain a dendrogram
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a network protocol header compression method based on hierarchical clustering, which is used for solving the problem of narrow application range of the existing network protocol header compression method, and comprises the following implementation steps: (1) A sending end obtains a data set to be clustered and a data set to be compressed; (2) The method comprises the steps that a sending end performs hierarchical clustering on a data set to be clustered and obtains a clustering result; (3) The transmitting end transmits compression reference information (4) to the receiving end, and the transmitting end transmits data to the receiving end; (5) The receiving end receives the data and recovers the network protocol header information. The method for acquiring the compressible partial information in the network protocol header by adopting the hierarchical clustering method and compressing the network protocol header according to the compressible partial information in the acquired network protocol header can be suitable for most of the existing network protocol headers and unknown network protocols with a large amount of redundant information in the future, and has wide applicability.
Description
Technical Field
The invention belongs to the technical field of communication, and relates to a network protocol header compression method, in particular to a hierarchical clustering-based network protocol header compression method.
Background
With the development of wireless communication technology, more and more data is transmitted through a wireless channel, and the bandwidth of the wireless channel becomes the most precious resource in wireless communication. However, some information in the network protocol header is not known to the end application, so transmitting too long header information can reduce the payload utilization of the wireless channel, wasting bandwidth resources of the wireless channel. For example, a voice packet carried by the IP/UDP/RTP protocol contains, in addition to the link layer header, 20 bytes of IPv4 header, 8 bytes of UDP header and 12 bytes of RTP header for 40 bytes of header information, while the payload size depends on the speech coding algorithm used, and may be as low as 20 bytes, so the payload utilization is only 33%. Therefore, when the wireless transmission is carried out, if the network protocol header can be compressed and then transmitted, the effective load utilization rate of the wireless channel can be improved, precious bandwidth resources can be saved, and the transmission efficiency can be improved.
The basic idea of network protocol header compression is that a transmitting end firstly determines a compressible part in a network protocol header and transmits parameters of the compressible part to a receiving end; then, the transmitting end compresses the network protocol header of the subsequent data packet according to the compression parameters and then transmits the compressed network protocol header, and the receiving end receives the data and then decompresses the data according to the compression parameters so as to restore the header information again.
The commonly used network protocol header compression method is ROHC (Robust Header Compression), which mainly aims at formulating a compression method for a specific network protocol header, and currently compressible network protocols are RTP/UDP/IP protocol, TCP/IP protocol, UDP/IP protocol and ESP/IP protocol. The ROHC method requires that the positions and change rules of each field in a specific network protocol header are marked in advance according to a specified format, and then the network protocol header compression coding can be performed. If the method is applied to the compression of other network protocol headers, the protocol header identification work needs to be completed manually, so that the method is not easy to expand and deploy, and the application range of the method is greatly influenced.
In addition, there are some network protocol header compression methods, when the sender determines the compressible part in the network protocol header, only the positions of the fields in the network protocol header to be compressed need to be identified in advance according to a specified format, and no labeling of the change rule of each field is required, for example, the application published under the patent application number CN111641624a is named as "network protocol header compression method based on decision tree", and the method classifies the change features of the fields in the network protocol header by adopting a field change feature classification decision tree, and compresses the network protocol header according to the classification result of the fields in the network protocol header. Although the method can automatically analyze the change rule of each field in the network protocol header, each field in the network protocol header to be compressed still needs to be identified manually according to a specified format, so that a certain applicability problem exists.
Disclosure of Invention
The invention aims to solve the technical problem of narrow application range in the prior art by providing a network protocol header compression method based on hierarchical clustering.
In order to achieve the above purpose, the technical scheme adopted by the invention comprises the following steps:
(1) The method comprises the steps that a sending end obtains a data set to be clustered and a data set to be compressed:
the transmitting end sequentially collects continuous M data packets in a data stream transmitted to the receiving end, and the first N data packets form a data set P = { M to be clustered n I1 is less than or equal to N is less than or equal to N, and the rest I data packets form a data set Q= { Q to be compressed i I1.ltoreq.i.ltoreq.I, where M.gtoreq.100, M/2.gtoreq.N.gtoreq.M/4, M n Representing the nth data packet to be clustered, i=m-N, Q i Representing an ith data packet to be compressed;
(2) The method comprises the steps that a sending end performs hierarchical clustering on a data set to be clustered and obtains a clustering result:
(2a) The transmitting end uses the length L as a standard to cut the data packets in the data set P to be clustered to obtain a network protocol header set with the length L, and then each network protocol header xl is processed n And a Boolean array flag including L Boolean values of 1 n Initialized to xl n Cluster C of (C) n ＝{xl n ,flag n And obtaining cluster C= { C } n |1≤n≤N}，20≤L≤60；
(2b) The transmitting end performs bottom-up hierarchical clustering on the class cluster C through a class cluster distance measurement function d to obtain class cluster C ' = { C ' containing K class cluster results ' k |1≤k≤K}，C' k ＝{xl k ,flag k '}，1＜K＜5；
(3) The transmitting end transmits compression reference information to the receiving end:
the transmitting end is arranged in each class cluster C k ' Add identification id to k Obtaining a class cluster set C "= { C" added with the identifier " k |1≤k≤K}，C” k ＝{id k ,xl k ,flag k 'splicing L, K and C', then taking the spliced array as compression reference information, adding an identification byte with the value of 0x40 before the compression reference information, and transmitting to a receiving end;
(4) The transmitting end transmits data to the receiving end:
(4a) The transmitting end forms S data packets with the length larger than L in the data set Q to be compressed into a data set Q ' = { Q ' to be compressed ' s After the I1 is less than or equal to S is less than or equal to S, executing the step (4 b), and after the identification bytes with the value of 0x00 are added before each rest data packet to be compressed, transmitting the I-S data packets to be compressed, wherein the identification bytes are added, to a receiving end;
(4b) The transmitting end intercepts each data packet Q 'to be compressed' s The first L bytes xl of (1) s Searching for a flag in the cluster C' added with the identifier k Xl at byte position with all values of 1 in s And xl k Class cluster C' with same value " u Then from C' u The flag taken out from the middle part u ' and delete xl s Middle flag u All byte positions of ' 1 ' result in Q ' s Compression result xl of network protocol header of (2) s '；
(4c) C' to be found by the transmitting end " u Corresponding id u And xl s 'splice in sequence at Q' s Before the remaining bytes, and takes the splice result as Q' s Then adding an identification byte with the value of 0x80 before the compression result, and sending the identification byte to a receiving end;
(5) The receiving end receives the data and recovers the network protocol header information:
(5a) The receiving end judges the first byte information of the received data, if the byte value is 0x40, the received data is judged to be compression reference information, and the identification byte 0x40 before the compression reference information is deleted to obtain the data spliced by L, K and C ', and then L and C' are stored to realize the recovery of the compression reference information; if the byte value is 0x00, executing the step (5 b); if the byte value is 0x80, executing the step (5 c);
(5b) Deleting the identification byte 0x00 to realize the recovery of the data to be compressed with the length smaller than L;
(5c) Deleting identification byte 0x80, sequentially obtaining id u ，xl s ' finding id from set C u Corresponding xl u And a flag u ', copy xl u To xl u ' sequentially read xl s ' each byte is filled with a flag in turn u The same byte position xl of' 0 u ' obtaining the network protocol header recovery result xl u ", then xl u And splicing the received residual bytes to recover the network protocol header.
Compared with the prior art, the invention has the following advantages:
the invention adopts hierarchical clustering method to cluster partial data packets in the communication network data flow so as to obtain class clustering result containing compressible partial information in the network protocol header of the data packet, does not need to manually identify the network protocol to be compressed according to a specified format and analyze the change characteristics of fields in the network protocol header, is not only suitable for most network protocol headers in the prior art, but also suitable for unknown network protocols with a large amount of redundant information in the future, and has wide applicability.
Drawings
FIG. 1 is a flow chart of an implementation of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and the specific examples.
Referring to fig. 1, the present invention includes the steps of:
step 1) a transmitting end acquires a data set to be clustered and a data set to be compressed:
the transmitting end sequentially collects continuous M data packets in a data stream transmitted to the receiving end, and the first N data packets form a data set P = { M to be clustered n |1N is less than or equal to N, and the rest I data packets form a data set Q= { Q to be compressed i I1.ltoreq.i.ltoreq.I, where M.gtoreq.100, M/2.gtoreq.N.gtoreq.M/4, M n Representing the nth data packet to be clustered, i=m-N, Q i Representing an ith data packet to be compressed;
in this embodiment, wireshare is used to collect the data packets, and because redundancy in the header exists between the header fields of consecutive packets using the same protocol in the same stream, the collected data packets need to be divided by the fields of the stream and the protocol. The data packets in the UDP flow with the time interval of two packets not exceeding 10s are used as the data packets of the same flow, the data packets are formed into a data set to be clustered according to the acquisition sequence, and the rest data packets are used as a data set Q to be compressed. M=100 in this embodiment; if the value of N is too small, the clustering result with reliable training is not enough, and in this embodiment, n=32.
Step 2), the sending end performs hierarchical clustering on the data set to be clustered and obtains a clustering result:
step 2 a), the transmitting end uses the length L as a standard to cut the data packets in the data set P to be clustered to obtain network protocol header sets with the lengths L, and then each network protocol header xl is processed n And a Boolean array flag including L Boolean values of 1 n Initialized to xl n Cluster C of (C) n ＝{xl n ,flag n And obtaining cluster C= { C } n |1≤n≤N}，20≤L≤60；
Because the network protocol header is before the data packet is loaded, each data packet in the data set P to be clustered is cut with the length L as a standard, and the cut data is set as network protocol header data, in this embodiment, l=40, initialized as flag n All 1, representing xl of length L n Each byte position is set to be static and constant and has a value xl n All xl are to be calculated n And a flag n Combining to obtain cluster-like clusters C.
Step 2 b), the transmitting end performs bottom-up hierarchical clustering on the class cluster C through a class cluster distance measurement function d to obtain a class result containing K class clustersCluster-like C '= { C' k |1≤k≤K}，C' k ＝{xl k ,flag k '}，1＜K＜5；
The transmitting end adopts a bottom-up hierarchical clustering method, clusters C are aggregated through a cluster distance measurement function d to obtain K clustering results, and the clustering process is realized by changing the Boolean type value of the flag in order to obtain the static unchanged position in the network protocol header. In this embodiment k=3.
Step 3) the transmitting end transmits compression reference information to the receiving end:
the transmitting end is arranged in each class cluster C k ' Add identification id to k Obtaining a class cluster set C "= { C" added with the identifier " k |1≤k≤K}，C” k ＝{id k ,xl k ,flag k 'splicing L, K and C', then taking the spliced array as compression reference information, adding an identification byte with the value of 0x40 before the compression reference information, and transmitting to a receiving end;
because the clustering is completed at the transmitting end, the transmitting end needs to compress the data packet network protocol header by using the clustering result, and the receiving end needs to recover the data packet network protocol header by using the clustering result, the clustering result needs to be transmitted to the receiving end. In order to be consistent with the clustering results stored by the sending end and the receiving end, an identification id needs to be added for each clustering result k . The clustering result is K compressed reference information, namely flag k Positions with a boolean value of 1, indicating that the positions in the network protocol header remain static, the values of the positions are the same position xl k The corresponding values are thus compressed by not transmitting these static unchanged parts in the packet network protocol header at the transmitting end, and the receiving end recovers the static unchanged parts by using the stored reference information.
Step 4), the transmitting end transmits data to the receiving end:
step 4 a), the transmitting end forms S data packets with the length larger than L in the data set Q to be compressed into a data set Q ' = { Q ' to be compressed ' s After S is more than or equal to 1 and less than or equal to S, executing the steps(4b) After the identification bytes with the value of 0x00 are added before each remaining data packet to be compressed, I-S data packets to be compressed with the identification bytes are sent to a receiving end;
judging whether the length of the data packet in the Q is larger than L, if the length of the data packet is smaller than L, the identification byte with the added value of 0x00 of the sending end is sent to the receiving end before the data packet and is used for receiving the data type received by the receiving end.
Step 4 b), the transmitting end intercepts each data packet Q 'to be compressed' s The first L bytes xl of (1) s Searching for a flag in the cluster C' added with the identifier k Xl at byte position with all values of 1 in s And xl k Class cluster C' with same value " u Taking out C' u In (3) flag u ' and delete xl s Middle flag u All byte positions of ' 1 ' result in Q ' s Compression result xl of network protocol header of (2) s '；
For each data packet Q 'to be compressed' s First intercept the first L bytes xl s Searching in the set C' to find the flag k Xl at byte position with all values of 1 in s And xl k Class cluster C' with same value " u Then from C' u Taking out the flag u ' and delete xl s Middle flag u All byte positions of' 1, flag u A position of 'value 1 indicates that the position in the network protocol header is static and therefore does not need to be sent, resulting in Q' s Compression result xl of network protocol header of (2) s '；
Step 4C) C' to be found by the sender " u Corresponding id u And xl s 'splice in sequence at Q' s Before the remaining bytes, and takes the splice result as Q' s Then adding an identification byte with the value of 0x80 before the compression result, and sending the identification byte to a receiving end;
because compression uses C' u In (3) flag u ' so it is necessary to add id u And the reference information is sent to a receiving end, and the receiving end can find the network protocol header of the data packet which is correctly decompressed by the reference information. AddingOne byte identification is for receiving end region data types.
Step 5) the receiving end receives the data packet and recovers the network protocol header information:
step 5 a), the receiving end judges the first byte information of the received data, if the byte value is 0x40, the received data is judged to be compression reference information, and the identification byte 0x40 before the compression reference information is deleted to obtain the spliced data of L, K and C ', and then L and C' are saved, so that the recovery of the compression reference information is realized; if the byte value is 0x00, executing the step (5 b); if the byte value is 0x80, executing the step (5 c);
after receiving the data, the receiving end first judges the data type according to the first byte, if the data type is 0x40, the data type indicates that the compressed reference information needs to be acquired by L, K and C 'in sequence, and L and C' are saved so as to prepare for the subsequent recovery of the network header information.
Step 5 b) deleting the identification byte 0x00 to realize the recovery of the data to be compressed with the length smaller than L;
0x00 indicates that the data is to be compressed with the length smaller than L, and the original data packet can be recovered by removing the identification byte.
Step 5 c) deleting the identification byte 0x80, and sequentially acquiring ids u ，xl s ' finding id from set C u Corresponding xl u And a flag u ', copy xl u To xl u ' sequentially read xl s ' each byte is filled with a flag in turn u The same byte position xl of' 0 u ' obtaining the network protocol header recovery result xl u ", xl is again u And splicing the received residual bytes to recover the network protocol header.
0x80 means that the data is a network protocol header compression packet, delete identification byte 0x80, and sequentially acquire id u ，xl s ' finding id from set C u Corresponding xl u And a flag u ', copy xl u To xl u '，xl u Information of static unchanged position is already stored in' so that only xl is needed s The data in' are sequentially added to the flag u The same byte position xl of' 0 u ' obtaining the recovery result xl of the network protocol header u ", then xl u And splicing the received residual data to recover the complete data packet.
Claims (2)
1. A network protocol header compression method based on hierarchical clustering is characterized by comprising the following steps:
(1) The method comprises the steps that a sending end obtains a data set to be clustered and a data set to be compressed:
the transmitting end sequentially collects continuous M data packets in a data stream transmitted to the receiving end, and the first N data packets form a data set P = { M to be clustered n I1 is less than or equal to N is less than or equal to N, and the rest I data packets form a data set Q= { Q to be compressed i I1.ltoreq.i.ltoreq.I, where M.gtoreq.100, M/2.gtoreq.N.gtoreq.M/4, M n Representing the nth data packet to be clustered, i=m-N, Q i Representing an ith data packet to be compressed;
(2) The method comprises the steps that a sending end performs hierarchical clustering on a data set to be clustered and obtains a clustering result:
(2a) The transmitting end uses the length L as a standard to cut the data packets in the data set P to be clustered to obtain a network protocol header set with the length L, and then each network protocol header xl is processed n And a Boolean array flag including L Boolean values of 1 n Initialized to xl n Cluster C of (C) n ＝{xl n ,flag n And obtaining cluster C= { C } n |1≤n≤N}，20≤L≤60；
(2b) The transmitting end performs bottom-up hierarchical clustering on the class cluster C through a class cluster distance measurement function d to obtain class cluster C ' = { C ' containing K class cluster results ' k |1≤k≤K}，C' k ＝{xl k ,flag k '}，1＜K＜5；
(3) The transmitting end transmits compression reference information to the receiving end:
the transmitting end is arranged in each class cluster C k ' Add identification id to k Obtaining a class cluster set C "= { C" added with the identifier " k |1≤k≤K}，C” k ＝{id k ,xl k ,flag k 'splicing L, K and C', then taking the spliced array as compression reference information, adding an identification byte with the value of 0x40 before the compression reference information, and transmitting to a receiving end;
(4) The transmitting end transmits data to the receiving end:
(4a) The transmitting end forms S data packets with the length larger than L in the data set Q to be compressed into a data set Q ' = { Q ' to be compressed ' s After the I1 is less than or equal to S is less than or equal to S, executing the step (4 b), and after the identification bytes with the value of 0x00 are added before each rest data packet to be compressed, transmitting the I-S data packets to be compressed, wherein the identification bytes are added, to a receiving end;
(4b) The transmitting end intercepts each data packet Q 'to be compressed' s The first L bytes xl of (1) s Searching for a flag in the cluster C' added with the identifier k Xl at byte position with all values of 1 in s And xl k Class cluster C' with same value " u Then from C' u Taking out the flag u ' and delete xl s Middle flag u All byte positions of ' 1 ' result in Q ' s Compression result xl of network protocol header of (2) s '；
(4c) C' to be found by the transmitting end " u Corresponding id u And xl s 'splice in sequence at Q' s Before the remaining bytes, and takes the splice result as Q' s Then adding an identification byte with the value of 0x80 before the compression result, and sending the identification byte to a receiving end;
(5) The receiving end receives the data and recovers the network protocol header information:
(5a) The receiving end judges the first byte information of the received data, if the byte value is 0x40, the received data is judged to be compression reference information, and the identification byte 0x40 before the compression reference information is deleted to obtain the data spliced by L, K and C ', and then L and C' are stored to realize the recovery of the compression reference information; if the byte value is 0x00, executing the step (5 b); if the byte value is 0x80, executing the step (5 c);
(5b) Deleting the identification byte 0x00 to realize the recovery of the data to be compressed with the length smaller than L;
(5c) Deleting identification byte 0x80, sequentially obtaining id u ，xl s ' finding id from set C u Corresponding xl u And a flag u ', copy xl u To xl u ' sequentially read xl s ' each byte is filled with a flag in turn u The same byte position xl of' 0 u ' obtaining the network protocol header recovery result xl u ", then xl u And splicing the received residual bytes to recover the network protocol header.
2. The hierarchical clustering based network protocol header compression method of claim 1, wherein the inter-cluster distance metric function d in step (2 b) has the expression:
wherein the flag is u And xl u Is cluster C u In the network protocol header data and data of the boolean array, flag v And xl v Is cluster C v The network protocol header data and the boolean array data, and l represents the subscript of the boolean array.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210259671.4A CN114629963B (en) | 2022-03-16 | 2022-03-16 | Network protocol header compression method based on hierarchical clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210259671.4A CN114629963B (en) | 2022-03-16 | 2022-03-16 | Network protocol header compression method based on hierarchical clustering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114629963A CN114629963A (en) | 2022-06-14 |
| CN114629963B true CN114629963B (en) | 2023-10-20 |
Family
ID=81902810
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210259671.4A Active CN114629963B (en) | 2022-03-16 | 2022-03-16 | Network protocol header compression method based on hierarchical clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114629963B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6839339B1 (en) * | 2000-02-02 | 2005-01-04 | Lucent Technologies Inc. | Header compression for general packet radio service tunneling protocol (GTP)-encapsulated packets |
| CN105659612A (en) * | 2014-03-11 | 2016-06-08 | Lg电子株式会社 | Method and device for transmitting/receiving broadcast signal |
| WO2021207429A1 (en) * | 2020-04-09 | 2021-10-14 | Nvidia Corporation | Fifth generation (5g) new radio channel equalization |
-
2022
- 2022-03-16 CN CN202210259671.4A patent/CN114629963B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6839339B1 (en) * | 2000-02-02 | 2005-01-04 | Lucent Technologies Inc. | Header compression for general packet radio service tunneling protocol (GTP)-encapsulated packets |
| CN105659612A (en) * | 2014-03-11 | 2016-06-08 | Lg电子株式会社 | Method and device for transmitting/receiving broadcast signal |
| WO2021207429A1 (en) * | 2020-04-09 | 2021-10-14 | Nvidia Corporation | Fifth generation (5g) new radio channel equalization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114629963A (en) | 2022-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1271886B1 (en) | Packet header compression | |
| US20060104278A1 (en) | Apparatus and method for compressing headers in a broadband wireless communication system | |
| EP1348002B1 (en) | Method and apparatus for processing data packets | |
| JP3751823B2 (en) | Header compression in real-time services | |
| EP2479952B1 (en) | Method for compressing and decompressing time stamp and equipment thereof | |
| CN110290022B (en) | Unknown application layer protocol identification method based on adaptive clustering | |
| CN100433841C (en) | Robustness header compression/decompression method for MIPv6 | |
| CN113037646A (en) | Train communication network flow identification method based on deep learning | |
| CN111222547B (en) | Traffic feature extraction method and system for mobile application | |
| KR20160074530A (en) | Apparatus for transmitting broadcast signal, apparatus for receiving broadcast signal, method for transmitting broadcast signal and method for receiving broadcast signal | |
| CN112949739A (en) | Information transmission scheduling method and system based on intelligent traffic classification | |
| US20150071307A1 (en) | Communication interface and method for robust header compression of data flows | |
| CN112335203B (en) | Processing local area network diagnostic data | |
| CN114629963B (en) | Network protocol header compression method based on hierarchical clustering | |
| JP2004514366A (en) | Binary compression method using static information knowledge | |
| CN101534291A (en) | Method for sending and receiving IP message and device thereof | |
| CN113114968A (en) | Video processing method, device, equipment and storage medium | |
| CN111641624B (en) | Network protocol header compression method based on decision tree | |
| CN112637703B (en) | Real-time intercom system and method for WEB terminal | |
| CN112017049A (en) | Security quotation forwarding system and method | |
| CN112769705A (en) | VoIP header compression method suitable for small local area network | |
| CN113872982B (en) | Ship monitoring data transmission method and system based on MQTT protocol | |
| CN103746930B (en) | A kind of improved method of arrowband serial link TCP message header suppression | |
| CN116232710B (en) | Log message sending and transmitting method and system for network flow acquisition equipment | |
| CN111865475B (en) | Packet switching method and system |
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 |