aboutsummaryrefslogtreecommitdiffstats
path: root/link/tls.h
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-09-29 07:34:08 +0100
committereunhhu <[email protected]>2026-09-29 07:34:08 +0100
commited123556cf1c10369959fa96e1262050db63f7ce (patch)
treebee6095d68934d4d0c0bba056d20d5b1e2c74649 /link/tls.h
parent9c5471471711d904363de28827417da8836b8431 (diff)
downloadpure-ed123556cf1c10369959fa96e1262050db63f7ce.tar.gz
pure-ed123556cf1c10369959fa96e1262050db63f7ce.zip
Wait for late packets, undo what they cost, and grow as CUBIC
A packet called lost stays known a while; acknowledged after all, it came late: what it carried counts as received, the reordering awaited grows (later packets acknowledged, and time past the RTT, as RACK), and an episode of congestion events whose losses all came late is undone. The window grows only when it was used (RFC 9002 7.8), and congestion avoidance is CUBIC (RFC 9438), as quinn's. In a path of 50 Mbit/s whose packets reorder by up to 5 ms, with no loss, a link carried 1.5 Mbit/s at an RTT of 20 ms and 10 at 100 ms; now 43.6 and 40.1, as without reordering (research/experiments/020-lossy-paths, virtual time). With 1% random loss: 4.9 to 6.1 at 20 ms, 1.0 to 1.3 at 100 ms. The transport's CPU a record is unchanged.
Diffstat (limited to 'link/tls.h')
0 files changed, 0 insertions, 0 deletions