CN109347758A - A kind of method of message compression, equipment, system and medium - Google Patents
A kind of method of message compression, equipment, system and medium Download PDFInfo
- Publication number
- CN109347758A CN109347758A CN201811007240.9A CN201811007240A CN109347758A CN 109347758 A CN109347758 A CN 109347758A CN 201811007240 A CN201811007240 A CN 201811007240A CN 109347758 A CN109347758 A CN 109347758A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- compression
- compressed
- intermediate node
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Present disclose provides a kind of method of message compression, method includes: that the compressive load of the intermediate node of the compressive load of source node and one or more is constructed balanced binary tree, and the first message of source node is forwarded to destination node through one or more intermediate node；Compressed node is determined according to balanced binary tree, which is the smallest node of compressive load in the intermediate node of source node and one or more；Compressed node compresses the first message, and adds compact token, generates the second message, and second message is forwarded.
Description
Technical field
This disclosure relates to the communications field, and in particular, to a kind of method of message compression, equipment, system and medium.
Background technique
With the fast development of internet, more and more precious for the space link resource of transmitting message, for some industry
For business, header occupies sizable ratio in messages, as soon as frame message uses IPv4 agreement, only header introduces 40 bytes
Overhead, according to IPv6 agreement, header overhead increases to 60 bytes, and the payload of a frame message may be only
There is 1 byte, header can occupy a large amount of link bandwidth resource, and the high-speed cruising for network is totally unfavorable.The prior art
In header is compressed there are many algorithm, but for there are the links of multiple nodes, do not select optimal Node compression
Message forms biggish compression pressure in a link, is unfavorable for message compression.
Summary of the invention
The disclosure in view of the above problems, provides method, equipment, system and the medium of a kind of message compression, by according to chain
The compressive load of each node carries out load balancing in road, and compressed node is marked, and has decomposed the compression pressure in link,
And realize effective compression monitoring.
An aspect of this disclosure provides a kind of method of message compression, comprising: by the compressive load of source node and one
The compressive load of a or more intermediate node constructs balanced binary tree, and the first message of the source node is through this one or more
Intermediate node is forwarded to destination node；Compressed node is determined according to the balanced binary tree, which is the source node
With the smallest node of compressive load in one or more intermediate node；The compressed node carries out first message
Compression, and compact token is added, the second message is generated, and second message is forwarded.
Optionally, according to the compressive load of the intermediate node of the compressive load of source node and one or more building balance two
Fork tree includes: the compressive load setting number of the compressive load and one or more intermediate node for the source node；
The balanced binary tree is constructed according to the value of the number.
Optionally, the compressed node is the corresponding node of the smallest number of the balanced binary tree intermediate value, the pressure
After casing coupling point compresses first message, the value of the number of the compressed node is updated in the balanced binary tree most
Big value.
Optionally, the balanced binary tree is red black tree.
Optionally, the compressed node compresses first message, further includes: the report of statistics first message
The frequency of occurrence of each character in head；Hofman tree is constructed according to the frequency of occurrence of each character；According to the Huffman
Tree generates the huffman coding of each character, and the digit of the huffman coding is not more than the digit of each character.
Optionally, the bit of the corresponding huffman coding of character more than the frequency of occurrence is few no more than the frequency of occurrence
The corresponding huffman coding of character bit.
Optionally, the first message of the source node is forwarded to destination node through one or more the intermediate node and includes:
The intermediate node monitors whether the message has compact token after receiving message, when the message has compact token, in this
The message is directly forwarded by intermediate node；When the message does not have compact token, if the intermediate node is the compression
Node, the intermediate node compress the message, are forwarded after adding compact token.
On the other hand the disclosure additionally provides a kind of electronic equipment of message compression, comprising: processor；Memory is deposited
Computer executable program is contained, the program by the processor when being executed, so that the processor executes above-mentioned message pressure
The method of contracting.
On the other hand the disclosure additionally provides a kind of system of message compression, the system of the message compression includes: that load is equal
Weigh module, and the compressive load for the intermediate node according to the compressive load of source node and one or more constructs balanced binary
Tree, and compressed node is determined according to the balanced binary tree；Compression module, the header structure for the first message for the source node
Hofman tree is built, generating huffman coding indicates each character in the header, and the digit of the huffman coding is not more than
The digit of each character indicates the header of first message with the huffman coding；Monitoring modular, for monitoring
It states whether the message that intermediate node receives has compact token, when the message has compact token, which is directly transferred
It goes, when the message does not have compact token, if the intermediate node is the compressed node, which presses the message
Contracting forwards the message after adding compact token, and otherwise, which directly forwards the message.
On the other hand the disclosure additionally provides a kind of computer readable storage medium, be stored thereon with computer program, should
The method of above-mentioned message compression is realized when program is executed by processor.
Detailed description of the invention
Fig. 1 diagrammatically illustrates the flow chart of the method for the message compression of embodiment of the present disclosure offer.
Fig. 2 diagrammatically illustrates the schematic diagram of the balanced binary tree of embodiment of the present disclosure offer.
Fig. 3 diagrammatically illustrates the block diagram of the electronic equipment of embodiment of the present disclosure offer.
Fig. 4 diagrammatically illustrates the block diagram of the system of the message compression of embodiment of the present disclosure offer.
Specific embodiment
According in conjunction with attached drawing to the described in detail below of disclosure exemplary embodiment, other aspects, the advantage of the disclosure
Those skilled in the art will become obvious with prominent features.
In the disclosure, term " includes " and " containing " and its derivative mean including rather than limit；Term "or" is packet
Containing property, mean and/or.
In the present specification, following various embodiments for describing disclosure principle only illustrate, should not be with any
Mode is construed to limitation scope of disclosure.Referring to attached drawing the comprehensive understanding described below that is used to help by claim and its equivalent
The exemplary embodiment for the disclosure that object limits.Described below includes a variety of details to help to understand, but these details are answered
Think to be only exemplary.Therefore, it will be appreciated by those of ordinary skill in the art that without departing substantially from the scope of the present disclosure and spirit
In the case where, embodiment described herein can be made various changes and modifications.In addition, for clarity and brevity,
The description of known function and structure is omitted.In addition, running through attached drawing, same reference numbers are used for identity function and operation.
Fig. 1 diagrammatically illustrates the flow chart of the method for the message compression of embodiment of the present disclosure offer, and Fig. 2 is schematically shown
The schematic diagram for the balanced binary tree that the embodiment of the present disclosure provides.With reference to Fig. 2, Fig. 1 the method is described in detail, is such as schemed
Shown in 1, this method includes following operation:
The compressive load of the compressive load of source node and intermediate node is constructed balanced binary tree by S1.
In operation S1, it is arranged for the compressive load of source node and each intermediate node numbers first, compressive load indicates
The compression pressure of the compression pressure of node, node is smaller, and the compressive load of node is with regard to smaller, and the value of the number of node is with regard to smaller.
The present embodiment is illustrated so that source node is connected with destination node by nine intermediate nodes as an example, it is assumed that source node and nine
The value of the number of the compressive load of intermediate node is followed successively by 25,31,49,98,19,7,2,34,65 and 27 respectively.
Then, self-balancing binary tree is constructed according to the value of the number of node, i.e. red black tree, red black tree belongs to balanced binary
Tree, compared with balanced binary tree, red black tree does not pursue complete equipilibrium, has higher efficiency.It is saved in the present embodiment according to source
The red black tree of the value building of the number of the value and nine intermediate nodes of the number of point is as shown in Fig. 2, hypographous node is in figure
Dark node, unblanketed node are red node, and NULL is empty node, and is dark node, the lesser section of the value of number
Point in the left side of red black tree, the biggish node of the value of number on the right side of red black tree, from left to right in red black tree node number
Value be followed successively by 2,7,19,25,27,31,34,49,65 and 98.
The smallest node of compressive load in balanced binary tree is set compressed node by S2.
In operation S2, the corresponding node of the smallest value will be numbered in red black tree and is set as compressed node, that is, takes red black tree
In leftmost node, in the present embodiment, take number value be 2 intermediate node as compressed node.It is searched in red black tree
The time of the compressed node is O (log2N), wherein n is the number of red black tree interior joint, with source node in the present embodiment and nine
For a intermediate node, only needs that compressed node can be found four times, reduce the time complexity of operation.
Further, after compressed node compresses message, the rightmost of compressed node self-balancing to red black tree,
For the maximum node of value numbered in red black tree, when next second compression, continues that the corresponding node of the smallest value will be numbered in red black tree
It is set as compressed node.
S3, is arranged compression module for compressed node, carries out huffman coding to header.
In operation S3, compression module is set in compressed node, counts each character in the header of the message received
Frequency of occurrence, according to the frequency of occurrence of each character construct Hofman tree, the Hough of each character is generated according to Hofman tree
Graceful coding, saves the high character of the frequency of occurrences with less bit, saves the low character of the frequency of occurrences, Hough with more bit
The digit of graceful coding is not more than the digit of each character, and the bit of the corresponding huffman coding of the high character of the frequency of occurrences is not more than
The bit of the corresponding huffman coding of the low character of the frequency of occurrences.Such as to the decimal number { 5 29 78 14 of one group of eight byte
23 3 11 } after carrying out huffman coding, the huffman coding of each character is as shown in the table, this group of data occupy eight before coding
A byte, this group of data only take up less than four bytes after coding, can effectively save the occupied link circuit resource of header.
| Character | Huffman coding | Character | Huffman coding |
| 5 | 0110 | 14 | 110 |
| 29 | 10 | 23 | 00 |
| 7 | 1110 | 3 | 0111 |
| 8 | 1111 | 11 | 010 |
S4, compressed node compress the message received, add compact token and are forwarded, and complete message from source
Transmission of the node to destination node.
In operation S4, compressed node calls its compression module to compress the header of message after receiving message, i.e.,
Header is indicated with the huffman coding of less byte, compressed node adds compact token to compressed message, and will add
The message of compact token forwards.
Further, it includes following sub-operation that message is sent to destination node by source node:
Sub-operation S41, source node judge whether it is compressed node, if source node is compressed node, source node calls it
Compression module carries out huffman coding to the header of message, forwards the message to coupled middle node after adding compact token
Point, each intermediate node in link can monitor the compact token in message after receiving message, in each of link
Message is directly sent to coupled next node by intermediate node；If source node is not compressed node, source node directly will report
Text is sent to directly connected intermediate node, executes sub-operation S42.
Sub-operation S42, each intermediate node in link monitor in message whether have compact token after receiving message, if
There is compact token in message, which is directly sent to message directly connected next node；If not having in message
There is compact token, executes sub-operation S43.
Sub-operation S43, the intermediate node judge whether it is compressed node, if the intermediate node is compressed node, in this
Intermediate node calls its compression module to carry out huffman coding to the header of message, forwards the packet after addition compact token and gives it
Connected next node；If the intermediate node is not compressed node, which is directly sent to directly phase for message
Next node even.
As shown in figure 3, electronic equipment 300 includes processor 310, computer readable storage medium 320.The electronic equipment
300 can execute the method above with reference to Fig. 1 and Fig. 2 description, to carry out Message Processing.
Specifically, processor 310 for example may include general purpose microprocessor, instruction set processor and/or related chip group
And/or special microprocessor (for example, specific integrated circuit (ASIC)), etc..Processor 310 can also include using for caching
The onboard storage device on way.Processor 310 can be for executing the side according to the embodiment of the present disclosure for referring to Fig. 1 and Fig. 2 and describing
Single treatment unit either multiple processing units of the different movements of method process.
Computer readable storage medium 320, such as can be times can include, store, transmitting, propagating or transmitting instruction
Meaning medium.For example, readable storage medium storing program for executing can include but is not limited to electricity, magnetic, optical, electromagnetic, infrared or semiconductor system, device,
Device or propagation medium.The specific example of readable storage medium storing program for executing includes: magnetic memory apparatus, such as tape or hard disk (HDD)；Optical storage
Device, such as CD (CD-ROM)；Memory, such as random access memory (RAM) or flash memory；And/or wire/wireless communication chain
Road.
Computer readable storage medium 320 may include computer program 321, which may include generation
Code/computer executable instructions execute processor 310 for example above in conjunction with Fig. 1 and figure
Method flow described in 2 and its any deformation.
Computer program 321 can be configured to have the computer program code for example including computer program module.Example
Such as, in the exemplary embodiment, the code in computer program 321 may include one or more program modules, for example including
321A, module 321B ....It should be noted that the division mode and number of module are not fixation, those skilled in the art can
To be combined according to the actual situation using suitable program module or program module, when these program modules are combined by processor 310
When execution, processor 310 is executed for example above in conjunction with method flow described in Fig. 1 and Fig. 2 and its any deformation.
In accordance with an embodiment of the present disclosure, computer-readable medium can be computer-readable signal media or computer can
Read storage medium either the two any combination.Computer readable storage medium for example can be --- but it is unlimited
In system, device or the device of --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, or any above combination.It calculates
The more specific example of machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, portable of one or more conducting wires
Formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable programmable read only memory
(EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device or
The above-mentioned any appropriate combination of person.In the disclosure, computer readable storage medium can be it is any include or storage program
Tangible medium, which can be commanded execution system, device or device use or in connection.And in this public affairs
In opening, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
In carry computer-readable program code.The data-signal of this propagation can take various forms, including but not limited to
Electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be computer-readable
Any computer-readable medium other than storage medium, the computer-readable medium can send, propagate or transmit for by
Instruction execution system, device or device use or program in connection.The journey for including on computer-readable medium
Sequence code can transmit with any suitable medium, including but not limited to: wireless, wired, optical cable, radiofrequency signal etc., or
Above-mentioned any appropriate combination.
Fig. 4 diagrammatically illustrates the block diagram of the system of the control resource access of embodiment of the present disclosure offer.
As shown in figure 4, the system 400 of control resource access includes load balancing module 410, compression module 420 and monitoring
Module 430.
Specifically, load balancing module 410, for being according to the compressive load of source node and the compressive load of intermediate node
Source node and intermediate node setting number, construct balanced binary tree according to the value of number, from left to right node on balanced binary tree
The value of number be gradually increased, choose leftmost node as compressed node, i.e. the selection the smallest node conduct of compressive load
Compressed node, self-balancing is to the right of balanced binary tree after compressed node compressed packet.
Compression module 420, the frequency of occurrence of each character in the header for counting the message received, according to each word
The frequency of occurrence of symbol constructs Hofman tree, and the huffman coding of each character is generated according to Hofman tree, is protected with less bit
The high character of the frequency of occurrences is deposited, saves the low character of the frequency of occurrences with more bit, the digit of huffman coding is no more than every
The digit of a character, and compact token is added for compressed message.
Monitoring modular 430, for monitoring whether the message that intermediate node receives has compact token, when message has compression to mark
It clocks, message is directly forwarded, when message does not have compact token, if the intermediate node is compressed node, call compression
Compact token is compressed to message and added to module, which is forwarded, and otherwise, which directly forwards.
It is understood that load balancing module 410, compression module 420 and monitoring modular 430 may be incorporated in a mould
It is realized in block or any one module therein can be split into multiple modules.Alternatively, one or more in these modules
At least partly function of a module can be combined at least partly function of other modules, and be realized in a module.Root
According to the embodiment of the present invention, at least one of load balancing module 410, compression module 420 and monitoring modular 430 can be at least
It is implemented partly as hardware circuit, such as field programmable gate array (FPGA), programmable logic array (PLA), on piece system
System, the system on substrate, the system in encapsulation, specific integrated circuit (ASIC), or can be to be integrated or be encapsulated to circuit
The hardware such as any other rational method or firmware realize, or with software, three kinds of implementations of hardware and firmware it is suitable
When combination is realized.Alternatively, at least one of load balancing module 410, compression module 420 and monitoring modular 430 can be down to
It is implemented partly as computer program module less, when the program is run by computer, the function of corresponding module can be executed.
Although the disclosure, art technology has shown and described referring to the certain exemplary embodiments of the disclosure
Personnel it should be understood that in the case where the spirit and scope of the present disclosure limited without departing substantially from the following claims and their equivalents,
A variety of changes in form and details can be carried out to the disclosure.Therefore, the scope of the present disclosure should not necessarily be limited by above-described embodiment,
But should be not only determined by appended claims, also it is defined by the equivalent of appended claims.
Claims (10)
1. a kind of method of message compression, comprising:
The compressive load of the intermediate node of the compressive load of source node and one or more is constructed into balanced binary tree, the source node
The first message be forwarded to destination node through one or more the intermediate node；
Compressed node is determined according to the balanced binary tree, during which is the source node and is one or more
The smallest node of compressive load in intermediate node；
The compressed node compresses first message, and adds compact token, generate the second message, and by this second
Message is forwarded.
2. the method for message compression according to claim 1, wherein according to the compressive load of source node and one or more
Intermediate node compressive load building balanced binary tree include:
For the compressive load of the source node and the compressive load of one or more intermediate node, number is set；
The balanced binary tree is constructed according to the value of the number.
3. the method for message compression according to claim 2, wherein the compressed node is the balanced binary tree intermediate value
The corresponding node of the smallest number, after which compresses first message, the compressed node it is described
The value of number is updated to maximum value in the balanced binary tree.
4. message compression method according to claim 2, wherein the balanced binary tree is red black tree.
5. the method for message compression according to claim 1, wherein the compressed node presses first message
Contracting, further includes:
Count the frequency of occurrence of each character in the header of first message；
Hofman tree is constructed according to the frequency of occurrence of each character；
The huffman coding of each character is generated according to the Hofman tree, the digit of the huffman coding is not more than institute
State the digit of each character.
6. the method for message compression according to claim 5, wherein the corresponding Huffman of character more than the frequency of occurrence
The bit of the bit of the coding character corresponding huffman coding few no more than the frequency of occurrence.
7. the method for message compression according to claim 1, wherein the first message of the source node is through this one or more
Intermediate node be forwarded to destination node and include:
The intermediate node monitors whether the message has compact token after receiving message, when the message has compact token,
The message is directly forwarded by the intermediate node；
When the message does not have compact token, if the intermediate node is the compressed node, the intermediate node is to the message
It is compressed, is forwarded after adding compact token.
8. a kind of electronic equipment of message compression, comprising:
Processor；
Memory is stored with computer executable program, and the program by the processor when being executed, so that the processor
Execute the method such as message compression in claim 1-7.
9. a kind of system of message compression, which is characterized in that the system of the message compression includes:
Load balancing module, the compressive load for the intermediate node according to the compressive load of source node and one or more construct
Balanced binary tree, and compressed node is determined according to the balanced binary tree；
Compression module, the header for the first message for the source node construct Hofman tree, and generating huffman coding indicates
Each character in the header, the digit of the huffman coding is not more than the digit of each character, with the Hough
The header of first message described in graceful coded representation；
Monitoring modular, for monitoring whether the message that the intermediate node receives has compact token, when the message has compression to mark
It clocks, which is directly forwarded, when the message does not have compact token, if the intermediate node is the compressed node,
The intermediate node compresses the message, forwards the message after adding compact token, otherwise, which should
Message directly forwards.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The method such as message compression in claim 1-7 is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811007240.9A CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811007240.9A CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109347758A true CN109347758A (en) | 2019-02-15 |
| CN109347758B CN109347758B (en) | 2022-01-04 |
Family
ID=65296857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811007240.9A Active CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109347758B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111341330A (en) * | 2020-02-10 | 2020-06-26 | 科大讯飞股份有限公司 | Audio coding and decoding method, access method, related equipment and storage device |
| CN113852556A (en) * | 2021-08-31 | 2021-12-28 | 天翼数字生活科技有限公司 | Method and system for compressing and retrieving routing information |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1937557A (en) * | 2006-09-05 | 2007-03-28 | 华为技术有限公司 | Structured reciprocal network system and its load query, transfer and resource seeking method |
| US20120250688A1 (en) * | 2011-04-02 | 2012-10-04 | Recursion Software, Inc. | System and method for unmarshalled routing |
| CN105052112A (en) * | 2013-03-13 | 2015-11-11 | 华为技术有限公司 | System and method for compressing data associated with a buffer |
| WO2017173618A1 (en) * | 2016-04-07 | 2017-10-12 | 华为技术有限公司 | Method, apparatus and device for compressing data |
-
2018
- 2018-08-30 CN CN201811007240.9A patent/CN109347758B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1937557A (en) * | 2006-09-05 | 2007-03-28 | 华为技术有限公司 | Structured reciprocal network system and its load query, transfer and resource seeking method |
| US20120250688A1 (en) * | 2011-04-02 | 2012-10-04 | Recursion Software, Inc. | System and method for unmarshalled routing |
| CN105052112A (en) * | 2013-03-13 | 2015-11-11 | 华为技术有限公司 | System and method for compressing data associated with a buffer |
| WO2017173618A1 (en) * | 2016-04-07 | 2017-10-12 | 华为技术有限公司 | Method, apparatus and device for compressing data |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111341330A (en) * | 2020-02-10 | 2020-06-26 | 科大讯飞股份有限公司 | Audio coding and decoding method, access method, related equipment and storage device |
| CN113852556A (en) * | 2021-08-31 | 2021-12-28 | 天翼数字生活科技有限公司 | Method and system for compressing and retrieving routing information |
| CN113852556B (en) * | 2021-08-31 | 2023-04-14 | 天翼数字生活科技有限公司 | Method and system for compressing and retrieving routing information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109347758B (en) | 2022-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110445860B (en) | Message sending method, device, terminal equipment and storage medium | |
| US10044369B1 (en) | Interleaved codes for dynamic sizeable headers | |
| CN109347758A (en) | A kind of method of message compression, equipment, system and medium | |
| US20100070825A1 (en) | Fast Low-Density Parity-Check Code Encoder | |
| WO2014106782A1 (en) | High bandwidth compression to encoded data streams | |
| US10817460B2 (en) | RDMA data sending and receiving methods, electronic device, and readable storage medium | |
| CN104040899A (en) | Generating a code alphabet of symbols to generate codewords for words used with a program | |
| Wen et al. | SECOMPAX: A bitmap index compression algorithm | |
| CN112399479B (en) | Method, electronic device and storage medium for data transmission | |
| CN112118073B (en) | Data processing method, optical transmission equipment and digital processing chip | |
| WO2017157023A1 (en) | Method and system for transmitting soap message | |
| CN109690957A (en) | The system level testing of entropy coding | |
| US10506388B1 (en) | Efficient short message compression | |
| Tang et al. | A real-time updatable FPGA-based architecture for fast regular expression matching | |
| CN117014527A (en) | Data processing method and device, storage medium and electronic equipment | |
| CN116405420A (en) | Network tester, network testing system and network testing method | |
| US20220069944A1 (en) | Data Processing Method And Related Apparatus | |
| US8331788B2 (en) | Encapsulation scheme for optical over Ethernet | |
| CN108874494A (en) | Message treatment method and Android electronic equipment in a kind of android system | |
| CN117060930B (en) | Data intelligent communication system for docking station | |
| KR20040073103A (en) | A method for synchronizing data frames in digital communication system | |
| CN115276720B (en) | High-speed carrier data transmission device and method and electronic equipment | |
| CN112200301B (en) | Convolution computing device and method | |
| CN114095036B (en) | Code length generating device for dynamic Huffman coding | |
| KR102361730B1 (en) | Data compressing method and apparatus |
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 |