mirrors/haproxy
1
0
Fork 0
mirror of https://git.haproxy.org/git/haproxy.git/ synced 2026-02-13 21:31:07 +01:00
Code Issues Projects Releases Wiki Activity

MINOR: quic: Persistent congestion detection outside of controllers

Browse Source 
We establish the persistent congestion out of any congestion controller
to improve the algorithms genericity. This path characteristic detection may
be implemented regarless of the underlying congestion control algorithm.

Send congestion (loss) event using directly quic_cc_event(), so without
qc_cc_loss_event() wrapper function around quic_cc_event().

Take the opportunity of this patch to shorten "newest_time_sent" member field
of quic_cc_event to "time_sent".
This commit is contained in:
Frédéric Lécaille 2022-03-02 14:52:56 +01:00 committed by Amaury Denoyelle
parent 83bfca6c71
commit a5ee0ae6a2
4 changed files with 33 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/haproxy/quic_cc-t.h
View File

@ -63,7 +63,7 @@ struct quic_cc_event {
unsigned int now_ms;
unsigned int max_ack_delay;
size_t lost_bytes;
unsigned int newest_time_sent;
unsigned int time_sent;
unsigned int period;
} loss;
};

2
include/haproxy/quic_cc.h
View File

@ -61,7 +61,7 @@ static inline void quic_cc_event_trace(struct buffer *buf, const struct quic_cc_
" time_sent=%u period=%u",
ev->loss.now_ms, ev->loss.max_ack_delay,
(unsigned long long)ev->loss.lost_bytes,
ev->loss.newest_time_sent, ev->loss.period);
ev->loss.time_sent, ev->loss.period);
break;
case QUIC_CC_EVT_ECN_CE:
chunk_appendf(buf, "ecn_ce");

21
src/quic_cc_newreno.c
View File

@ -108,20 +108,13 @@ static void quic_cc_nr_ca_cb(struct quic_cc *cc, struct quic_cc_event *ev)
break;
case QUIC_CC_EVT_LOSS:
if (ev->loss.newest_time_sent > cc->algo_state.nr.recovery_start_time) {
cc->algo_state.nr.recovery_start_time = ev->loss.now_ms;
cc->algo_state.nr.cwnd = QUIC_MAX(cc->algo_state.nr.cwnd >> 1, path->min_cwnd);
cc->algo_state.nr.ssthresh = cc->algo_state.nr.cwnd;
}
if (quic_loss_persistent_congestion(&path->loss,
ev->loss.period,
ev->loss.now_ms,
ev->loss.max_ack_delay)) {
cc->algo_state.nr.cwnd = path->min_cwnd;
/* Re-entering slow start state. */
cc->algo_state.nr.state = QUIC_CC_ST_SS;
cc->algo_state.nr.recovery_start_time = 0;
}
/* Do not decrease the congestion window when already in recovery period. */
if (ev->loss.time_sent <= cc->algo_state.nr.recovery_start_time)
goto out;
cc->algo_state.nr.recovery_start_time = now_ms;
cc->algo_state.nr.ssthresh = cc->algo_state.nr.cwnd;
cc->algo_state.nr.cwnd = QUIC_MAX(cc->algo_state.nr.cwnd >> 1, path->min_cwnd);
path->cwnd = cc->algo_state.nr.cwnd;
break;

28
src/xprt_quic.c
View File

@ -1575,7 +1575,7 @@ static inline void qc_cc_loss_event(struct quic_conn *qc,
.loss.now_ms = now_ms,
.loss.max_ack_delay = qc->max_ack_delay,
.loss.lost_bytes = lost_bytes,
.loss.newest_time_sent = newest_time_sent,
.loss.time_sent = newest_time_sent,
.loss.period = period,
};
@ -1658,10 +1658,30 @@ static inline void qc_release_lost_pkts(struct quic_conn *qc,
}
}
if (newest_lost) {
/* Sent a congestion event to the controller */
struct quic_cc_event ev = {
.type = QUIC_CC_EVT_LOSS,
.loss.time_sent = newest_lost->time_sent,
};
quic_cc_event(&qc->path->cc, &ev);
}
/* If an RTT have been already sampled, <rtt_min> has been set.
* We must check if we are experiencing a persistent congestion.
* If this is the case, the congestion controller must re-enter
* slow start state.
*/
if (qc->path->loss.rtt_min && newest_lost != oldest_lost) {
unsigned int period = newest_lost->time_sent - oldest_lost->time_sent;
if (quic_loss_persistent_congestion(&qc->path->loss, period,
now_ms, qc->max_ack_delay))
qc->path->cc.algo->slow_start(&qc->path->cc);
}
if (lost_bytes) {
/* Sent a packet loss event to the congestion controller. */
qc_cc_loss_event(qc, lost_bytes, newest_lost->time_sent,
newest_lost->time_sent - oldest_lost->time_sent, now_us);
quic_tx_packet_refdec(oldest_lost);
if (newest_lost != oldest_lost)
quic_tx_packet_refdec(newest_lost);