Two exclusive compression algorithms are use, one of them during transmission, and the other one during the uploading of the buffer files.

Compression through strings

It is based on replacing strings of equal characters for a compressed indicator that indicates the number of characters replaced and the character replaced. It is applied during transmission to each of the transmitted blocks.
It is particularly effective when the data contain repeated characters (logs filled with blanks, etc.).


It is a procedure of dynamic compression. It gives a high efficiency level, out of the transmission processes.
This service, used to compress data files, determines for each file the sequences of multiple characters that appear more frequently, and it replaces them for binary codes.

The batch compression service, before transmission or after reception, of the data files, is based on LZW algorithm. It is fully developed on C language, that implements the compression algorithm Lempel Zivwelch, to which it has been incorporated an additional implementation based on the opmitization technique "partial clearing on the fly".

The compression process is performed sequentially processing, one by one, the characters that compound the file to be compressed. With this procedure, we obtain a high efficiency or compression ratio, that can vary depending on the type of data contained in the file; the most frequent ratio is between 5: 1 and 4: 1.

As a result of the compression of a file, we always obtain a new compressed file. Expanding a compressed file produces a new file with a format identical to the original one.