fix(core/clock): re-sync survives loaded links — floor baseline, spaced rounds, bounded staleness

The mid-stream clock re-sync starved on high-bitrate LAN sessions (2026-07
PyroWave-sawtooth field report, RX 9070 XT -> 780M @ 550 Mb/s): every batch
was judged against the CONNECT-TIME RTT, measured before the video data
plane existed, with a 2 ms floor — mid-stream control RTTs on a loaded GbE
link sit above that almost permanently, so batches were rejected for
minutes while the wall clocks drifted apart and the OSD e2e figure ramped
19->150 ms before snapping back on a lucky batch.

Three changes:
- Rounds are spaced 7 ms apart (stamped at send time, so the spacing never
  lands in the RTT). An 8-round batch used to complete inside ONE ~6 ms
  video burst — all rounds sampled the same congestion state; spacing walks
  them across the frame cycle so the min-RTT round finds a quiet gap.
- ResyncGuard replaces the static baseline: the guard band follows the best
  RTT the session has evidenced (connect RTT, then min over every completed
  batch — rejected ones included).
- Rejection streaks are bounded: after 3 consecutive rejections the best
  (min-RTT) batch of the streak is applied anyway. Its queueing bias is at
  most ~half its RTT; unbounded wall-clock drift costs more per minute.

Rejections now log at warn with the streak and floor — the starvation
signature is grep-able in exactly the logs users send.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
This commit is contained in:
2026-07-27 12:51:11 +02:00
co-authored by Claude Fable 5
parent 94b7a834cb
commit 53640b8754
5 changed files with 212 additions and 35 deletions
+2 -2
View File
@@ -52,8 +52,8 @@ pub(crate) struct Negotiated {
/// Host clock minus client clock (ns); `0` = no skew handshake (old host / synced clocks).
pub(crate) clock_offset_ns: i64,
/// Min RTT of the connect-time skew handshake (ns); `None` = the host never answered —
/// mid-stream re-syncs are pointless then and stay off. The re-sync acceptance guard
/// compares each batch against this baseline ([`accept_resync`]).
/// mid-stream re-syncs are pointless then and stay off. Seeds the re-sync admission
/// guard's session-floor baseline ([`ResyncGuard`]).
pub(crate) clock_rtt_ns: Option<u64>,
/// Resolved encode bit depth: `8`, or `10` for a Main10 / HDR session.
pub(crate) bit_depth: u8,
+2 -2
View File
@@ -11,8 +11,8 @@ use crate::abr::BitrateController;
use crate::config::Role;
use crate::packet::FLAG_PROBE;
use crate::quic::{
accept_resync, io, wall_clock_ns, window_loss_ppm, BitrateChanged, ClipState, ClockEcho,
ClockResync, Hello, LossReport, ProbeResult, Reconfigure, Reconfigured, RequestKeyframe,
io, wall_clock_ns, window_loss_ppm, BitrateChanged, ClipState, ClockEcho, ClockResync, Hello,
LossReport, ProbeResult, Reconfigure, Reconfigured, RequestKeyframe, ResyncAdmit, ResyncGuard,
ResyncStep, SetBitrate, Start, Welcome,
};
use crate::session::Session;
@@ -52,6 +52,14 @@ impl ControlTask {
// the read arm below; only when the host answered the connect-time handshake — an
// old host would just eat the probes.
let mut resync = ClockResync::new();
let mut resync_guard = clock_rtt_ns.map(ResyncGuard::new);
// Inter-round spacing: without it the whole 8-round batch completes inside one
// ~6 ms video burst and every round samples the same congestion state — a batch
// that starts mid-burst is then wholly congested and gets rejected. 7 ms staggers
// the rounds across the ~16.7 ms frame cycle so the min-RTT round almost always
// lands in a quiet inter-burst gap, even at PyroWave-class bitrates.
const RESYNC_ROUND_SPACING: std::time::Duration = std::time::Duration::from_millis(7);
let mut staged_round: Option<tokio::time::Instant> = None;
let mut resync_tick = tokio::time::interval_at(
tokio::time::Instant::now() + CLOCK_RESYNC_INTERVAL,
CLOCK_RESYNC_INTERVAL,
@@ -72,6 +80,7 @@ impl ControlTask {
if clock_rtt_ns.is_none() {
continue; // no connect-time handshake — host can't answer
}
staged_round = None; // a new batch abandons any staged round
resync.begin(wall_clock_ns()).encode()
}
CtrlRequest::ClipControl(c) => c.encode(),
@@ -83,11 +92,21 @@ impl ControlTask {
}
}
_ = resync_tick.tick(), if clock_rtt_ns.is_some() => {
staged_round = None; // a new batch abandons any staged round
let probe = resync.begin(wall_clock_ns());
if io::write_msg(&mut ctrl_send, &probe.encode()).await.is_err() {
break;
}
}
_ = async { tokio::time::sleep_until(staged_round.unwrap()).await },
if staged_round.is_some() => {
staged_round = None;
// Stamped at send time so the inter-round spacing stays out of the RTT.
let probe = resync.next_probe(wall_clock_ns());
if io::write_msg(&mut ctrl_send, &probe.encode()).await.is_err() {
break;
}
}
msg = ctrl_recv.read_msg() => {
let Ok(msg) = msg else { break }; // stream closed
if let Ok(ack) = Reconfigured::decode(&msg) {
@@ -132,16 +151,36 @@ impl ControlTask {
*bitrate_ack.lock().unwrap() = Some(ack.bitrate_kbps);
} else if let Ok(echo) = ClockEcho::decode(&msg) {
match resync.on_echo(&echo, wall_clock_ns()) {
ResyncStep::Probe(p) => {
if io::write_msg(&mut ctrl_send, &p.encode()).await.is_err() {
break;
}
ResyncStep::MoreRounds => {
staged_round = Some(
tokio::time::Instant::now() + RESYNC_ROUND_SPACING,
);
}
ResyncStep::Done { offset_ns, rtt_ns } => {
// Never let a congested window bias the offset (frames read
// late exactly then) — keep the old estimate and let the next
// periodic batch try again.
if accept_resync(rtt_ns, clock_rtt_ns.unwrap_or(0)) {
let Some(guard) = resync_guard.as_mut() else {
continue; // no connect handshake — batches never start
};
let (apply, best_of_streak) = match guard.admit(offset_ns, rtt_ns)
{
ResyncAdmit::Fresh => (Some((offset_ns, rtt_ns)), false),
ResyncAdmit::BestOfStreak { offset_ns, rtt_ns } => {
(Some((offset_ns, rtt_ns)), true)
}
ResyncAdmit::Rejected { streak } => {
// warn, not debug: repeated rejections are exactly the
// stale-offset starvation signature the 2026-07
// PyroWave-sawtooth report had to be diagnosed without.
tracing::warn!(
rtt_us = rtt_ns / 1000,
floor_us = guard.floor_rtt_ns() / 1000,
streak,
"clock re-sync batch rejected — RTT above the \
session floor (congested window)"
);
(None, false)
}
};
if let Some((offset_ns, rtt_ns)) = apply {
// info, not debug: ≤1/min, and it is THE forensic
// trail for a stale-offset (stepped/slewed wall clock)
// latency plateau — the 2026-07 two-pair investigation
@@ -149,16 +188,11 @@ impl ControlTask {
tracing::info!(
offset_ns,
rtt_us = rtt_ns / 1000,
best_of_streak,
"mid-stream clock re-sync applied"
);
clock_offset.store(offset_ns, Ordering::Relaxed);
clock_gen.fetch_add(1, Ordering::Relaxed);
} else {
tracing::info!(
rtt_us = rtt_ns / 1000,
"clock re-sync batch discarded — RTT above the \
connect-time baseline (congested window)"
);
}
}
ResyncStep::Idle => {}
+155 -17
View File
@@ -82,8 +82,12 @@ pub fn wall_clock_ns() -> u64 {
pub enum ResyncStep {
/// Nothing — the echo was stale (a previous batch) or no batch is in flight.
Idle,
/// Send this next-round probe and keep feeding echoes.
Probe(ClockProbe),
/// The round was recorded and the batch wants another: wait the inter-round spacing, then
/// stamp + send [`ClockResync::next_probe`]. Spacing the rounds makes the batch sample
/// several phases of the periodic video-burst cycle instead of completing inside one burst
/// — at high bitrates the whole 8-round batch otherwise fits in a single ~6 ms burst and
/// every round reads the same congested (or same quiet) instant.
MoreRounds,
/// The batch is complete: the min-RTT estimate over its rounds, per [`clock_offset_ns`].
Done { offset_ns: i64, rtt_ns: u64 },
}
@@ -118,6 +122,13 @@ impl ClockResync {
/// `pending_t1` and get ignored. Returns the first probe to send, stamped `now_ns`.
pub fn begin(&mut self, now_ns: u64) -> ClockProbe {
self.samples.clear();
self.next_probe(now_ns)
}
/// Stamp + arm the next round's probe at `now_ns` — send it immediately. Called after
/// [`ResyncStep::MoreRounds`] once the caller's inter-round spacing has elapsed; stamping
/// at send time keeps that spacing out of the measured RTT.
pub fn next_probe(&mut self, now_ns: u64) -> ClockProbe {
self.pending_t1 = Some(now_ns);
ClockProbe { t1_ns: now_ns }
}
@@ -129,11 +140,12 @@ impl ClockResync {
}
self.samples
.push((echo.t1_ns, echo.t2_ns, echo.t3_ns, now_ns));
if self.samples.len() < Self::ROUNDS {
self.pending_t1 = Some(now_ns);
return ResyncStep::Probe(ClockProbe { t1_ns: now_ns });
}
// No probe in flight until the driver arms the next round (or a batch restarts) — a
// duplicate of this round's echo must not double-record.
self.pending_t1 = None;
if self.samples.len() < Self::ROUNDS {
return ResyncStep::MoreRounds;
}
match clock_offset_ns(&self.samples) {
Some((offset_ns, rtt_ns)) => ResyncStep::Done { offset_ns, rtt_ns },
None => ResyncStep::Idle, // unreachable: ROUNDS > 0 samples were just collected
@@ -147,12 +159,97 @@ impl Default for ClockResync {
}
}
/// Acceptance guard for a re-sync batch: apply the new offset only when its min RTT is
/// comparable to the connect-time RTT — `≤ max(2 ms, 1.5 × connect RTT)`. A congested window
/// biases the offset by its queueing delay, and frames already read late exactly then; better
/// to keep the old estimate and let the next batch try again.
pub fn accept_resync(batch_rtt_ns: u64, connect_rtt_ns: u64) -> bool {
batch_rtt_ns <= (connect_rtt_ns + connect_rtt_ns / 2).max(2_000_000)
/// Acceptance predicate for a re-sync batch: its min RTT must be comparable to the best RTT
/// this session has evidenced — `≤ max(2 ms, 1.5 × floor)`. A congested window biases the
/// offset by its queueing delay, and frames already read late exactly then; better to keep the
/// old estimate and let the next batch try again.
pub fn accept_resync(batch_rtt_ns: u64, floor_rtt_ns: u64) -> bool {
batch_rtt_ns <= (floor_rtt_ns + floor_rtt_ns / 2).max(2_000_000)
}
/// Admission decision for a completed re-sync batch (see [`ResyncGuard::admit`]).
#[derive(Debug, PartialEq, Eq)]
pub enum ResyncAdmit {
/// Batch RTT is within the guard band of the session floor: apply this batch's offset.
Fresh,
/// Batch rejected (congested window) — keep the previous offset; `streak` counts the
/// consecutive rejections since the last applied batch.
Rejected { streak: u32 },
/// The rejection streak hit [`ResyncGuard::MAX_REJECTED_STREAK`]: apply the best (min-RTT)
/// batch of the streak instead of drifting further. Carries that batch's estimate.
BestOfStreak { offset_ns: i64, rtt_ns: u64 },
}
/// Admission control for mid-stream re-sync batches. Two fixes over the original static
/// `≤ max(2 ms, 1.5 × connect RTT)` guard (2026-07 PyroWave-sawtooth field report):
///
/// - **The baseline is the session floor, not the connect-time RTT.** The connect handshake
/// runs before the video data plane exists; comparing loaded mid-stream batches against that
/// idle figure rejected essentially every batch of a high-bitrate LAN session, and the
/// offset went stale while the wall clocks drifted apart — the OSD latency ramped for
/// minutes and snapped back only when a lucky batch landed. The floor now folds in every
/// completed batch's min RTT (rejected ones included: their min-RTT round is still floor
/// evidence), so the baseline tracks what this path can actually do under load.
/// - **Staleness is bounded.** After [`Self::MAX_REJECTED_STREAK`] consecutive rejections the
/// best batch of the streak is applied anyway: its queueing bias is at most ~half its RTT
/// (a few ms), while unbounded wall-clock drift is worth that many ms *per minute* on a
/// slewing clock. A bounded bias beats an unbounded drift.
pub struct ResyncGuard {
/// Best RTT this session has evidenced: connect-time RTT, then min over every batch.
floor_rtt_ns: u64,
rejected_streak: u32,
/// Min-RTT batch among the current rejection streak.
best_pending: Option<(i64, u64)>,
}
impl ResyncGuard {
/// Consecutive rejected batches tolerated before the best of them is applied anyway.
pub const MAX_REJECTED_STREAK: u32 = 3;
pub fn new(connect_rtt_ns: u64) -> ResyncGuard {
ResyncGuard {
floor_rtt_ns: connect_rtt_ns,
rejected_streak: 0,
best_pending: None,
}
}
/// The current baseline the guard compares batches against (log/debug surface).
pub fn floor_rtt_ns(&self) -> u64 {
self.floor_rtt_ns
}
/// Judge a completed batch. The caller applies the offset on [`ResyncAdmit::Fresh`] (this
/// batch's) or [`ResyncAdmit::BestOfStreak`] (the carried one) and keeps the old offset on
/// [`ResyncAdmit::Rejected`].
pub fn admit(&mut self, offset_ns: i64, rtt_ns: u64) -> ResyncAdmit {
// Judge against the floor as evidenced BEFORE this batch, then fold this batch in —
// comparing a batch against a floor that already includes it would accept everything.
let fresh = accept_resync(rtt_ns, self.floor_rtt_ns);
self.floor_rtt_ns = self.floor_rtt_ns.min(rtt_ns);
if fresh {
self.rejected_streak = 0;
self.best_pending = None;
return ResyncAdmit::Fresh;
}
let best = match self.best_pending {
Some((o, r)) if r <= rtt_ns => (o, r),
_ => (offset_ns, rtt_ns),
};
self.best_pending = Some(best);
self.rejected_streak += 1;
if self.rejected_streak >= Self::MAX_REJECTED_STREAK {
self.rejected_streak = 0;
self.best_pending = None;
return ResyncAdmit::BestOfStreak {
offset_ns: best.0,
rtt_ns: best.1,
};
}
ResyncAdmit::Rejected {
streak: self.rejected_streak,
}
}
}
#[cfg(test)]
@@ -218,9 +315,14 @@ mod tests {
let echo = echo_for(probe.t1_ns, one_way);
let t4 = t4_for(&echo, one_way);
match rs.on_echo(&echo, t4) {
ResyncStep::Probe(p) => {
ResyncStep::MoreRounds => {
assert!(round < ClockResync::ROUNDS - 1, "batch overran its rounds");
probe = p;
// A duplicate of the just-consumed echo must not double-record: no probe
// is in flight until the driver arms the next round.
assert_eq!(rs.on_echo(&echo, t4), ResyncStep::Idle);
// The driver stamps the next probe at SEND time (after its inter-round
// spacing), so the spacing never lands in the measured RTT.
probe = rs.next_probe(t4 + 7_000_000);
}
ResyncStep::Done { offset_ns, rtt_ns } => {
assert_eq!(round, ClockResync::ROUNDS - 1, "batch ended early");
@@ -243,10 +345,46 @@ mod tests {
rs.on_echo(&echo_for(old.t1_ns, 100_000), 2_300_000),
ResyncStep::Idle
);
assert!(matches!(
assert_eq!(
rs.on_echo(&echo_for(fresh.t1_ns, 100_000), 3_300_000),
ResyncStep::Probe(_)
));
ResyncStep::MoreRounds
);
}
/// The guard's two field-report fixes: the baseline tracks the SESSION floor (a batch
/// better than the stale connect figure re-anchors it), and a rejection streak is bounded
/// — the best batch of the streak is applied rather than letting the offset go stale
/// while the wall clocks drift apart.
#[test]
fn resync_guard_floor_tracking_and_bounded_streak() {
// Connect measured 400 µs idle; the 2 ms floor of accept_resync governs early on.
let mut g = ResyncGuard::new(400_000);
assert_eq!(g.admit(10, 1_500_000), ResyncAdmit::Fresh);
// A better batch lowers the floor evidence.
assert_eq!(g.admit(11, 300_000), ResyncAdmit::Fresh);
assert_eq!(g.floor_rtt_ns(), 300_000);
// Loaded stretch: batches at 46 ms all exceed max(2 ms, 1.5 × 300 µs).
assert_eq!(g.admit(100, 6_000_000), ResyncAdmit::Rejected { streak: 1 });
// The best (min-RTT) batch of the streak is remembered…
assert_eq!(g.admit(200, 4_000_000), ResyncAdmit::Rejected { streak: 2 });
// …and applied when the streak hits the cap — offset 200 (the 4 ms batch), not 300.
assert_eq!(
g.admit(300, 5_000_000),
ResyncAdmit::BestOfStreak {
offset_ns: 200,
rtt_ns: 4_000_000
}
);
// The streak reset: the next congested batch starts a new one.
assert_eq!(g.admit(400, 5_000_000), ResyncAdmit::Rejected { streak: 1 });
// A quiet batch clears it and applies normally.
assert_eq!(g.admit(500, 350_000), ResyncAdmit::Fresh);
// A batch that IS the new floor is always fresh (compared against the pre-batch floor).
let mut g2 = ResyncGuard::new(10_000_000);
assert_eq!(g2.admit(1, 8_000_000), ResyncAdmit::Fresh);
assert_eq!(g2.floor_rtt_ns(), 8_000_000);
}
/// The acceptance guard: a batch measured through a congested window (fat RTT) must not
+5
View File
@@ -680,6 +680,11 @@
#define ClockResync_ROUNDS 8
#endif
#if defined(PUNKTFUNK_FEATURE_QUIC)
// Consecutive rejected batches tolerated before the best of them is applied anyway.
#define ResyncGuard_MAX_REJECTED_STREAK 3
#endif
#if defined(PUNKTFUNK_FEATURE_QUIC)
// Type byte of [`Reconfigure`] (first byte after the magic).
#define MSG_RECONFIGURE 1