]> git.kaiwu.me - haproxy.git/commit
projects / haproxy.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 7bbe882) | patch
MINOR: window_filter: Implement windowed filter (only max)
authorFrederic Lecaille <flecaille@haproxy.com>
Thu, 5 Sep 2024 05:42:56 +0000 (07:42 +0200)
committerFrederic Lecaille <flecaille@haproxy.com>
Wed, 20 Nov 2024 16:34:22 +0000 (17:34 +0100)
commitc08b877657e33ab96e867c249adbb5629e450e74
treead9b5ed0a767a71c59c4c70e39df0c280b17623ftree | snapshot
parent7bbe8828baf663171f17e2c787f98f88b5cf7005commit | diff
MINOR: window_filter: Implement windowed filter (only max)

Implement the Kathleen Nichols' algorithm used by several congestion control
algorithm implementation (TCP/BBR in Linux kernel, QUIC/BBR in quiche) to track
the maximum value of a data type during a fixe time interval.
In this implementation, counters which are periodically reset are used in place
of timestamps.
Only the max part has been implemented.
(see lib/minmax.c implemenation for Linux kernel).
include/haproxy/window_filter.h [new file with mode: 0644] blob
haproxy upstream