quiche/recovery/congestion/bbr/mod.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789
// Copyright (C) 2022, Cloudflare, Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//! BBR Congestion Control
//!
//! This implementation is based on the following draft:
//! <https://tools.ietf.org/html/draft-cardwell-iccrg-bbr-congestion-control-00>
use crate::minmax::Minmax;
use crate::recovery::*;
use std::time::Duration;
use super::CongestionControlOps;
pub(crate) static BBR: CongestionControlOps = CongestionControlOps {
on_init,
on_packet_sent,
on_packets_acked,
congestion_event,
checkpoint,
rollback,
has_custom_pacing,
debug_fmt,
};
/// A constant specifying the length of the BBR.BtlBw max filter window for
/// BBR.BtlBwFilter, BtlBwFilterLen is 10 packet-timed round trips.
const BTLBW_FILTER_LEN: Duration = Duration::from_secs(10);
/// A constant specifying the minimum time interval between ProbeRTT states: 10
/// secs.
const PROBE_RTT_INTERVAL: Duration = Duration::from_secs(10);
/// A constant specifying the length of the RTProp min filter window.
const RTPROP_FILTER_LEN: Duration = PROBE_RTT_INTERVAL;
/// A constant specifying the minimum gain value that will allow the sending
/// rate to double each round (2/ln(2) ~= 2.89), used in Startup mode for both
/// BBR.pacing_gain and BBR.cwnd_gain.
const BBR_HIGH_GAIN: f64 = 2.89;
/// The minimal cwnd value BBR tries to target using: 4 packets, or 4 * SMSS
const BBR_MIN_PIPE_CWND_PKTS: usize = 4;
/// The number of phases in the BBR ProbeBW gain cycle: 8.
const BBR_GAIN_CYCLE_LEN: usize = 8;
/// A constant specifying the minimum duration for which ProbeRTT state holds
/// inflight to BBRMinPipeCwnd or fewer packets: 200 ms.
const PROBE_RTT_DURATION: Duration = Duration::from_millis(200);
/// Pacing Gain Cycle.
const PACING_GAIN_CYCLE: [f64; BBR_GAIN_CYCLE_LEN] =
[5.0 / 4.0, 3.0 / 4.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0];
/// A constant to check BBR.BtlBW is still growing.
const BTLBW_GROWTH_TARGET: f64 = 1.25;
/// BBR Internal State Machine.
#[derive(Debug, PartialEq, Eq)]
enum BBRStateMachine {
Startup,
Drain,
ProbeBW,
ProbeRTT,
}
/// BBR Specific State Variables.
pub struct State {
// The current state of a BBR flow in the BBR state machine.
state: BBRStateMachine,
// The current pacing rate for a BBR flow, which controls inter-packet
// spacing.
pacing_rate: u64,
// BBR's estimated bottleneck bandwidth available to the transport flow,
// estimated from the maximum delivery rate sample in a sliding window.
btlbw: u64,
// The max filter used to estimate BBR.BtlBw.
btlbwfilter: Minmax<u64>,
// BBR's estimated two-way round-trip propagation delay of the path,
// estimated from the windowed minimum recent round-trip delay sample.
rtprop: Duration,
// The wall clock time at which the current BBR.RTProp sample was obtained.
rtprop_stamp: Instant,
// A boolean recording whether the BBR.RTprop has expired and is due for a
// refresh with an application idle period or a transition into ProbeRTT
// state.
rtprop_expired: bool,
// The dynamic gain factor used to scale BBR.BtlBw to produce
// BBR.pacing_rate.
pacing_gain: f64,
// The dynamic gain factor used to scale the estimated BDP to produce a
// congestion window (cwnd).
cwnd_gain: f64,
// A boolean that records whether BBR estimates that it has ever fully
// utilized its available bandwidth ("filled the pipe").
filled_pipe: bool,
// Count of packet-timed round trips elapsed so far.
round_count: u64,
// A boolean that BBR sets to true once per packet-timed round trip,
// on ACKs that advance BBR.round_count.
round_start: bool,
// packet.delivered value denoting the end of a packet-timed round trip.
next_round_delivered: usize,
// Timestamp when ProbeRTT state ends.
probe_rtt_done_stamp: Option<Instant>,
// Checking if a roundtrip in ProbeRTT state ends.
probe_rtt_round_done: bool,
// Checking if in the packet conservation mode during recovery.
packet_conservation: bool,
// Saved cwnd before loss recovery.
prior_cwnd: usize,
// Checking if restarting from idle.
idle_restart: bool,
// Baseline level delivery rate for full pipe estimator.
full_bw: u64,
// The number of round for full pipe estimator without much growth.
full_bw_count: usize,
// Last time cycle_index is updated.
cycle_stamp: Instant,
// Current index of pacing_gain_cycle[].
cycle_index: usize,
// The upper bound on the volume of data BBR allows in flight.
target_cwnd: usize,
// Whether in the recovery episode.
in_recovery: bool,
// Start time of the connection.
start_time: Instant,
// Newly marked lost data size in bytes.
newly_lost_bytes: usize,
// Newly acked data size in bytes.
newly_acked_bytes: usize,
// bytes_in_flight before processing this ACK.
prior_bytes_in_flight: usize,
}
impl State {
pub fn new() -> Self {
let now = Instant::now();
State {
state: BBRStateMachine::Startup,
pacing_rate: 0,
btlbw: 0,
btlbwfilter: Minmax::new(0),
rtprop: Duration::ZERO,
rtprop_stamp: now,
rtprop_expired: false,
pacing_gain: 0.0,
cwnd_gain: 0.0,
filled_pipe: false,
round_count: 0,
round_start: false,
next_round_delivered: 0,
probe_rtt_done_stamp: None,
probe_rtt_round_done: false,
packet_conservation: false,
prior_cwnd: 0,
idle_restart: false,
full_bw: 0,
full_bw_count: 0,
cycle_stamp: now,
cycle_index: 0,
target_cwnd: 0,
in_recovery: false,
start_time: now,
newly_lost_bytes: 0,
newly_acked_bytes: 0,
prior_bytes_in_flight: 0,
}
}
}
// When entering the recovery episode.
fn bbr_enter_recovery(r: &mut Congestion, in_flight: usize, now: Instant) {
r.bbr_state.prior_cwnd = per_ack::bbr_save_cwnd(r);
r.congestion_window = in_flight.max(r.max_datagram_size);
r.congestion_recovery_start_time = Some(now);
r.bbr_state.packet_conservation = true;
r.bbr_state.in_recovery = true;
r.bbr_state.newly_lost_bytes = 0;
// Start round now.
r.bbr_state.next_round_delivered = r.delivery_rate.delivered();
}
// When exiting the recovery episode.
fn bbr_exit_recovery(r: &mut Congestion) {
r.congestion_recovery_start_time = None;
r.bbr_state.packet_conservation = false;
r.bbr_state.in_recovery = false;
per_ack::bbr_restore_cwnd(r);
}
// Congestion Control Hooks.
//
fn on_init(r: &mut Congestion) {
init::bbr_init(r);
}
fn on_packet_sent(
r: &mut Congestion, _sent_bytes: usize, bytes_in_flight: usize, _now: Instant,
) {
per_transmit::bbr_on_transmit(r, bytes_in_flight);
}
fn on_packets_acked(
r: &mut Congestion, bytes_in_flight: usize, packets: &mut Vec<Acked>,
now: Instant, _rtt_stats: &RttStats,
) {
r.bbr_state.prior_bytes_in_flight = bytes_in_flight;
r.bbr_state.newly_acked_bytes =
packets.drain(..).fold(0, |acked_bytes, p| {
r.bbr_state.prior_bytes_in_flight -= p.size;
per_ack::bbr_update_model_and_state(r, &p, bytes_in_flight, now);
acked_bytes + p.size
});
if let Some(pkt) = packets.last() {
if !r.in_congestion_recovery(pkt.time_sent) && r.bbr_state.in_recovery {
// Upon exiting loss recovery.
bbr_exit_recovery(r);
}
}
per_ack::bbr_update_control_parameters(r, bytes_in_flight, now);
r.bbr_state.newly_lost_bytes = 0;
}
fn congestion_event(
r: &mut Congestion, bytes_in_flight: usize, lost_bytes: usize,
largest_lost_pkt: &Sent, now: Instant,
) {
r.bbr_state.newly_lost_bytes = lost_bytes;
// Upon entering Fast Recovery.
if !r.in_congestion_recovery(largest_lost_pkt.time_sent) {
// Upon entering Fast Recovery.
bbr_enter_recovery(r, bytes_in_flight - lost_bytes, now);
}
}
fn checkpoint(_r: &mut Congestion) {}
fn rollback(_r: &mut Congestion) -> bool {
false
}
fn has_custom_pacing() -> bool {
true
}
fn debug_fmt(r: &Congestion, f: &mut std::fmt::Formatter) -> std::fmt::Result {
let bbr = &r.bbr_state;
write!(
f,
"bbr={{ state={:?} btlbw={} rtprop={:?} pacing_rate={} pacing_gain={} cwnd_gain={} target_cwnd={} send_quantum={} filled_pipe={} round_count={} }}",
bbr.state, bbr.btlbw, bbr.rtprop, bbr.pacing_rate, bbr.pacing_gain, bbr.cwnd_gain, bbr.target_cwnd, r.send_quantum(), bbr.filled_pipe, bbr.round_count
)
}
#[cfg(test)]
mod tests {
use super::*;
use crate::recovery;
use self::congestion::test_sender::TestSender;
use smallvec::smallvec;
fn test_sender() -> TestSender {
TestSender::new(recovery::CongestionControlAlgorithm::BBR, false)
}
#[test]
fn bbr_init() {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);
let r = Recovery::new(&cfg);
assert_eq!(
r.cwnd(),
r.max_datagram_size * cfg.initial_congestion_window_packets
);
assert_eq!(r.bytes_in_flight, 0);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::Startup);
}
#[test]
fn bbr_startup() {
let mut sender = test_sender();
let mss = sender.max_datagram_size;
let rtt = Duration::from_millis(50);
sender.update_rtt(rtt);
sender.advance_time(rtt);
// Send 5 packets.
for _ in 0..5 {
sender.send_packet(mss);
}
sender.advance_time(rtt);
let cwnd_prev = sender.congestion_window;
sender.ack_n_packets(5, mss);
assert_eq!(sender.bbr_state.state, BBRStateMachine::Startup);
assert_eq!(sender.congestion_window, cwnd_prev + mss * 5);
assert_eq!(sender.bytes_in_flight, 0);
assert_eq!(
sender.delivery_rate(),
((mss * 5) as f64 / rtt.as_secs_f64()) as u64
);
assert_eq!(sender.bbr_state.btlbw, sender.delivery_rate());
}
#[test]
fn bbr_congestion_event() {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);
let mut r = Recovery::new(&cfg);
let now = Instant::now();
let mss = r.max_datagram_size;
// Send 5 packets.
for pn in 0..5 {
let pkt = Sent {
pkt_num: pn,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: 0,
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
}
let rtt = Duration::from_millis(50);
let now = now + rtt;
// Make a packet loss to trigger a congestion event.
let mut acked = ranges::RangeSet::default();
acked.insert(4..5);
// 1 acked, 2 x MSS lost.
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((2, 2 * mss, mss)),
);
// Sent: 0, 1, 2, 3, 4, Acked 4.
assert_eq!(r.cwnd(), mss * 4);
// Stil in flight: 2, 3.
assert_eq!(r.bytes_in_flight, mss * 2);
}
#[test]
fn bbr_drain() {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);
let mut r = Recovery::new(&cfg);
let now = Instant::now();
let mss = r.max_datagram_size;
let mut pn = 0;
// Stop right before filled_pipe=true.
for _ in 0..3 {
let pkt = Sent {
pkt_num: pn,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
pn += 1;
let rtt = Duration::from_millis(50);
let now = now + rtt;
let mut acked = ranges::RangeSet::default();
acked.insert(0..pn);
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((0, 0, mss)),
);
}
// Stop at right before filled_pipe=true.
for _ in 0..5 {
let pkt = Sent {
pkt_num: pn,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
pn += 1;
}
let rtt = Duration::from_millis(50);
let now = now + rtt;
let mut acked = ranges::RangeSet::default();
// We sent 5 packets, but ack only one, to stay
// in Drain state.
acked.insert(0..pn - 4);
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((0, 0, mss)),
);
// Now we are in Drain state.
assert!(r.congestion.bbr_state.filled_pipe);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::Drain);
assert!(r.congestion.bbr_state.pacing_gain < 1.0);
}
#[test]
fn bbr_probe_bw() {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);
let mut r = Recovery::new(&cfg);
let now = Instant::now();
let mss = r.max_datagram_size;
// At 4th roundtrip, filled_pipe=true and switch to Drain,
// but move to ProbeBW immediately because bytes_in_flight is
// smaller than BBRInFlight(1).
for (pn, _) in (0..4).enumerate() {
let pkt = Sent {
pkt_num: pn as u64,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
let rtt = Duration::from_millis(50);
let now = now + rtt;
let mut acked = ranges::RangeSet::default();
acked.insert(0..pn as u64 + 1);
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((0, 0, mss)),
);
}
// Now we are in ProbeBW state.
assert!(r.congestion.bbr_state.filled_pipe);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::ProbeBW);
// In the first ProbeBW cycle, pacing_gain should be >= 1.0.
assert!(r.congestion.bbr_state.pacing_gain >= 1.0);
}
#[test]
fn bbr_probe_rtt() {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);
let mut r = Recovery::new(&cfg);
let now = Instant::now();
let mss = r.max_datagram_size;
let mut pn = 0;
// At 4th roundtrip, filled_pipe=true and switch to Drain,
// but move to ProbeBW immediately because bytes_in_flight is
// smaller than BBRInFlight(1).
for _ in 0..4 {
let pkt = Sent {
pkt_num: pn,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
pn += 1;
let rtt = Duration::from_millis(50);
let now = now + rtt;
let mut acked = ranges::RangeSet::default();
acked.insert(0..pn);
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((0, 0, mss)),
);
}
// Now we are in ProbeBW state.
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::ProbeBW);
// After RTPROP_FILTER_LEN (10s), switch to ProbeRTT.
let now = now + RTPROP_FILTER_LEN;
let pkt = Sent {
pkt_num: pn,
frames: smallvec![],
time_sent: now,
time_acked: None,
time_lost: None,
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
tx_in_flight: 0,
lost: 0,
has_data: false,
pmtud: false,
};
r.on_packet_sent(
pkt,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
);
pn += 1;
// Don't update rtprop by giving larger rtt than before.
// If rtprop is updated, rtprop expiry check is reset.
let rtt = Duration::from_millis(100);
let now = now + rtt;
let mut acked = ranges::RangeSet::default();
acked.insert(0..pn);
assert_eq!(
r.on_ack_received(
&acked,
25,
packet::Epoch::Application,
HandshakeStatus::default(),
now,
"",
),
Ok((0, 0, mss)),
);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::ProbeRTT);
assert_eq!(r.congestion.bbr_state.pacing_gain, 1.0);
}
}
mod init;
mod pacing;
mod per_ack;
mod per_transmit;