CN103888452A - Storage method and device for message compression - Google Patents
Storage method and device for message compression Download PDFInfo
- Publication number
- CN103888452A CN103888452A CN201410086621.6A CN201410086621A CN103888452A CN 103888452 A CN103888452 A CN 103888452A CN 201410086621 A CN201410086621 A CN 201410086621A CN 103888452 A CN103888452 A CN 103888452A
- Authority
- CN
- China
- Prior art keywords
- message
- compressed
- compression
- queue
- request queue
- 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
Images
Abstract
The invention discloses a storage method and device for message compression. The method includes the steps of receiving multiple messages and sequentially judging whether each message meets compression conditions; sending the messages to be compressed and meeting the compression conditions to a compression request queue, and sending the messages not to be compressed and not meeting the compression conditions to a temporary buffering queue; judging whether the messages not to be compressed exist in the temporary buffering queue before the messages to be compressed are sent to the compression request queue; if the answer is yes, the messages not to be compressed and the messages to be compressed are sent to storage units corresponding to metadata in the compression request queue; compressing the messages to be compressed in the compression request queue, and outputting the compressed messages to be compressed and the messages not to be compressed in the metadata sequentially through a compression response queue. According to the storage method, wideband resources of a compression coprocessor are effectively used, and the I/O bandwidth of a compression card and use efficiency of a CPU are optimized.
Description
Technical field
The present invention relates to network communications technology field, relate in particular to a kind of order-preserving method for message compression and device.
Background technology
At present, network compression is generally the data compression of the application layer based on transmission control protocol TCP, as hypertext transfer protocol HTTP, mainly control to TCP layer to realize the compression to business datum by fine granularity, but the transparent compression of business datum is not yet found.For example, the accelerating system of similar employing coprocessor or central processor CPU, can pass through FIFO(First in First Out, First Input First Output) mechanism realizes communicating by letter between CPU and coprocessor, simultaneously by the paralleling tactic based on TCP stream granularity, to guarantee that message in TCP stream is without out of order generation.
The problem existing is at present, the realization of FIFO mechanism is for the application of above-mentioned this similar compression, all business datums all can be passed through to coprocessor processes, the width waste problem that can cause like this data compression coprocessor, has also additionally consumed unnecessary input/output port (I/O) width simultaneously.
Summary of the invention
The present invention is intended to solve at least to a certain extent one of technical problem in correlation technique.
For this reason, first object of the present invention is to propose a kind of order-preserving method for message compression.The method can effectively utilize compression coprocessor bandwidth resources, also can reduce unnecessary coprocessor I/O access, optimize CPU service efficiency, and by adaptive order-preserving push-mechanism, reduced the accumulation processing delay in non-packet order preserving process to be compressed.
Second object of the present invention is to propose a kind of order-preserving device for message compression.
To achieve these goals, the order-preserving method for message compression of first aspect present invention embodiment, comprising: receive multiple messages, and judge successively whether each described message meets contractive condition; The message to be compressed that meets described contractive condition is sent to compression request queue, and the message non-to be compressed that does not meet described contractive condition is sent to adhoc buffer queue; Before described message to be compressed is sent to described compression request queue, judge currently in described adhoc buffer queue whether have a non-message to be compressed; Have described non-message to be compressed if current, described non-message to be compressed and described message to be compressed are sent in memory cell corresponding to respective meta-data in described compression request queue; And the message described to be compressed in described compression request queue is compressed to processing, by compression, response queue exports the described non-message to be compressed in compression message to be compressed after treatment and described metadata in next stage treatment system or transmission network according to the order of sequence.
The order-preserving method for message compression of the embodiment of the present invention, before message to be compressed is sent to compression request queue, judge currently in adhoc buffer queue whether have a non-message to be compressed, have non-message to be compressed if current, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue, and after the message to be compressed in compression request queue being compressed to processing, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence, at least have the following advantages: (1) carries out data compression based on TCP Flow granularity, different TCP Flow allow to adopt different compression methods, realize the data compression transparent to business datum, (2) carry out data compression by compression coprocessor, between coprocessor and CPU, carry out asynchronous operation, improved the systematic function of compression device, (3) filter by the message that message length is less than to preset value, avoided small messages compression without compression income, improved the utilance of pay(useful) load and the I/O performance of optimization coprocessor of data compression coprocessor.
To achieve these goals, the order-preserving device for message compression of second aspect present invention embodiment, comprising: receiver module, for receiving multiple messages; The first judge module, for judging successively whether each described message meets contractive condition; Sending module, for the message to be compressed that meets described contractive condition is sent to compression request queue, and is sent to adhoc buffer queue by the message non-to be compressed that does not meet described contractive condition; The second judge module, before described message to be compressed being sent to described compression request queue whenever described sending module, judges currently in described adhoc buffer queue whether have a non-message to be compressed; Described sending module also when judging that at described the second judge module described adhoc buffer queue is current and have described non-message to be compressed, is sent to described non-message to be compressed and described message to be compressed in memory cell corresponding to respective meta-data in described compression request queue; Compression order-preserving module, for the message described to be compressed of described compression request queue is compressed to processing, by compression, response queue exports the described non-message to be compressed in compression message to be compressed after treatment and described metadata in next stage treatment system or transmission network according to the order of sequence.
The order-preserving device for message compression of the embodiment of the present invention, before message to be compressed is sent to compression request queue by sending module, judge currently in adhoc buffer queue whether have a non-message to be compressed by the second judge module, sending module is current while having non-message to be compressed, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue, compression order-preserving module is after compressing processing to the message to be compressed in compression request queue, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence, at least have the following advantages: (1) carries out data compression based on TCP Flow granularity, different TCP Flow allow to adopt different compression methods, realize the data compression transparent to business datum, (2) carry out data compression by compression coprocessor, between coprocessor and CPU, carry out asynchronous operation, improved the systematic function of compression device, (3) filter by the message that message length is less than to preset value, avoided small messages compression without compression income, improved the utilance of pay(useful) load and the I/O performance of optimization coprocessor of data compression coprocessor.
The aspect that the present invention is additional and advantage in the following description part provide, and part will become obviously from the following description, or recognize by practice of the present invention.
Brief description of the drawings
The present invention above-mentioned and/or additional aspect and advantage will become from the following description of the accompanying drawings of embodiments obviously and easily and understand, wherein,
Fig. 1 is the flow chart for the order-preserving method of message compression according to an embodiment of the invention;
Fig. 2 judges that message meets the flow chart of contractive condition according to an embodiment of the invention;
Fig. 3 is the schematic diagram for the order-preserving method of message compression according to an embodiment of the invention;
Fig. 4 is the schematic diagram of non-according to an embodiment of the invention message to be compressed more than the TCP stream of message to be compressed;
Fig. 5 is according to an embodiment of the invention to the flow chart being optimized for the order-preserving method of message compression;
Fig. 6 is according to an embodiment of the invention to the schematic diagram being optimized for the order-preserving method of message compression;
Fig. 7 is the structural representation for the order-preserving device of message compression according to an embodiment of the invention;
Fig. 8 is the structural representation of the order-preserving device for message compression of a specific embodiment according to the present invention.
Embodiment
Describe embodiments of the invention below in detail, the example of described embodiment is shown in the drawings, and wherein same or similar label represents same or similar element or has the element of identical or similar functions from start to finish.Be exemplary below by the embodiment being described with reference to the drawings, be intended to for explaining the present invention, and can not be interpreted as limitation of the present invention.
Disclosing below provides many different embodiment or example to be used for realizing different structure of the present invention.Of the present invention open in order to simplify, hereinafter the parts to specific examples and setting are described.Certainly, they are only example, and object does not lie in restriction the present invention.In addition, the present invention can be in different examples repeat reference numerals and/or letter.This repetition is in order to simplify and object clearly, itself do not indicate the relation between discussed various embodiment and/or setting.
Describe according to the order-preserving method for message compression of the embodiment of the present invention and device below with reference to accompanying drawing.
A kind of order-preserving method for message compression that the embodiment of the present invention provides, comprising: receive multiple messages, and judge successively whether each message meets contractive condition; The message to be compressed that meets contractive condition is sent to compression request queue, and the message non-to be compressed that does not meet contractive condition is sent to adhoc buffer queue; Before message to be compressed is sent to compression request queue, judge currently in adhoc buffer queue whether have a non-message to be compressed; Have non-message to be compressed if current, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue; And the message to be compressed in compression request queue is compressed to processing, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence.
Fig. 1 is the flow chart for the order-preserving method of message compression according to an embodiment of the invention.
As shown in Figure 1, this order-preserving method that is used for message compression can comprise:
S101, receives multiple messages, and judges successively whether each message meets contractive condition.
Particularly, can first receive TCP(Transmission Control Protocol, transmission control protocol) multiple messages of comprising in (TCP Flow) of stream, can judge successively afterwards whether each message meets contractive condition, to the message that meets contractive condition is compressed, the message that does not meet contractive condition is not compressed.
In one embodiment of the invention, as shown in 2, judge that message meets contractive condition and can comprise:
S201, obtains the length of each message.
S202, judges whether the length of each message is more than or equal to preset value.
Wherein, in an embodiment of the present invention, preset value can be by default.For example, system can be determined according to the actual conditions of message length the size of this preset value, can collect a large amount of messages, first obtains the length of these messages, afterwards these length is averaging, and to obtain mean value, can determine preset value according to this mean value afterwards.
S203, if be more than or equal to preset value, judges that message meets contractive condition.
S204, if be less than preset value, judges that message does not meet contractive condition.
Thus, can judge that whether this message meets contractive condition, has improved the accuracy of judged result according to the length of message.
For example, as shown in Figure 3, continued presence P0, P1 in the TCP Flow receiving ... these seven messages of P6, obtain successively the length of these seven messages, can judge the limited length of message P2, P4, P5, be less than preset value, that is to say, message P2, P4, P5 are the message that does not meet contractive condition, can be without it is compressed; The length of judging message P0, P1, P3, P6 is greater than preset value, and message P0, P1, P3, P6 are the message that meets contractive condition, need compress it.
S102, is sent to compression request queue by the message to be compressed that meets contractive condition, and the message non-to be compressed that does not meet contractive condition is sent to adhoc buffer queue.
For example, as shown in Figure 3, in order optimizing, P2, P4, this message without compression income of P5 to be compressed to the coprocessor expense causing, to avoid message P2, P4, P5 to enter I/O(Input/Output, input/output port) stage.Therefore, in the time processing message P3, total P0, P1 and these three messages to be compressed of P3 in compression request queue, message P2 will be by filtering.Now, if directly message P2 be transparent to next stage message processing procedure or output to network interface card, may cause message P2 and output in transmission network before message P0 and P1, thereby cause out of order generation.
For this reason, in an embodiment of the present invention, the message P0 to be compressed, P1, P3, the P6 that meet contractive condition can be sent to compression request queue, and the message P2 non-to be compressed, P4, the P5 that do not meet contractive condition are sent in adhoc buffer queue.Wherein, as shown in Figure 3, Order_buffer can be in TCP Flow session structure and controls out of order adhoc buffer queue, for the non-message to be compressed of blotter.In addition, non-message P2 to be compressed, P4, P5 be without compression, and can join the team operation note in Order_buffer by tail of the queue, and can bypass compressibility and output in rear level system.
S103, before message to be compressed is sent to compression request queue, judges currently in adhoc buffer queue whether have a non-message to be compressed.
For example, as shown in Figure 3, compression engine judges that message P1 meets contractive condition, before message P1 to be compressed is sent to compression request queue, can first judge currently in now adhoc buffer queue whether have a non-message to be compressed.
S104, does not have non-message to be compressed if current, the message to be compressed that meets contractive condition is sent in memory cell corresponding to respective meta-data in compression request queue.
For example, before message P1 to be compressed is sent to compression request queue, judge currently in now adhoc buffer queue not have a non-message to be compressed, this message P1 to be compressed can be sent to afterwards in memory cell corresponding to respective meta-data (metadata) in compression request queue.
S105, has non-message to be compressed if current, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue.
Particularly, current while having non-message to be compressed when judging in adhoc buffer queue, can first extract the message non-to be compressed of current existence in adhoc buffer queue, can be sent in compression request queue meeting together with the message to be compressed of contractive condition and the message non-to be compressed of extraction afterwards.Wherein, in an embodiment of the present invention, non-message to be compressed can be recorded in the metadata that message to be compressed is corresponding with pointer form.In addition, in one embodiment of the invention, metadata has the memory address of message to be compressed.That is to say, in the time existing message to be compressed to join the team operation, the bypass message of team's head instruction of the interim chained list of extraction oder_buffer is also recorded in the metadata of compression queue continuous item.
For example, as shown in Figure 3, compression engine judges that message P2 does not meet contractive condition, can first this non-message P2 to be compressed be sent in adhoc buffer queue.Afterwards, compression engine judges that message P3 meets contractive condition, before message P3 to be compressed is sent to compression request queue, judges currently in now adhoc buffer queue to have a non-message P2 to be compressed.Can first extract afterwards the message P2 non-to be compressed of current existence in adhoc buffer queue, and team's head pointer of the interim chained list of Order_buffer is put to sky.Finally, message P3 to be compressed can be sent in compression request queue together with non-message P2 to be compressed.
And for example, as shown in Figure 3, compression engine judges that message P6 meets contractive condition, and in the time that message P6 to be compressed is sent to compression request queue, message P6 to be compressed can bring the message P4 non-to be compressed in adhoc buffer queue in compression request queue together with P5.
S106, compresses processing to the message to be compressed in compression request queue, and by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence.
Particularly, can first obtain message to be compressed according to the memory address in metadata, and treat compressed packet and compress processing.Afterwards, the memory address of the message to be compressed in metadata can be replaced with to the memory address of compression message to be compressed after treatment.Finally, when message to be compressed compress finish dealing with after and by when compression is taken away response queue, the pointer recording in can the each metadata of first Sequential output, and start traversal from the head of pointer, export successively non-message to be compressed and compression message to be compressed after treatment.
For example, as shown in Figure 3, at a time, there is message P3 to be compressed in compression request queue, simultaneously the subsidiary non-message P2 to be compressed of pointer record of message P3 to be compressed; There is message P6 to be compressed in compression request queue, message P6 to be compressed enters after compression request queue simultaneously, can record team's head pointer of order_buffer in the associated pointers of message P6 to be compressed.
For example, treat compressed packet P3 when compression engine and go out team when operation, the out of order pointer of first can the current message P3 to be compressed of Sequential output corresponding metadata record, from this pointer head traversal and export successively non-message P2 to be compressed, finally exports message P3 to be compressed.Thus, can guarantee non-message P2 to be compressed, P4 and P5 without actual compression process, do not consume compression bandwidth, do not cause coprocessor I/O process, do not affect overall compression performance, finally can reach the order-preserving process of data message in TCP Flow yet simultaneously yet.
The order-preserving method for message compression of the embodiment of the present invention, before message to be compressed is sent to compression request queue, judge currently in adhoc buffer queue whether have a non-message to be compressed, have non-message to be compressed if current, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue, and after the message to be compressed in compression request queue being compressed to processing, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence, at least have the following advantages: (1) carries out data compression based on TCP Flow granularity, different TCP Flow allow to adopt different compression methods, realize the data compression transparent to business datum, (2) carry out data compression by compression coprocessor, between coprocessor and CPU, carry out asynchronous operation, improved the systematic function of compression device, (3) filter by the message that message length is less than to preset value, avoided small messages compression without compression income, improved the utilance of pay(useful) load and the I/O performance of optimization coprocessor of data compression coprocessor.
It should be noted that, inventor analyzes by the data message to actual data transfer, find that there is kind of a phenomenon ubiquity, for example, in the transmitting procedure of Web Page webpage, a direction overwhelming majority is little ACK(Acknowledgement, acknowledge character) message, these ACK messages do not meet contractive condition, and it is obviously sparse in the distribution of non-message to be compressed to meet the distribution of message to be compressed of contractive condition.According to the logic of the above-mentioned order-preserving method for message compression, if message to be compressed is not slowly admitted to compression request queue, the message non-to be compressed in adhoc buffer queue will wait for that this message to be compressed is carried in compression request queue always, by there will be non-message to be compressed to accumulate the phenomenon of too high delay, even affect the correctness of TCP performance and TCP upper-layer protocol like this.
For example, as shown in Figure 4, the sparse property contrast of non-message to be compressed and message to be compressed, in figure, ACK represents ACK message and incidentally minute quantity TCP payload or the message without TCP payload, this phenomenon is prevalent in the data transmission procedure of unidirectional propelling movement of chunk data.
In order to process more neatly the large message of this sparse property difference, above-mentioned order-preserving method is optimized to design.In an embodiment of the present invention,, avoid pushing by message to be compressed obviously more than the sight of message to be compressed for non-message to be compressed, but exported by the direct active push of non-message to be compressed; Before the non-message to be compressed of active push, must ensure there is no the message in current session in compressing card, otherwise may be out of order, so need the number of all current session messages in the queue of perception compressing card.Particularly, in one embodiment of the invention, as shown in Figure 5, this order-preserving method for message compression is optimized and can be comprised:
S501, obtains the number of current message to be compressed in compression request queue.
For example, the session can be in each message adds Fly_in_HW_cnt variable, and this variable can represent the number of current clear text in compressing card, can safeguard the current still all messages in compression request queue and compression response queue.For example, in the time that a message to be compressed enters compression request queue, can carry out Fly_in_HW_cnt++ operation; In the time that a compression message to be compressed after treatment goes out to compress response queue, can carry out Fly_in_HW_cnt--operation.That is to say, can, by obtaining the current value of Fly_in_HW_cnt variable, can obtain the number of current message to be compressed in compression request queue.
S502, when compression message to be compressed after treatment goes out team by compression response queue, and when the number of the current message to be compressed in compression request queue becomes pre-set threshold value, the current all non-message to be compressed in adhoc buffer queue is exported in next stage treatment system or transmission network.
Wherein, in an embodiment of the present invention, pre-set threshold value can be 0.For example, as shown in Figure 6, while going out group, work as Fly_in_HW_cnt--=0, be when in compression request queue, last message to be compressed goes out group, simultaneously current while also having non-message to be compressed in adhoc buffer queue Order_buffer, now, can by force all non-message to be compressed of current record in Order_buffer directly be outputed to next stage by Flush Order_buffer and process or output to network interface card, without the queue of process compressing card.Wherein, Flush Order_buffer can safeguard all interim non-messages to be compressed.Thus, deadlock and high latency have been avoided, Optimal performance.
S503, when judging that the current message receiving is non-message to be compressed, and the number of current message to be compressed in compression request queue is while equaling pre-set threshold value, and non-message to be compressed is directly exported in next stage treatment system or transmission network.
For example, as shown in Figure 6, while joining the team, work as Fly_in_HW_cnt==0, be current while not having message to be compressed to be sent in compression request queue, simultaneously current while not having non-message to be compressed in adhoc buffer queue Order_buffer, now, the message non-to be compressed that does not meet contractive condition in TCP Flow, without through Order_buffer buffering, can directly enter next stage and process or output to compressing card.Like this, can avoid deadlock and high latency, Optimal performance.
In sum, this optimisation strategy, fully from single session granularity angle, is considered the accumulated delays control of non-message to be compressed in order_buffer,, for the stream non-to be compressed of continuous large section, can adaptively complete transparent transmission function.That is to say, for non-message to be compressed, the directly hardware handles flow process of bypass compressing card, compressing card I/O bandwidth and CPU service efficiency are optimized, avoid the compression bandwidth wasting of resources, and, in the time of Fly_in_HW_cnt--==0, by force the message non-to be compressed in adhoc buffer queue is directly exported to next stage by Flush Order_buffer and process or export network interface card to, reduced the accumulation processing delay in non-packet order preserving process to be compressed.
From above-described embodiment, obtain the number of current non-message to be compressed in the number of current message to be compressed in compression request queue and adhoc buffer queue, when the number of the current message to be compressed in compression request queue equals pre-set threshold value, and when the number of the current non-message to be compressed in adhoc buffer queue is not equal to pre-set threshold value, the current non-message to be compressed in adhoc buffer queue is exported in next stage treatment system or transmission network; When the number of the current message to be compressed in compression request queue equals pre-set threshold value, and when the number of the current non-message to be compressed in adhoc buffer queue equals pre-set threshold value, the message non-to be compressed that does not meet contractive condition is directly exported in next stage treatment system or transmission network, compressing card I/O bandwidth and CPU service efficiency are optimized, avoid the compression bandwidth wasting of resources, and reduced the accumulation processing delay in non-packet order preserving process to be compressed.
In order to realize above-described embodiment, the present invention also proposes a kind of order-preserving device for message compression.
A kind of order-preserving device for message compression that the embodiment of the present invention proposes, comprising: receiver module, for receiving multiple messages; The first judge module, for judging successively whether each message meets contractive condition; Sending module, for the message to be compressed that meets contractive condition is sent to compression request queue, and is sent to adhoc buffer queue by the message non-to be compressed that does not meet contractive condition; The second judge module, before message to be compressed being sent to compression request queue whenever sending module, judges currently in adhoc buffer queue whether have a non-message to be compressed; Sending module also when judging that at the second judge module adhoc buffer queue is current and have non-message to be compressed, is sent to non-message to be compressed and message to be compressed in memory cell corresponding to respective meta-data in compression request queue; Compression order-preserving module, for the message to be compressed of compression request queue is compressed to processing, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence.
Fig. 7 is the structural representation for the order-preserving device of message compression according to an embodiment of the invention.
As shown in Figure 7, this order-preserving device that is used for message compression can comprise: receiver module 100, the first judge module 200, sending module 300, the second judge module 400 and compression order-preserving module 500.
Particularly, receiver module 100 is for receiving multiple messages.The first judge module 200 is for judging successively whether each message meets contractive condition.More specifically, receiver module 100 can receive the multiple messages that comprise in TCP stream, and afterwards, the first judge module 200 can judge whether each message meets contractive condition successively, to the message that meets contractive condition is compressed, the message that does not meet contractive condition is not compressed.
In one embodiment of the invention, the first judge module 200 is also for obtaining the length of each message that receiver module 100 receives, and whether the length that judges each message be more than or equal to preset value, and in the time being more than or equal to preset value, judge that message meets contractive condition.Wherein, in an embodiment of the present invention, preset value can be by default.For example, system can be determined according to the actual conditions of message length the size of this preset value, can collect a large amount of messages, first obtains the length of these messages, afterwards these length is averaging, and to obtain mean value, can determine preset value according to this mean value afterwards.
In another embodiment of the present invention, the first judge module 200, also in the time that the length that judges each message is less than preset value, can judge that message does not meet contractive condition.
Thus, can judge that whether this message meets contractive condition, has improved the accuracy of judged result according to the length of message.
For example, as shown in Figure 3, continued presence P0, P1 in the TCP Flow that receiver module 100 receives ... these seven messages of P6, the first judge module 200 can obtain the length of these seven messages successively, and judge the limited length of message P2, P4, P5, and be less than preset value, that is to say, message P2, P4, P5 are the message that does not meet contractive condition, can be without it is compressed; The length of judging message P0, P1, P3, P6 is greater than preset value, and message P0, P1, P3, P6 are the message that meets contractive condition, need compress it.
Sending module 300 is for the message to be compressed that meets contractive condition is sent to compression request queue, and the message non-to be compressed that does not meet contractive condition is sent to adhoc buffer queue.
For example, as shown in Figure 3, in order optimizing, P2, P4, this message without compression income of P5 to be compressed to the coprocessor expense causing, to avoid message P2, P4, P5 to enter the I/O stage.Therefore, in the time processing message P3, total P0, P1 and these three messages to be compressed of P3 in compression request queue, message P2 will be by filtering.Now, if directly message P2 be transparent to next stage message processing procedure or output to network interface card, may cause message P2 and output in transmission network before message P0 and P1, thereby cause out of order generation.
For this reason, in an embodiment of the present invention, sending module 300 can be sent to compression request queue by the message P0 to be compressed, P1, P3, the P6 that meet contractive condition, and the message P2 non-to be compressed, P4, the P5 that do not meet contractive condition are sent in adhoc buffer queue.Wherein, as shown in Figure 3, Order_buffer can be in TCP Flow session structure and controls out of order adhoc buffer queue, for the non-message to be compressed of blotter.In addition, non-message P2 to be compressed, P4, P5 be without compression, and can join the team operation note in Order_buffer by tail of the queue, and can bypass compressibility and output in rear level system.
The second judge module 400 is for before being sent to compression request queue whenever sending module 300 by message to be compressed, judges currently in adhoc buffer queue whether to have a non-message to be compressed.For example, as shown in Figure 3, judge that at the first judge module 200 message P1 meets contractive condition, and before sending module 300 message P1 to be compressed is sent to compression request queue, the second judge module 400 can first judge currently in now adhoc buffer queue whether have a non-message to be compressed.
In one embodiment of the invention, sending module 300 also when judging that at the second judge module 400 adhoc buffer queue is current and do not have non-message to be compressed, can be sent to the message to be compressed that meets contractive condition in memory cell corresponding to respective meta-data in compression request queue.For example, before message P1 to be compressed is sent to compression request queue by sending module 300, the second judge module 400 judges and currently in now adhoc buffer queue do not have a non-message to be compressed, and sending module 300 can be sent to this message P1 to be compressed in memory cell corresponding to respective meta-data (metadata) in compression request queue afterwards.
In one embodiment of the invention, sending module 300 also when judging that at the second judge module 400 adhoc buffer queue is current and have non-message to be compressed, is sent to non-message to be compressed and message to be compressed in memory cell corresponding to respective meta-data in compression request queue.
More specifically, in an embodiment of the present invention, it is current while having non-message to be compressed in the second judge module 400 judges adhoc buffer queue, sending module 300 can first extract the message non-to be compressed of current existence in adhoc buffer queue, can be sent in compression request queue meeting together with the message to be compressed of contractive condition and the message non-to be compressed of extraction afterwards.Wherein, in an embodiment of the present invention, non-message to be compressed can be recorded in the metadata that message to be compressed is corresponding with pointer form.In addition, in one embodiment of the invention, metadata has the memory address of message to be compressed.That is to say, whenever existing message to be compressed to join the team when operation, sending module 300 can extract the interim chained list of oder_buffer team's head instruction bypass message and be recorded in the metadata of compression queue continuous item.
For example, as shown in Figure 3, in the time that the first judge module 200 judges that message P2 does not meet contractive condition, sending module 300 can first be sent to this non-message P2 to be compressed in adhoc buffer queue.Afterwards, the first judge module 200 judges that message P3 meets contractive condition, and before message P3 to be compressed is sent to compression request queue by sending module 300, the second judge module 400 judges and currently in now adhoc buffer queue has a non-message P2 to be compressed.Sending module 300 can first extract the message P2 non-to be compressed of current existence in adhoc buffer queue, and team's head pointer of the interim chained list of Order_buffer is put to sky.Finally, message P3 to be compressed can be sent in compression request queue together with non-message P2 to be compressed.
And for example, as shown in Figure 3, the first judge module 200 judges that message P6 meets contractive condition, and in the time that message P6 to be compressed is sent to compression request queue by sending module 300, message P6 to be compressed can bring the message P4 non-to be compressed in adhoc buffer queue in compression request queue together with P5.
Compression order-preserving module 500 is compressed processing for the message to be compressed to compression request queue, and by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence.
More specifically, in an embodiment of the present invention, compression order-preserving module 500 can first be obtained message to be compressed according to the memory address in metadata, and treats compressed packet and compress processing.Afterwards, the memory address of the message to be compressed in metadata can be replaced with to the memory address of compression message to be compressed after treatment.Finally, when message to be compressed compress finish dealing with after and by when compression is taken away response queue, the pointer recording in can the each metadata of first Sequential output, and start traversal from the head of pointer, export successively non-message to be compressed and compression message to be compressed after treatment.
For example, as shown in Figure 3, at a time, there is message P3 to be compressed in compression request queue, simultaneously the subsidiary non-message P2 to be compressed of pointer record of message P3 to be compressed; There is message P6 to be compressed in compression request queue, message P6 to be compressed enters after compression request queue simultaneously, can record team's head pointer of order_buffer in the associated pointers of message P6 to be compressed.
For example, in the time that compression order-preserving module 500 is treated compressed packet P3 and is gone out team's operation, the out of order pointer of first can the current message P3 to be compressed of Sequential output corresponding metadata record, from this pointer head traversal and export successively non-message P2 to be compressed, finally exports message P3 to be compressed.Thus, can guarantee non-message P2 to be compressed, P4 and P5 without actual compression process, do not consume compression bandwidth, do not cause coprocessor I/O process, do not affect overall compression performance, finally can reach the order-preserving process of data message in TCP Flow yet simultaneously yet.
The order-preserving device for message compression of the embodiment of the present invention, before message to be compressed is sent to compression request queue by sending module, judge currently in adhoc buffer queue whether have a non-message to be compressed by the second judge module, sending module is current while having non-message to be compressed, non-message to be compressed and message to be compressed are sent in memory cell corresponding to respective meta-data in compression request queue, compression order-preserving module is after compressing processing to the message to be compressed in compression request queue, by compression, response queue exports the message non-to be compressed in compression message to be compressed after treatment and metadata in next stage treatment system or transmission network according to the order of sequence, at least have the following advantages: (1) carries out data compression based on TCP Flow granularity, different TCP Flow allow to adopt different compression methods, realize the data compression transparent to business datum, (2) carry out data compression by compression coprocessor, between coprocessor and CPU, carry out asynchronous operation, improved the systematic function of compression device, (3) filter by the message that message length is less than to preset value, avoided small messages compression without compression income, improved the utilance of pay(useful) load and the I/O performance of optimization coprocessor of data compression coprocessor.
Fig. 8 is the structural representation of the order-preserving device for message compression of a specific embodiment according to the present invention.
As shown in Figure 8, this order-preserving device that is used for message compression can comprise: receiver module 100, the first judge module 200, sending module 300, the second judge module 400, compression order-preserving module 500 and the first acquisition module 600.
Particularly, the first acquisition module 600 is for obtaining the number of the current message to be compressed of compression request queue.For example, the session that the first acquisition module 600 can be in each message adds Fly_in_HW_cnt variable, this variable can represent the number of current clear text in compressing card, can safeguard the current still all messages in compression request queue and compression response queue.For example, in the time that a message to be compressed enters compression request queue, can carry out Fly_in_HW_cnt++ operation; In the time that a compression message to be compressed after treatment goes out to compress response queue, can carry out Fly_in_HW_cnt--operation.That is to say, the first acquisition module 600 can, by obtaining the current value of Fly_in_HW_cnt variable, can obtain the number of current message to be compressed in compression request queue.
In one embodiment of the invention, compression order-preserving module 500 is also for going out team at compression message to be compressed after treatment by compression response queue, and when the number of the current message to be compressed in compression request queue becomes pre-set threshold value, the current all non-message to be compressed in adhoc buffer queue is exported in next stage treatment system or transmission network.Wherein, in an embodiment of the present invention, pre-set threshold value can be 0.
For example, as shown in Figure 6, while going out group, work as Fly_in_HW_cnt--=0, be when in compression request queue, last message to be compressed goes out group, simultaneously current while also having non-message to be compressed in adhoc buffer queue Order_buffer, now, compression order-preserving module 500 can directly output to all non-message to be compressed of current record in Order_buffer by force next stage by Flush Order_buffer and process or output to network interface card, without the queue of process compressing card.Wherein, FlushOrder_buffer can safeguard all interim non-messages to be compressed.Thus, deadlock and high latency have been avoided, Optimal performance.
In one embodiment of the invention, compression order-preserving module 500 is also for judging that at the first judge module the current message receiving is non-message to be compressed, and when the number of the current message to be compressed in compression request queue equals pre-set threshold value, non-message to be compressed is directly exported in next stage treatment system or transmission network.
For example, as shown in Figure 6, while joining the team, work as Fly_in_HW_cnt==0, be current while not having message to be compressed to be sent in compression request queue, simultaneously current while not having non-message to be compressed in adhoc buffer queue Order_buffer, now, the message non-to be compressed that does not meet contractive condition in TCP Flow, without through Order_buffer buffering, can directly enter next stage and process or output to compressing card.Like this, can avoid deadlock and high latency, Optimal performance.
In sum, this optimisation strategy, fully from single session granularity angle, is considered the accumulated delays control of non-message to be compressed in order_buffer,, for the stream non-to be compressed of continuous large section, can adaptively complete transparent transmission function.That is to say, for non-message to be compressed, the directly hardware handles flow process of bypass compressing card, compressing card I/O bandwidth and CPU service efficiency are optimized, avoid the compression bandwidth wasting of resources, and, in the time of Fly_in_HW_cnt--==0, by force the message non-to be compressed in adhoc buffer queue is directly exported to next stage by Flush Order_buffer and process or export network interface card to, reduced the accumulation processing delay in non-packet order preserving process to be compressed.
The order-preserving device for message compression of the embodiment of the present invention, obtain the number of current message to be compressed in compression request queue by the first acquisition module, the second acquisition module obtains the number of current non-message to be compressed in adhoc buffer queue, the number of the current to be compressed message of compression order-preserving module in compression request queue equals pre-set threshold value, and when the number of the current non-message to be compressed in adhoc buffer queue is not equal to pre-set threshold value, the current non-message to be compressed in adhoc buffer queue is exported in next stage treatment system or transmission network; The number of the current message to be compressed in compression request queue equals pre-set threshold value, and when the number of the current non-message to be compressed in adhoc buffer queue equals pre-set threshold value, the message non-to be compressed that does not meet contractive condition is directly exported in next stage treatment system or transmission network, compressing card I/O bandwidth and CPU service efficiency are optimized, avoid the compression bandwidth wasting of resources, and reduced the accumulation processing delay in non-packet order preserving process to be compressed.
Any process of otherwise describing in flow chart or at this or method are described and can be understood to, represent to comprise that one or more is for realizing module, fragment or the part of code of executable instruction of step of specific logical function or process, and the scope of the preferred embodiment of the present invention comprises other realization, wherein can be not according to order shown or that discuss, comprise according to related function by the mode of basic while or by contrary order, carry out function, this should be understood by embodiments of the invention person of ordinary skill in the field.
The logic and/or the step that in flow chart, represent or otherwise describe at this, for example, can be considered to the sequencing list of the executable instruction for realizing logic function, may be embodied in any computer-readable medium, use for instruction execution system, device or equipment (as computer based system, comprise that the system of processor or other can and carry out the system of instruction from instruction execution system, device or equipment instruction fetch), or use in conjunction with these instruction execution systems, device or equipment.With regard to this specification, " computer-readable medium " can be anyly can comprise, device that storage, communication, propagation or transmission procedure use for instruction execution system, device or equipment or in conjunction with these instruction execution systems, device or equipment.The example more specifically (non-exhaustive list) of computer-readable medium comprises following: the electrical connection section (electronic installation) with one or more wirings, portable computer diskette box (magnetic device), random-access memory (ram), read-only memory (ROM), the erasable read-only memory (EPROM or flash memory) of editing, fiber device, and portable optic disk read-only memory (CDROM).In addition, computer-readable medium can be even paper or other the suitable medium that can print described program thereon, because can be for example by paper or other media be carried out to optical scanner, then edit, decipher or process in electronics mode and obtain described program with other suitable methods if desired, be then stored in computer storage.
Should be appreciated that each several part of the present invention can realize with hardware, software, firmware or their combination.In the above-described embodiment, multiple steps or method can realize with being stored in software or the firmware carried out in memory and by suitable instruction execution system.For example, if realized with hardware, the same in another embodiment, can realize by any one in following technology well known in the art or their combination: there is the discrete logic for data-signal being realized to the logic gates of logic function, there is the application-specific integrated circuit (ASIC) of suitable combinational logic gate circuit, programmable gate array (PGA), field programmable gate array (FPGA) etc.
Those skilled in the art are appreciated that realizing all or part of step that above-described embodiment method carries is can carry out the hardware that instruction is relevant by program to complete, described program can be stored in a kind of computer-readable recording medium, this program, in the time carrying out, comprises step of embodiment of the method one or a combination set of.
In addition, the each functional unit in each embodiment of the present invention can be integrated in a processing module, can be also that the independent physics of unit exists, and also can be integrated in a module two or more unit.Above-mentioned integrated module both can adopt the form of hardware to realize, and also can adopt the form of software function module to realize.If described integrated module realizes and during as production marketing independently or use, also can be stored in a computer read/write memory medium using the form of software function module.
The above-mentioned storage medium of mentioning can be read-only memory, disk or CD etc.
In addition, term " first ", " second " be only for describing object, and can not be interpreted as instruction or hint relative importance or the implicit quantity that indicates indicated technical characterictic.Thus, one or more these features can be expressed or impliedly be comprised to the feature that is limited with " first ", " second ".In description of the invention, the implication of " multiple " is two or more, unless otherwise expressly limited specifically.
In the description of this specification, the description of reference term " embodiment ", " some embodiment ", " example ", " concrete example " or " some examples " etc. means to be contained at least one embodiment of the present invention or example in conjunction with specific features, structure, material or the feature of this embodiment or example description.In this manual, to the schematic statement of above-mentioned term not must for be identical embodiment or example.And, specific features, structure, material or the feature of description can one or more embodiment in office or example in suitable mode combination.In addition,, not conflicting in the situation that, those skilled in the art can carry out combination and combination by the feature of the different embodiment that describe in this specification or example and different embodiment or example.
Although illustrated and described embodiments of the invention above, be understandable that, above-described embodiment is exemplary, can not be interpreted as limitation of the present invention, and those of ordinary skill in the art can change above-described embodiment within the scope of the invention, amendment, replacement and modification.
Claims (14)
1. for an order-preserving method for message compression, it is characterized in that, comprising:
Receive multiple messages, and judge successively whether each described message meets contractive condition;
The message to be compressed that meets described contractive condition is sent to compression request queue, and the message non-to be compressed that does not meet described contractive condition is sent to adhoc buffer queue;
Before described message to be compressed is sent to described compression request queue, judge currently in described adhoc buffer queue whether have a non-message to be compressed;
Have described non-message to be compressed if current, described non-message to be compressed and described message to be compressed are sent in memory cell corresponding to respective meta-data in described compression request queue; And
Message described to be compressed in described compression request queue is compressed to processing, and by compression, response queue exports the described non-message to be compressed in compression message to be compressed after treatment and described metadata in next stage treatment system or transmission network according to the order of sequence.
2. method according to claim 1, is characterized in that, described memory cell corresponding to respective meta-data that non-message to be compressed and described message to be compressed are sent in described compression request queue comprises:
Extract the described non-message to be compressed of current existence in described adhoc buffer queue;
To meet the message described to be compressed of described contractive condition and the described non-message to be compressed of extraction is sent in described compression request queue, wherein, described non-message to be compressed is recorded in the metadata that described message to be compressed is corresponding with pointer form.
3. method according to claim 1, is characterized in that, described metadata has the memory address of described message to be compressed, described to the message described to be compressed in compression request queue compress process comprise:
Obtain described message to be compressed according to described memory address, and described message to be compressed is compressed to processing;
The memory address of the described message to be compressed in described metadata is replaced with to the memory address of compression message to be compressed after treatment.
4. method according to claim 2, is characterized in that, described by compressing, response queue exports the described non-message to be compressed in compression message to be compressed after treatment and described metadata to next stage treatment system according to the order of sequence or transmission network comprises:
The pointer recording in metadata described in Sequential output, and start traversal from the head of described pointer, export successively described non-message to be compressed and compression described message to be compressed after treatment.
5. method according to claim 1, is characterized in that, judges that described message meets described contractive condition and comprises:
Obtain the length of each described message;
Whether the length that judges each described message is more than or equal to preset value;
If be more than or equal to described preset value, judge that described message meets described contractive condition.
6. method according to claim 1, is characterized in that, also comprises:
Obtain the number of current message to be compressed in described compression request queue;
When described compression message to be compressed after treatment goes out team by compression response queue, and when the number of the current message to be compressed in described compression request queue becomes pre-set threshold value, the current all non-message to be compressed in described adhoc buffer queue is exported in next stage treatment system or transmission network.
7. method according to claim 6, is characterized in that, also comprises:
When judging that the current message receiving is non-message to be compressed, and the number of current message to be compressed in described compression request queue is while equaling described pre-set threshold value, and described non-message to be compressed is directly exported in next stage treatment system or transmission network.
8. for an order-preserving device for message compression, it is characterized in that, comprising:
Receiver module, for receiving multiple messages;
The first judge module, for judging successively whether each described message meets contractive condition;
Sending module, for the message to be compressed that meets described contractive condition is sent to compression request queue, and is sent to adhoc buffer queue by the message non-to be compressed that does not meet described contractive condition;
The second judge module, before described message to be compressed being sent to described compression request queue whenever described sending module, judges currently in described adhoc buffer queue whether have a non-message to be compressed;
Described sending module also when judging that at described the second judge module described adhoc buffer queue is current and have described non-message to be compressed, is sent to described non-message to be compressed and described message to be compressed in memory cell corresponding to respective meta-data in described compression request queue;
Compression order-preserving module, for the message described to be compressed of described compression request queue is compressed to processing, by compression, response queue exports the described non-message to be compressed in compression message to be compressed after treatment and described metadata in next stage treatment system or transmission network according to the order of sequence.
9. device according to claim 8, it is characterized in that, described sending module is also for the described non-message to be compressed that extracts the current existence of described adhoc buffer queue, and will meet the message described to be compressed of described contractive condition and the described non-message to be compressed of extraction is sent in described compression request queue, wherein, described non-message to be compressed is recorded in the metadata that described message to be compressed is corresponding with pointer form.
10. device according to claim 8, it is characterized in that, described metadata has the memory address of described message to be compressed, described compression order-preserving module also for: obtain described message to be compressed according to described memory address, and described message to be compressed is compressed to processing, and the memory address of the described message to be compressed in described metadata is replaced with to the memory address of compression message to be compressed after treatment.
11. devices according to claim 9, it is characterized in that, described compression order-preserving module is specifically for the pointer recording in metadata described in Sequential output, and starts traversal from the head of described pointer, exports successively described non-message to be compressed and compression described message to be compressed after treatment.
12. devices according to claim 8, it is characterized in that, described the first judge module is also for the length of obtaining each described message that described receiver module receives, and whether the length that judges each described message is more than or equal to preset value, and in the time being more than or equal to described preset value, judge that described message meets described contractive condition.
13. devices according to claim 8, is characterized in that, also comprise:
The first acquisition module, for obtaining the number of the current message to be compressed of described compression request queue; Wherein
Described compression order-preserving module is also for going out team at described compression message to be compressed after treatment by compression response queue, and when the number of the current message to be compressed in described compression request queue becomes pre-set threshold value, the current all non-message to be compressed in described adhoc buffer queue is exported in next stage treatment system or transmission network.
14. devices according to claim 13, it is characterized in that, described compression order-preserving module is also for judging that at described the first judge module the current message receiving is non-message to be compressed, and when the number of the current message to be compressed in described compression request queue equals described pre-set threshold value, described non-message to be compressed is directly exported in next stage treatment system or transmission network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410086621.6A CN103888452B (en) | 2014-03-10 | 2014-03-10 | For the order-preserving method and device of message compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410086621.6A CN103888452B (en) | 2014-03-10 | 2014-03-10 | For the order-preserving method and device of message compression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103888452A true CN103888452A (en) | 2014-06-25 |
| CN103888452B CN103888452B (en) | 2017-04-05 |
Family
ID=50957172
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410086621.6A Active CN103888452B (en) | 2014-03-10 | 2014-03-10 | For the order-preserving method and device of message compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103888452B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109032506A (en) * | 2018-06-27 | 2018-12-18 | 郑州云海信息技术有限公司 | A kind of memory system data compression method, system and equipment and storage medium |
| CN112104658A (en) * | 2020-09-17 | 2020-12-18 | 山东方寸微电子科技有限公司 | Message compression method and system |
| WO2021174700A1 (en) * | 2020-03-03 | 2021-09-10 | 平安科技（深圳）有限公司 | Data compression method and apparatus, computer device, and storage medium |
| CN116155828A (en) * | 2022-12-21 | 2023-05-23 | 北京云豹创芯智能科技有限公司 | Message order keeping method and device for multiple virtual queues, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020118224A1 (en) * | 2000-12-27 | 2002-08-29 | Isaac Levanon | System and methods for network image delivery with dynamic viewing frustum optimized for limited bandwidth communication channels |
| US20030231647A1 (en) * | 2000-11-08 | 2003-12-18 | Yevgeniy Petrovykh | Method and apparatus for optimizing response time to events in queue |
| CN102571572A (en) * | 2011-12-28 | 2012-07-11 | 中国人民解放军国防科学技术大学 | Short message satellite communication-based data transmission method and device |
| CN103369593A (en) * | 2012-04-05 | 2013-10-23 | 中兴通讯股份有限公司 | Method for compressing and decompressing Ethernet message and network element equipment |
-
2014
- 2014-03-10 CN CN201410086621.6A patent/CN103888452B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030231647A1 (en) * | 2000-11-08 | 2003-12-18 | Yevgeniy Petrovykh | Method and apparatus for optimizing response time to events in queue |
| US20020118224A1 (en) * | 2000-12-27 | 2002-08-29 | Isaac Levanon | System and methods for network image delivery with dynamic viewing frustum optimized for limited bandwidth communication channels |
| CN102571572A (en) * | 2011-12-28 | 2012-07-11 | 中国人民解放军国防科学技术大学 | Short message satellite communication-based data transmission method and device |
| CN103369593A (en) * | 2012-04-05 | 2013-10-23 | 中兴通讯股份有限公司 | Method for compressing and decompressing Ethernet message and network element equipment |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109032506A (en) * | 2018-06-27 | 2018-12-18 | 郑州云海信息技术有限公司 | A kind of memory system data compression method, system and equipment and storage medium |
| WO2021174700A1 (en) * | 2020-03-03 | 2021-09-10 | 平安科技（深圳）有限公司 | Data compression method and apparatus, computer device, and storage medium |
| CN112104658A (en) * | 2020-09-17 | 2020-12-18 | 山东方寸微电子科技有限公司 | Message compression method and system |
| CN116155828A (en) * | 2022-12-21 | 2023-05-23 | 北京云豹创芯智能科技有限公司 | Message order keeping method and device for multiple virtual queues, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103888452B (en) | 2017-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103888452A (en) | Storage method and device for message compression | |
| US9807189B2 (en) | Data transfer device and data transfer system using adaptive compression algorithm | |
| CN107257329B (en) | A kind of data sectional unloading sending method | |
| Jeannot et al. | Adaptive online data compression | |
| CN102143039B (en) | Data segmentation method and equipment for data compression | |
| CN105653484B (en) | A kind of deblocking compression multi-channel transmission method | |
| CN102694554A (en) | Data compression devices, operating methods thereof, and data processing apparatuses including the same | |
| CN103207904A (en) | Method for delivering search results and search engine | |
| EP3364625B1 (en) | Device, system and method for adaptive payload compression in a network fabric | |
| CN110391873B (en) | Method, apparatus and computer program product for determining a data transfer mode | |
| CN103731476A (en) | Method and device for improving information push speed | |
| CN103312336A (en) | Data compression method and device | |
| US20140289427A1 (en) | Hierarchical bitmasks for indicating the presence or absence of serialized data fields | |
| CN111324449A (en) | Transaction storage and broadcasting method, device and storage medium of memory pool | |
| US10673768B2 (en) | Managing data compression | |
| CN101771718A (en) | Clipboard synchronous method and system | |
| CN104486442A (en) | Method and device for transmitting data of distributed storage system | |
| CN104618371A (en) | Data downloading method, device and system | |
| CN108347300A (en) | A kind of method, apparatus and device for encoding and decoding of adjustment Polar codes | |
| CN103701865A (en) | Data transmission method and system | |
| CN110990490B (en) | Method, device, equipment and medium for checking in blockchain network | |
| JP7075077B2 (en) | Backup server, backup method, program, storage system | |
| CN102647337B (en) | Network packet transmission method and system | |
| CN114944887A (en) | Block transfer method, computer device, and storage medium | |
| Ooshita et al. | Efficient gather operation in heterogeneous cluster systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |