Haproxy: New compression algorithms brotli

Created on 22 Jan 2019  路  4Comments  路  Source: haproxy/haproxy

Output of haproxy -vv and uname -a

Future version

What should haproxy do differently? Which functionality do you think we should add?

Haproxy could add a additional compression algorithm.

Compression algorithms supported : identity("identity"), deflate("deflate"), raw-deflate("deflate"), gzip("gzip")

https://www.rfc-editor.org/rfc/rfc7932.txt
https://github.com/google/brotli

feature

Most helpful comment

@TimWolla have send a patchset to the mailing list which needs a review.
https://www.mail-archive.com/[email protected]/msg32807.html

All 4 comments

Brotli is expected to compress slightly better than gzip at the same speed and much better at a much lower speed. I'm a bit worried about the CPU time and RAM usage needed to achieve this though, and when dealing with large traffic I wouldn't be surprized if we have to throttle to preserve memory, resulting in a lower overall compression ratio. This is already how SLZ achieves better average compression ratios than zlib, since the former uses 3 times less CPU and doesn't require to keep a heavy memory context.

But possibly that it's not that difficult to link with libbrotli and run some tests.

Also see the discourse thread Brotli compression support, which also contains comments from Google's Jyrki Alakuijala, which afaik was involved in the development of brotli.

@TimWolla have send a patchset to the mailing list which needs a review.
https://www.mail-archive.com/[email protected]/msg32807.html

This would be a great feature to add.

Was this page helpful?
0 / 5 - 0 ratings