Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

(CC refactor 8) recovery: move all congestion control related fields to a new struct #1778

Closed
wants to merge 3 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 0 additions & 2 deletions quiche/src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -2041,8 +2041,6 @@ impl Connection {
conn.derived_initial_secrets = true;
}

conn.paths.get_mut(active_path_id)?.recovery.on_init();

Ok(conn)
}

Expand Down
2 changes: 1 addition & 1 deletion quiche/src/path.rs
Original file line number Diff line number Diff line change
Expand Up @@ -481,7 +481,7 @@ impl Path {
active: self.active,
recv: self.recv_count,
sent: self.sent_count,
lost: self.recovery.lost_count,
lost: self.recovery.lost_count(),
retrans: self.retrans_count,
rtt: self.recovery.rtt(),
min_rtt: self.recovery.min_rtt(),
Expand Down
19 changes: 9 additions & 10 deletions quiche/src/recovery/bbr/init.rs
Original file line number Diff line number Diff line change
Expand Up @@ -24,21 +24,20 @@
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

use super::*;
use self::rtt::INITIAL_RTT;

use crate::recovery::Recovery;
use super::*;

use std::time::Instant;

// BBR Functions at Initialization.
//

// 4.3.1. Initialization Steps
pub fn bbr_init(r: &mut Recovery) {
let rtt = r.rtt();
pub fn bbr_init(r: &mut Congestion) {
let bbr = &mut r.bbr_state;

bbr.rtprop = rtt;
bbr.rtprop = INITIAL_RTT;
bbr.rtprop_stamp = Instant::now();
bbr.next_round_delivered = r.delivery_rate.delivered();

Expand All @@ -51,7 +50,7 @@ pub fn bbr_init(r: &mut Recovery) {
}

// 4.1.1.3. Tracking Time for the BBR.BtlBw Max Filter
fn bbr_init_round_counting(r: &mut Recovery) {
fn bbr_init_round_counting(r: &mut Congestion) {
let bbr = &mut r.bbr_state;

bbr.next_round_delivered = 0;
Expand All @@ -60,10 +59,10 @@ fn bbr_init_round_counting(r: &mut Recovery) {
}

// 4.2.1. Pacing Rate
fn bbr_init_pacing_rate(r: &mut Recovery) {
fn bbr_init_pacing_rate(r: &mut Congestion) {
let bbr = &mut r.bbr_state;

let srtt = r.rtt_stats.smoothed_rtt.as_secs_f64();
let srtt = INITIAL_RTT.as_secs_f64();

// At init, cwnd is initcwnd.
let nominal_bandwidth = r.congestion_window as f64 / srtt;
Expand All @@ -72,7 +71,7 @@ fn bbr_init_pacing_rate(r: &mut Recovery) {
}

// 4.3.2.1. Startup Dynamics
pub fn bbr_enter_startup(r: &mut Recovery) {
pub fn bbr_enter_startup(r: &mut Congestion) {
let bbr = &mut r.bbr_state;

bbr.state = BBRStateMachine::Startup;
Expand All @@ -81,7 +80,7 @@ pub fn bbr_enter_startup(r: &mut Recovery) {
}

// 4.3.2.2. Estimating When Startup has Filled the Pipe
fn bbr_init_full_pipe(r: &mut Recovery) {
fn bbr_init_full_pipe(r: &mut Congestion) {
let bbr = &mut r.bbr_state;

bbr.filled_pipe = false;
Expand Down
91 changes: 41 additions & 50 deletions quiche/src/recovery/bbr/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -250,7 +250,7 @@ impl State {
}

// When entering the recovery episode.
fn bbr_enter_recovery(r: &mut Recovery, in_flight: usize, now: Instant) {
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);
Expand All @@ -266,7 +266,7 @@ fn bbr_enter_recovery(r: &mut Recovery, in_flight: usize, now: Instant) {
}

// When exiting the recovery episode.
fn bbr_exit_recovery(r: &mut Recovery) {
fn bbr_exit_recovery(r: &mut Congestion) {
r.congestion_recovery_start_time = None;

r.bbr_state.packet_conservation = false;
Expand All @@ -277,28 +277,33 @@ fn bbr_exit_recovery(r: &mut Recovery) {

// Congestion Control Hooks.
//
fn on_init(r: &mut Recovery) {
fn on_init(r: &mut Congestion) {
init::bbr_init(r);
}

fn reset(r: &mut Recovery) {
fn reset(r: &mut Congestion) {
r.bbr_state = State::new();

init::bbr_init(r);
}

fn on_packet_sent(r: &mut Recovery, _sent_bytes: usize, _now: Instant) {
per_transmit::bbr_on_transmit(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 Recovery, packets: &mut Vec<Acked>, now: Instant) {
r.bbr_state.prior_bytes_in_flight = 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, now);
per_ack::bbr_update_model_and_state(r, &p, bytes_in_flight, now);

acked_bytes + p.size
});
Expand All @@ -310,40 +315,41 @@ fn on_packets_acked(r: &mut Recovery, packets: &mut Vec<Acked>, now: Instant) {
}
}

per_ack::bbr_update_control_parameters(r, now);
per_ack::bbr_update_control_parameters(r, bytes_in_flight, now);

r.bbr_state.newly_lost_bytes = 0;
}

fn congestion_event(
r: &mut Recovery, lost_bytes: usize, largest_lost_pkt: &Sent, now: Instant,
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, r.bytes_in_flight - lost_bytes, now);
bbr_enter_recovery(r, bytes_in_flight - lost_bytes, now);
}
}

fn collapse_cwnd(r: &mut Recovery) {
fn collapse_cwnd(r: &mut Congestion, bytes_in_flight: usize) {
r.bbr_state.prior_cwnd = per_ack::bbr_save_cwnd(r);

reno::collapse_cwnd(r);
reno::collapse_cwnd(r, bytes_in_flight);
}

fn checkpoint(_r: &mut Recovery) {}
fn checkpoint(_r: &mut Congestion) {}

fn rollback(_r: &mut Recovery) -> bool {
fn rollback(_r: &mut Congestion) -> bool {
false
}

fn has_custom_pacing() -> bool {
true
}

fn debug_fmt(r: &Recovery, f: &mut std::fmt::Formatter) -> std::fmt::Result {
fn debug_fmt(r: &Congestion, f: &mut std::fmt::Formatter) -> std::fmt::Result {
let bbr = &r.bbr_state;

write!(
Expand All @@ -366,19 +372,15 @@ mod tests {
let mut cfg = crate::Config::new(crate::PROTOCOL_VERSION).unwrap();
cfg.set_cc_algorithm(recovery::CongestionControlAlgorithm::BBR);

let mut r = Recovery::new(&cfg);

// on_init() is called in Connection::new(), so it need to be
// called manually here.
r.on_init();
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.bbr_state.state, BBRStateMachine::Startup);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::Startup);
}

#[test]
Expand All @@ -389,7 +391,6 @@ mod tests {
let mut r = Recovery::new(&cfg);
let now = Instant::now();

r.on_init();
r.on_packet_sent_cc(0, 1000, now);

assert_eq!(r.bytes_in_flight, 1000);
Expand All @@ -404,8 +405,6 @@ mod tests {
let now = Instant::now();
let mss = r.max_datagram_size;

r.on_init();

// Send 5 packets.
for pn in 0..5 {
let pkt = Sent {
Expand Down Expand Up @@ -456,14 +455,14 @@ mod tests {
Ok((0, 0)),
);

assert_eq!(r.bbr_state.state, BBRStateMachine::Startup);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::Startup);
assert_eq!(r.cwnd(), cwnd_prev + mss * 5);
assert_eq!(r.bytes_in_flight, 0);
assert_eq!(
r.delivery_rate(),
((mss * 5) as f64 / rtt.as_secs_f64()) as u64
);
assert_eq!(r.bbr_state.btlbw, r.delivery_rate());
assert_eq!(r.congestion.bbr_state.btlbw, r.delivery_rate());
}

#[test]
Expand All @@ -475,8 +474,6 @@ mod tests {
let now = Instant::now();
let mss = r.max_datagram_size;

r.on_init();

// Send 5 packets.
for pn in 0..5 {
let pkt = Sent {
Expand Down Expand Up @@ -543,8 +540,6 @@ mod tests {
let now = Instant::now();
let mss = r.max_datagram_size;

r.on_init();

let mut pn = 0;

// Stop right before filled_pipe=true.
Expand All @@ -558,7 +553,7 @@ mod tests {
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.delivery_rate.delivered(),
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
Expand Down Expand Up @@ -610,7 +605,7 @@ mod tests {
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.delivery_rate.delivered(),
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
Expand Down Expand Up @@ -654,9 +649,9 @@ mod tests {
);

// Now we are in Drain state.
assert!(r.bbr_state.filled_pipe);
assert_eq!(r.bbr_state.state, BBRStateMachine::Drain);
assert!(r.bbr_state.pacing_gain < 1.0);
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]
Expand All @@ -668,8 +663,6 @@ mod tests {
let now = Instant::now();
let mss = r.max_datagram_size;

r.on_init();

// At 4th roundtrip, filled_pipe=true and switch to Drain,
// but move to ProbeBW immediately because bytes_in_flight is
// smaller than BBRInFlight(1).
Expand All @@ -683,7 +676,7 @@ mod tests {
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.delivery_rate.delivered(),
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
Expand Down Expand Up @@ -722,11 +715,11 @@ mod tests {
}

// Now we are in ProbeBW state.
assert!(r.bbr_state.filled_pipe);
assert_eq!(r.bbr_state.state, BBRStateMachine::ProbeBW);
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.bbr_state.pacing_gain >= 1.0);
assert!(r.congestion.bbr_state.pacing_gain >= 1.0);
}

#[test]
Expand All @@ -738,8 +731,6 @@ mod tests {
let now = Instant::now();
let mss = r.max_datagram_size;

r.on_init();

let mut pn = 0;

// At 4th roundtrip, filled_pipe=true and switch to Drain,
Expand All @@ -755,7 +746,7 @@ mod tests {
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.delivery_rate.delivered(),
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
Expand Down Expand Up @@ -796,7 +787,7 @@ mod tests {
}

// Now we are in ProbeBW state.
assert_eq!(r.bbr_state.state, BBRStateMachine::ProbeBW);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::ProbeBW);

// After RTPROP_FILTER_LEN (10s), switch to ProbeRTT.
let now = now + RTPROP_FILTER_LEN;
Expand All @@ -810,7 +801,7 @@ mod tests {
size: mss,
ack_eliciting: true,
in_flight: true,
delivered: r.delivery_rate.delivered(),
delivered: r.congestion.delivery_rate.delivered(),
delivered_time: now,
first_sent_time: now,
is_app_limited: false,
Expand Down Expand Up @@ -851,8 +842,8 @@ mod tests {
Ok((0, 0)),
);

assert_eq!(r.bbr_state.state, BBRStateMachine::ProbeRTT);
assert_eq!(r.bbr_state.pacing_gain, 1.0);
assert_eq!(r.congestion.bbr_state.state, BBRStateMachine::ProbeRTT);
assert_eq!(r.congestion.bbr_state.pacing_gain, 1.0);
}
}

Expand Down
Loading