[go: up one dir, main page]

WO2018042233A1 - Application level compression - Google Patents

Application level compression Download PDF

Info

Publication number
WO2018042233A1
WO2018042233A1 PCT/IB2016/055292 IB2016055292W WO2018042233A1 WO 2018042233 A1 WO2018042233 A1 WO 2018042233A1 IB 2016055292 W IB2016055292 W IB 2016055292W WO 2018042233 A1 WO2018042233 A1 WO 2018042233A1
Authority
WO
WIPO (PCT)
Prior art keywords
application code
client
server side
side application
library
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.)
Ceased
Application number
PCT/IB2016/055292
Other languages
French (fr)
Inventor
Pratik Sharma
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to PCT/IB2016/055292 priority Critical patent/WO2018042233A1/en
Publication of WO2018042233A1 publication Critical patent/WO2018042233A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/55—Compression Theory, e.g. compression of random number, repeated compression
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6052—Synchronisation of encoder and decoder

Definitions

  • client side application code and server side application code are provided to client side application code and server side application code as a separate library.
  • Both client side application code and server side application code here have the capability of invoking compression and decompression facilities provided by the library and hence they register with the respective libraries on the client side and server side with the same unique application identifier helping them differentiate from other client- server applications.
  • Client side application code and server side application code also register with the respective libraries provided to them, the socket descriptors to uniquely identify various connection endpoints for different connections for reading and writing. So for every connection both client and server side libraries maintain a pair of application identifier and a socket descriptor for reading and writing.
  • client side application code and server side application code are provided with a configurable parameter to choose a compression algorithm like Huffman coding, Lempel-Ziv- Welch (LZW) etc.
  • LZW Lempel-Ziv- Welch
  • the client or server side application code which wants to send data to the other end invokes the library provided and if the data to be transferred is above a certain threshold then it sends a special packet to the other end including the application identifier, total compressed data bytes to be transferred which is
  • the library at the other end on receiving the total number of compressed data bytes decompresses the data based on the information it received in the special packet for the requisite application and the application code at the other end then processes decompressed data.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer And Data Communications (AREA)
  • Communication Control (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

In this invention we provide application level compression. Compression and decompression capabilities are provided to client side application code and server side application code as a separate library. Both client side application code and server side application code here have the capability of invoking compression and decompression facilities provided by the library and hence they register with the respective libraries on the client side and server side with the same unique application identifier helping them differentiate from other client-server applications. Client side application code and server side application code also register with the respective libraries provided to them, the socket descriptors to uniquely identify various connection endpoints for different connections for reading and writing. So for every connection both client and server side libraries maintain a pair of application identifier and a socket descriptor for reading and writing. Along with the library, client side application code and server side application code are provided with a configurable parameter to choose a compression algorithm like Huffman coding, Lempel–Ziv–Welch (LZW) etc. In this invention for any data transfer, the client or server side application code which wants to send data to the other end invokes the library provided and if the data to be transferred is above a certain threshold then it sends a special packet to the other end including the application identifier, total compressed data bytes to be transferred which is calculated after compressing the original data bytes to be transferred and the compression algorithm to be used, with the help of socket descriptor provided to it for the connection. The library at the other end on receiving the total number of compressed data bytes decompresses the data based on the information it received in the special packet for the requisite application and the application code at the other end then processes decompressed data.

Description

Application Level Compression
In this invention compression and decompression capabilities are provided to client side application code and server side application code as a separate library. Both client side application code and server side application code here have the capability of invoking compression and decompression facilities provided by the library and hence they register with the respective libraries on the client side and server side with the same unique application identifier helping them differentiate from other client- server applications. Client side application code and server side application code also register with the respective libraries provided to them, the socket descriptors to uniquely identify various connection endpoints for different connections for reading and writing. So for every connection both client and server side libraries maintain a pair of application identifier and a socket descriptor for reading and writing. Along with the library, client side application code and server side application code are provided with a configurable parameter to choose a compression algorithm like Huffman coding, Lempel-Ziv- Welch (LZW) etc. In this invention for any data transfer, the client or server side application code which wants to send data to the other end invokes the library provided and if the data to be transferred is above a certain threshold then it sends a special packet to the other end including the application identifier, total compressed data bytes to be transferred which is
calculated after compressing the original data bytes to be transferred and the compression algorithm to be used, with the help of socket descriptor provided to it for the connection. The library at the other end on receiving the total number of compressed data bytes decompresses the data based on the information it received in the special packet for the requisite application and the application code at the other end then processes decompressed data.

Claims

Claims
1. In this invention compression and decompression capabilities are provided to client side application code and server side application code as a separate library. Both client side application code and server side application code here have the capability of invoking compression and decompression facilities provided by the library and hence they register with the respective libraries on the client side and server side with the same unique application identifier helping them differentiate from other client-server applications. It is one of the novel features of this invention.
2. Client side application code and server side application code also register with the respective libraries provided to them, the socket descriptors to uniquely identify various connection endpoints for different connections for reading and writing. So for every connection both client and server side libraries maintain a pair of application identifier and a socket descriptor for reading and writing. It is one of the novel features of this invention.
3. Other novel feature of this invention is that along with the library, client side
application code and server side application code are provided with a
configurable parameter to choose a compression algorithm like Huffman coding, Lempel-Ziv-Welch (LZW) etc.
4. Other novel feature of this invention is that for any data transfer, the client or server side application code which wants to send data to the other end invokes the library provided and if the data to be transferred is above a certain threshold then it sends a special packet to the other end including the application identifier, total compressed data bytes to be transferred which is calculated after compressing the original data bytes to be transferred and the compression algorithm to be used, with the help of socket descriptor provided to it for the connection. The library at the other end on receiving the total number of compressed data bytes
decompresses the data based on the information it received in the special packet for the requisite application and the application code at the other end then processes decompressed data.
PCT/IB2016/055292 2016-09-03 2016-09-03 Application level compression Ceased WO2018042233A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/IB2016/055292 WO2018042233A1 (en) 2016-09-03 2016-09-03 Application level compression

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2016/055292 WO2018042233A1 (en) 2016-09-03 2016-09-03 Application level compression

Publications (1)

Publication Number Publication Date
WO2018042233A1 true WO2018042233A1 (en) 2018-03-08

Family

ID=61300186

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2016/055292 Ceased WO2018042233A1 (en) 2016-09-03 2016-09-03 Application level compression

Country Status (1)

Country Link
WO (1) WO2018042233A1 (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6819271B2 (en) * 1999-01-29 2004-11-16 Quickshift, Inc. Parallel compression and decompression system and method having multiple parallel compression and decompression engines
WO2015073336A1 (en) * 2013-11-14 2015-05-21 Dupont Nicolas Thomas Mathieu System and method for improved data transmission

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6819271B2 (en) * 1999-01-29 2004-11-16 Quickshift, Inc. Parallel compression and decompression system and method having multiple parallel compression and decompression engines
WO2015073336A1 (en) * 2013-11-14 2015-05-21 Dupont Nicolas Thomas Mathieu System and method for improved data transmission

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
DHANANJOY DAS ET AL.: "NVM Compression-Hybrid Flash-Aware Application Level Compression", INFLOW, vol. 14, 5 October 2014 (2014-10-05), Broomfield, CO USA, XP055398380 *

Similar Documents

Publication Publication Date Title
US8902090B2 (en) Compressing and decompressing signal data
US10268380B2 (en) Methods, devices and systems for semantic-value data compression and decompression
Vestergaard et al. Generalized deduplication: Bounds, convergence, and asymptotic properties
CN104868922B (en) Data compression method and apparatus
EP2214315A1 (en) Method and device for encoding a bit sequence
Vestergaard et al. Lossless compression of time series data with generalized deduplication
CN104462524A (en) Data compression storage method for Internet of Things
JP2019522940A (en) General purpose data compression using SIMD engine
JP6073506B2 (en) Entropy changer and method
WO2018042233A1 (en) Application level compression
Parekar et al. Lossless data compression algorithm–a review
CN103312338B (en) For decoded device and method
JP5959474B2 (en) Encoding device, decoding device, method, and program
CN105630529A (en) Loading method of FPGA (Field Programmable Gate Array) configuration file, and decoder
JP6445486B2 (en) Sensor terminal
KR101006059B1 (en) Information Compression Method
JP5855777B2 (en) Data compression apparatus, data decoding apparatus, data compression method, data decoding method, and data compression and decoding system
Beirami et al. A novel correlation model for universal compression of parametric sources
KR20170114289A (en) Binary data compressed transfer method and appratus thereof
Jancy et al. Sequential coded data compression techniques for wireless sensor networks
CN104113345A (en) Decompression circuit and related decompression method
Das et al. Design an Algorithm for Data Compression using Pentaoctagesimal SNS
JP2012060376A (en) Data compression device, data decoding device, data compression method, data decoding method, and data compression and decoding system
CN101192304B (en) Image compression and decompression device and method for embedded system
Pasupulety et al. VaFLE: Value Flag Length Encoding for Images in a Multithreaded Environment

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16915020

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16915020

Country of ref document: EP

Kind code of ref document: A1