IP Library Granted Patent US 10,826,962
Granted Patent B2
US 10,826,962 · App. 14/975,899 · Granted Nov 3, 2020

Techniques for dynamic shared compression

Inventors: Ofir Manor (Tel-Aviv, IL); Nir Livneh (Petach Tikva, IL)
Assignee: Equalum Ltd.
H04L65/607
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,826,962
App. No.
14/975,899
Granted
Nov 3, 2020
Kind
B2
Abstract

To realize some of the advantages discussed above, there is provided a computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network. The method comprises receiving by the first node a first plurality of data inputs from the at least a second node. At least a pattern corresponding to the received first plurality of data inputs is continuously determined. Compression metadata corresponding to the at least a pattern are periodically generated. The compression metadata is stored in a memory. The compression metadata is provided to the at least a second node.

Claims (35)

1. A computerized method for dynamic shared compression between a first node and at least a second node communicatively connected over a network, the method comprising:

receiving by the first node a first plurality of data inputs from the at least a second node;

continuously determining at least a pattern corresponding to the received first plurality of data inputs;

periodically generating compression metadata corresponding to the at least a pattern;

storing the compression metadata in a memory; and

providing the compression metadata to the at least a second node for use by the second node to at least compress subsequent data to be transmitted to the first node;

wherein the compression metadata comprises a data set smaller than a data set of the determined pattern.

2. The computerized method of claim 1 , further comprising:

receiving by the first node a second plurality of data inputs from the second node, the second plurality of data inputs having been compressed by the second node using the compression metadata; and

decompressing at the first node the second plurality of data inputs using the stored compression metadata.

3. The computerized method of claim 2 , wherein the compression metadata further comprises a version number.

4. The computerized method of claim 2 , wherein the received second plurality of data inputs further comprise a first compression metadata version number, and the stored compression metadata further comprises a second version number.

5. The computerized method of claim 4 , wherein decompressing is performed upon determination that the first compression metadata version number and the second version number are identical.

6. The computerized method of claim 1 , wherein the first node provides unique compression metadata to each of a plurality of second nodes.

7. The computerized method of claim 1 , wherein the first node provides shared compression metadata to each of a plurality of second nodes.

8. The computerized method of claim 1 , wherein the compression metadata is any of: a symbol map, and delta encoding.

9. A computerized method for dynamic shared compression, the method comprising:

receiving a first plurality of data inputs;

continuously determining at least a pattern corresponding to the received first plurality of data inputs;

periodically generating compression metadata further corresponding to the at least a pattern, such that the compression metadata is smaller than the determined at least a pattern;

providing the compression metadata from a node in which it is generated to another node;

using the compression metadata for compression of data transmitted from the node and decompression of data received from the other node.

10. The computerized method of claim 9 , wherein the compression metadata further comprises a version number.

11. The computerized method of claim 9 , wherein the compression metadata is shared with at least one more computer node.

12. The computerized method of claim 9 , wherein the compression metadata is any of: a symbol map, and delta encoding.

13. A computer node for performing dynamic shared data compression comprising:

a processing unit;

a memory communicatively connected to the processing unit;

the memory comprising instructions to enable the processing unit to:

continuously determine at least a pattern from input data received from another computer node; and

generate compression metadata from the determined at least a pattern, wherein the compression metadata is smaller than the generated at least a pattern;

transmitting the compression metadata from the computer node to at least the other computer for use therein to at least compress subsequent data to be transmitted from the other computer node to the computer node.

14. The computer node of claim 13 , wherein the compression metadata further comprises a version number.

15. The computer node of claim 13 , wherein the compression metadata is shared with one or more computer nodes.

16. The computer node of claim 13 , wherein the compression metadata is any of: a symbol map, and delta encoding.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 9, 2024
From: EQUALUM LTD.
To: GOOGLE LLC
Reel/Frame 067042/0362 →
RELEASE OF SECURITY INTEREST Recorded May 15, 2023
From: SILICON VALLEY BANK
To: EQUALUM LTD.
Reel/Frame 063645/0669 →
SECURITY INTEREST Recorded Jun 1, 2020
From: EQUALUM LTD.
To: SILICON VALLEY BANK
Reel/Frame 052804/0307 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2015
From: MANOR, OFIR; LIVNEH, NIR
To: EQUALUM LTD.
Reel/Frame 037338/0289 →
Continuity (2)
Provisional Application 62191637 · Jul 13, 2015
Related Publication 20170019449A1 · Jan 19, 2017