| // Copyright 2019 The Chromium Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| #ifndef QUICHE_QUIC_CORE_CONGESTION_CONTROL_BBR2_MISC_H_ |
| #define QUICHE_QUIC_CORE_CONGESTION_CONTROL_BBR2_MISC_H_ |
| |
| #include <algorithm> |
| #include <limits> |
| |
| #include "quiche/quic/core/congestion_control/bandwidth_sampler.h" |
| #include "quiche/quic/core/congestion_control/send_algorithm_interface.h" |
| #include "quiche/quic/core/congestion_control/windowed_filter.h" |
| #include "quiche/quic/core/quic_bandwidth.h" |
| #include "quiche/quic/core/quic_packet_number.h" |
| #include "quiche/quic/core/quic_time.h" |
| #include "quiche/quic/core/quic_types.h" |
| #include "quiche/quic/platform/api/quic_export.h" |
| #include "quiche/quic/platform/api/quic_flags.h" |
| |
| namespace quic { |
| |
| template <typename T> |
| class QUIC_EXPORT_PRIVATE Limits { |
| public: |
| Limits(T min, T max) : min_(min), max_(max) {} |
| |
| // If [min, max] is an empty range, i.e. min > max, this function returns max, |
| // because typically a value larger than max means "risky". |
| T ApplyLimits(T raw_value) const { |
| return std::min(max_, std::max(min_, raw_value)); |
| } |
| |
| T Min() const { return min_; } |
| T Max() const { return max_; } |
| |
| private: |
| T min_; |
| T max_; |
| }; |
| |
| template <typename T> |
| QUIC_EXPORT_PRIVATE inline Limits<T> MinMax(T min, T max) { |
| return Limits<T>(min, max); |
| } |
| |
| template <typename T> |
| QUIC_EXPORT_PRIVATE inline Limits<T> NoLessThan(T min) { |
| return Limits<T>(min, std::numeric_limits<T>::max()); |
| } |
| |
| template <typename T> |
| QUIC_EXPORT_PRIVATE inline Limits<T> NoGreaterThan(T max) { |
| return Limits<T>(std::numeric_limits<T>::min(), max); |
| } |
| |
| template <typename T> |
| QUIC_EXPORT_PRIVATE inline Limits<T> Unlimited() { |
| return Limits<T>(std::numeric_limits<T>::min(), |
| std::numeric_limits<T>::max()); |
| } |
| |
| template <typename T> |
| QUIC_EXPORT_PRIVATE inline std::ostream& operator<<(std::ostream& os, |
| const Limits<T>& limits) { |
| return os << "[" << limits.Min() << ", " << limits.Max() << "]"; |
| } |
| |
| // Bbr2Params contains all parameters of a Bbr2Sender. |
| struct QUIC_EXPORT_PRIVATE Bbr2Params { |
| Bbr2Params(QuicByteCount cwnd_min, QuicByteCount cwnd_max) |
| : cwnd_limits(cwnd_min, cwnd_max) {} |
| |
| /* |
| * STARTUP parameters. |
| */ |
| |
| // The gain for CWND in startup. |
| float startup_cwnd_gain = 2.0; |
| // TODO(wub): Maybe change to the newly derived value of 2.773 (4 * ln(2)). |
| float startup_pacing_gain = 2.885; |
| |
| // Full bandwidth is declared if the total bandwidth growth is less than |
| // |startup_full_bw_threshold| times in the last |startup_full_bw_rounds| |
| // round trips. |
| float startup_full_bw_threshold = 1.25; |
| |
| QuicRoundTripCount startup_full_bw_rounds = 3; |
| |
| // The minimum number of loss marking events to exit STARTUP. |
| int64_t startup_full_loss_count = |
| GetQuicFlag(FLAGS_quic_bbr2_default_startup_full_loss_count); |
| |
| // If true, always exit STARTUP on loss, even if bandwidth exceeds threshold. |
| // If false, exit STARTUP on loss only if bandwidth is below threshold. |
| bool always_exit_startup_on_excess_loss = false; |
| |
| // If true, include extra acked during STARTUP and proactively reduce extra |
| // acked when bandwidth increases. |
| bool startup_include_extra_acked = false; |
| |
| // If true, exit STARTUP if bytes in flight has not gone below 2 * BDP at |
| // any point in the last round. |
| bool exit_startup_on_persistent_queue = false; |
| |
| /* |
| * DRAIN parameters. |
| */ |
| float drain_cwnd_gain = 2.0; |
| float drain_pacing_gain = 1.0 / 2.885; |
| |
| /* |
| * PROBE_BW parameters. |
| */ |
| // Max amount of randomness to inject in round counting for Reno-coexistence. |
| QuicRoundTripCount probe_bw_max_probe_rand_rounds = 2; |
| |
| // Max number of rounds before probing for Reno-coexistence. |
| uint32_t probe_bw_probe_max_rounds = 63; |
| |
| // Multiplier to get Reno-style probe epoch duration as: k * BDP round trips. |
| // If zero, disables Reno-style BDP-scaled coexistence mechanism. |
| float probe_bw_probe_reno_gain = 1.0; |
| |
| // Minimum duration for BBR-native probes. |
| QuicTime::Delta probe_bw_probe_base_duration = |
| QuicTime::Delta::FromMilliseconds( |
| GetQuicFlag(FLAGS_quic_bbr2_default_probe_bw_base_duration_ms)); |
| |
| // The upper bound of the random amount of BBR-native probes. |
| QuicTime::Delta probe_bw_probe_max_rand_duration = |
| QuicTime::Delta::FromMilliseconds( |
| GetQuicFlag(FLAGS_quic_bbr2_default_probe_bw_max_rand_duration_ms)); |
| |
| // The minimum number of loss marking events to exit the PROBE_UP phase. |
| int64_t probe_bw_full_loss_count = |
| GetQuicFlag(FLAGS_quic_bbr2_default_probe_bw_full_loss_count); |
| |
| // Multiplier to get target inflight (as multiple of BDP) for PROBE_UP phase. |
| float probe_bw_probe_inflight_gain = 1.25; |
| |
| // When attempting to grow inflight_hi in PROBE_UP, check whether we are cwnd |
| // limited before the current aggregation epoch, instead of before the current |
| // ack event. |
| bool probe_bw_check_cwnd_limited_before_aggregation_epoch = false; |
| |
| // Pacing gains. |
| float probe_bw_probe_up_pacing_gain = 1.25; |
| float probe_bw_probe_down_pacing_gain = 0.75; |
| float probe_bw_default_pacing_gain = 1.0; |
| |
| float probe_bw_cwnd_gain = 2.0; |
| |
| /* |
| * PROBE_UP parameters. |
| */ |
| bool probe_up_includes_acks_after_cwnd_limited = false; |
| bool probe_up_dont_exit_if_no_queue_ = false; |
| bool probe_up_ignore_inflight_hi = false; |
| |
| /* |
| * PROBE_RTT parameters. |
| */ |
| float probe_rtt_inflight_target_bdp_fraction = 0.5; |
| QuicTime::Delta probe_rtt_period = QuicTime::Delta::FromMilliseconds( |
| GetQuicFlag(FLAGS_quic_bbr2_default_probe_rtt_period_ms)); |
| QuicTime::Delta probe_rtt_duration = QuicTime::Delta::FromMilliseconds(200); |
| |
| /* |
| * Parameters used by multiple modes. |
| */ |
| |
| // The initial value of the max ack height filter's window length. |
| QuicRoundTripCount initial_max_ack_height_filter_window = |
| GetQuicFlag(FLAGS_quic_bbr2_default_initial_ack_height_filter_window); |
| |
| // Fraction of unutilized headroom to try to leave in path upon high loss. |
| float inflight_hi_headroom = |
| GetQuicFlag(FLAGS_quic_bbr2_default_inflight_hi_headroom); |
| |
| // Estimate startup/bw probing has gone too far if loss rate exceeds this. |
| float loss_threshold = GetQuicFlag(FLAGS_quic_bbr2_default_loss_threshold); |
| |
| // A common factor for multiplicative decreases. Used for adjusting |
| // bandwidth_lo, inflight_lo and inflight_hi upon losses. |
| float beta = 0.3; |
| |
| Limits<QuicByteCount> cwnd_limits; |
| |
| /* |
| * Experimental flags from QuicConfig. |
| */ |
| |
| // Can be disabled by connection option 'B2NA'. |
| bool add_ack_height_to_queueing_threshold = true; |
| |
| // Can be disabled by connection option 'B2RP'. |
| bool avoid_unnecessary_probe_rtt = true; |
| |
| // Can be enabled by connection option 'B2LO'. |
| bool ignore_inflight_lo = false; |
| |
| // Can be enabled by connection option 'B2H2'. |
| bool limit_inflight_hi_by_max_delivered = false; |
| |
| // Can be disabled by connection option 'B2SL'. |
| bool startup_loss_exit_use_max_delivered_for_inflight_hi = true; |
| |
| // Can be enabled by connection option 'B2DL'. |
| bool use_bytes_delivered_for_inflight_hi = false; |
| |
| // Can be disabled by connection option 'B2RC'. |
| bool enable_reno_coexistence = true; |
| |
| // For experimentation to improve fast convergence upon loss. |
| enum QuicBandwidthLoMode : uint8_t { |
| DEFAULT = 0, |
| MIN_RTT_REDUCTION = 1, // 'BBQ7' |
| INFLIGHT_REDUCTION = 2, // 'BBQ8' |
| CWND_REDUCTION = 3, // 'BBQ9' |
| }; |
| |
| // Different modes change bandwidth_lo_ differently upon loss. |
| QuicBandwidthLoMode bw_lo_mode_ = QuicBandwidthLoMode::DEFAULT; |
| |
| // Set the pacing gain to 25% larger than the recent BW increase in STARTUP. |
| bool decrease_startup_pacing_at_end_of_round = false; |
| }; |
| |
| class QUIC_EXPORT_PRIVATE RoundTripCounter { |
| public: |
| RoundTripCounter(); |
| |
| QuicRoundTripCount Count() const { return round_trip_count_; } |
| |
| QuicPacketNumber last_sent_packet() const { return last_sent_packet_; } |
| |
| // Must be called in ascending packet number order. |
| void OnPacketSent(QuicPacketNumber packet_number); |
| |
| // Return whether a round trip has just completed. |
| bool OnPacketsAcked(QuicPacketNumber last_acked_packet); |
| |
| void RestartRound(); |
| |
| private: |
| QuicRoundTripCount round_trip_count_; |
| QuicPacketNumber last_sent_packet_; |
| // The last sent packet number of the current round trip. |
| QuicPacketNumber end_of_round_trip_; |
| }; |
| |
| class QUIC_EXPORT_PRIVATE MinRttFilter { |
| public: |
| MinRttFilter(QuicTime::Delta initial_min_rtt, |
| QuicTime initial_min_rtt_timestamp); |
| |
| void Update(QuicTime::Delta sample_rtt, QuicTime now); |
| |
| void ForceUpdate(QuicTime::Delta sample_rtt, QuicTime now); |
| |
| QuicTime::Delta Get() const { return min_rtt_; } |
| |
| QuicTime GetTimestamp() const { return min_rtt_timestamp_; } |
| |
| private: |
| QuicTime::Delta min_rtt_; |
| // Time when the current value of |min_rtt_| was assigned. |
| QuicTime min_rtt_timestamp_; |
| }; |
| |
| class QUIC_EXPORT_PRIVATE Bbr2MaxBandwidthFilter { |
| public: |
| void Update(QuicBandwidth sample) { |
| max_bandwidth_[1] = std::max(sample, max_bandwidth_[1]); |
| } |
| |
| void Advance() { |
| if (max_bandwidth_[1].IsZero()) { |
| return; |
| } |
| |
| max_bandwidth_[0] = max_bandwidth_[1]; |
| max_bandwidth_[1] = QuicBandwidth::Zero(); |
| } |
| |
| QuicBandwidth Get() const { |
| return std::max(max_bandwidth_[0], max_bandwidth_[1]); |
| } |
| |
| private: |
| QuicBandwidth max_bandwidth_[2] = {QuicBandwidth::Zero(), |
| QuicBandwidth::Zero()}; |
| }; |
| |
| // Information that are meaningful only when Bbr2Sender::OnCongestionEvent is |
| // running. |
| struct QUIC_EXPORT_PRIVATE Bbr2CongestionEvent { |
| QuicTime event_time = QuicTime::Zero(); |
| |
| // The congestion window prior to the processing of the ack/loss events. |
| QuicByteCount prior_cwnd; |
| |
| // Total bytes inflight before the processing of the ack/loss events. |
| QuicByteCount prior_bytes_in_flight = 0; |
| |
| // Total bytes inflight after the processing of the ack/loss events. |
| QuicByteCount bytes_in_flight = 0; |
| |
| // Total bytes acked from acks in this event. |
| QuicByteCount bytes_acked = 0; |
| |
| // Total bytes lost from losses in this event. |
| QuicByteCount bytes_lost = 0; |
| |
| // Whether acked_packets indicates the end of a round trip. |
| bool end_of_round_trip = false; |
| |
| // When the event happened, whether the sender is probing for bandwidth. |
| bool is_probing_for_bandwidth = false; |
| |
| // Minimum rtt of all bandwidth samples from acked_packets. |
| // QuicTime::Delta::Infinite() if acked_packets is empty. |
| QuicTime::Delta sample_min_rtt = QuicTime::Delta::Infinite(); |
| |
| // Maximum bandwidth of all bandwidth samples from acked_packets. |
| // This sample may be app-limited, and will be Zero() if there are no newly |
| // acknowledged inflight packets. |
| QuicBandwidth sample_max_bandwidth = QuicBandwidth::Zero(); |
| |
| // The send state of the largest packet in acked_packets, unless it is empty. |
| // If acked_packets is empty, it's the send state of the largest packet in |
| // lost_packets. |
| SendTimeState last_packet_send_state; |
| }; |
| |
| // Bbr2NetworkModel takes low level congestion signals(packets sent/acked/lost) |
| // as input and produces BBRv2 model parameters like inflight_(hi|lo), |
| // bandwidth_(hi|lo), bandwidth and rtt estimates, etc. |
| class QUIC_EXPORT_PRIVATE Bbr2NetworkModel { |
| public: |
| Bbr2NetworkModel(const Bbr2Params* params, QuicTime::Delta initial_rtt, |
| QuicTime initial_rtt_timestamp, float cwnd_gain, |
| float pacing_gain, const BandwidthSampler* old_sampler); |
| |
| void OnPacketSent(QuicTime sent_time, QuicByteCount bytes_in_flight, |
| QuicPacketNumber packet_number, QuicByteCount bytes, |
| HasRetransmittableData is_retransmittable); |
| |
| void OnCongestionEventStart(QuicTime event_time, |
| const AckedPacketVector& acked_packets, |
| const LostPacketVector& lost_packets, |
| Bbr2CongestionEvent* congestion_event); |
| |
| void OnCongestionEventFinish(QuicPacketNumber least_unacked_packet, |
| const Bbr2CongestionEvent& congestion_event); |
| |
| // Update the model without a congestion event. |
| // Min rtt is updated if |rtt| is non-zero and smaller than existing min rtt. |
| void UpdateNetworkParameters(QuicTime::Delta rtt); |
| |
| // Update inflight/bandwidth short-term lower bounds. |
| void AdaptLowerBounds(const Bbr2CongestionEvent& congestion_event); |
| |
| // Restart the current round trip as if it is starting now. |
| void RestartRoundEarly(); |
| |
| void AdvanceMaxBandwidthFilter() { max_bandwidth_filter_.Advance(); } |
| |
| void OnApplicationLimited() { bandwidth_sampler_.OnAppLimited(); } |
| |
| // Calculates BDP using the current MaxBandwidth. |
| QuicByteCount BDP() const { return BDP(MaxBandwidth()); } |
| |
| QuicByteCount BDP(QuicBandwidth bandwidth) const { |
| return bandwidth * MinRtt(); |
| } |
| |
| QuicByteCount BDP(QuicBandwidth bandwidth, float gain) const { |
| return bandwidth * MinRtt() * gain; |
| } |
| |
| QuicTime::Delta MinRtt() const { return min_rtt_filter_.Get(); } |
| |
| QuicTime MinRttTimestamp() const { return min_rtt_filter_.GetTimestamp(); } |
| |
| // TODO(wub): If we do this too frequently, we can potentailly postpone |
| // PROBE_RTT indefinitely. Observe how it works in production and improve it. |
| void PostponeMinRttTimestamp(QuicTime::Delta duration) { |
| min_rtt_filter_.ForceUpdate(MinRtt(), MinRttTimestamp() + duration); |
| } |
| |
| QuicBandwidth MaxBandwidth() const { return max_bandwidth_filter_.Get(); } |
| |
| QuicByteCount MaxAckHeight() const { |
| return bandwidth_sampler_.max_ack_height(); |
| } |
| |
| // 2 packets. Used to indicate the typical number of bytes ACKed at once. |
| QuicByteCount QueueingThresholdExtraBytes() const { |
| return 2 * kDefaultTCPMSS; |
| } |
| |
| bool cwnd_limited_before_aggregation_epoch() const { |
| return cwnd_limited_before_aggregation_epoch_; |
| } |
| |
| void EnableOverestimateAvoidance() { |
| bandwidth_sampler_.EnableOverestimateAvoidance(); |
| } |
| |
| bool IsBandwidthOverestimateAvoidanceEnabled() const { |
| return bandwidth_sampler_.IsOverestimateAvoidanceEnabled(); |
| } |
| |
| void OnPacketNeutered(QuicPacketNumber packet_number) { |
| bandwidth_sampler_.OnPacketNeutered(packet_number); |
| } |
| |
| uint64_t num_ack_aggregation_epochs() const { |
| return bandwidth_sampler_.num_ack_aggregation_epochs(); |
| } |
| |
| void SetStartNewAggregationEpochAfterFullRound(bool value) { |
| bandwidth_sampler_.SetStartNewAggregationEpochAfterFullRound(value); |
| } |
| |
| void SetLimitMaxAckHeightTrackerBySendRate(bool value) { |
| bandwidth_sampler_.SetLimitMaxAckHeightTrackerBySendRate(value); |
| } |
| |
| void SetMaxAckHeightTrackerWindowLength(QuicRoundTripCount value) { |
| bandwidth_sampler_.SetMaxAckHeightTrackerWindowLength(value); |
| } |
| |
| void SetReduceExtraAckedOnBandwidthIncrease(bool value) { |
| bandwidth_sampler_.SetReduceExtraAckedOnBandwidthIncrease(value); |
| } |
| |
| bool MaybeExpireMinRtt(const Bbr2CongestionEvent& congestion_event); |
| |
| QuicBandwidth BandwidthEstimate() const { |
| return std::min(MaxBandwidth(), bandwidth_lo_); |
| } |
| |
| QuicRoundTripCount RoundTripCount() const { |
| return round_trip_counter_.Count(); |
| } |
| |
| // Return true if the number of loss events exceeds max_loss_events and |
| // fraction of bytes lost exceed the loss threshold. |
| bool IsInflightTooHigh(const Bbr2CongestionEvent& congestion_event, |
| int64_t max_loss_events) const; |
| |
| // Check bandwidth growth in the past round. Must be called at the end of a |
| // round. Returns true if there was sufficient bandwidth growth and false |
| // otherwise. If it's been too many rounds without growth, also sets |
| // |full_bandwidth_reached_| to true. |
| bool HasBandwidthGrowth(const Bbr2CongestionEvent& congestion_event); |
| |
| // Returns true if the minimum bytes in flight during the round is greater |
| // than the BDP * |bdp_gain|. |
| bool CheckPersistentQueue(const Bbr2CongestionEvent& congestion_event, |
| float bdp_gain); |
| |
| QuicPacketNumber last_sent_packet() const { |
| return round_trip_counter_.last_sent_packet(); |
| } |
| |
| QuicByteCount total_bytes_acked() const { |
| return bandwidth_sampler_.total_bytes_acked(); |
| } |
| |
| QuicByteCount total_bytes_lost() const { |
| return bandwidth_sampler_.total_bytes_lost(); |
| } |
| |
| QuicByteCount total_bytes_sent() const { |
| return bandwidth_sampler_.total_bytes_sent(); |
| } |
| |
| int64_t loss_events_in_round() const { return loss_events_in_round_; } |
| |
| QuicByteCount max_bytes_delivered_in_round() const { |
| return max_bytes_delivered_in_round_; |
| } |
| |
| QuicByteCount min_bytes_in_flight_in_round() const { |
| return min_bytes_in_flight_in_round_; |
| } |
| |
| QuicPacketNumber end_of_app_limited_phase() const { |
| return bandwidth_sampler_.end_of_app_limited_phase(); |
| } |
| |
| QuicBandwidth bandwidth_latest() const { return bandwidth_latest_; } |
| QuicBandwidth bandwidth_lo() const { return bandwidth_lo_; } |
| static QuicBandwidth bandwidth_lo_default() { |
| return QuicBandwidth::Infinite(); |
| } |
| void clear_bandwidth_lo() { bandwidth_lo_ = bandwidth_lo_default(); } |
| |
| QuicByteCount inflight_latest() const { return inflight_latest_; } |
| QuicByteCount inflight_lo() const { return inflight_lo_; } |
| static QuicByteCount inflight_lo_default() { |
| return std::numeric_limits<QuicByteCount>::max(); |
| } |
| void clear_inflight_lo() { inflight_lo_ = inflight_lo_default(); } |
| void cap_inflight_lo(QuicByteCount cap); |
| |
| QuicByteCount inflight_hi_with_headroom() const; |
| QuicByteCount inflight_hi() const { return inflight_hi_; } |
| static QuicByteCount inflight_hi_default() { |
| return std::numeric_limits<QuicByteCount>::max(); |
| } |
| void set_inflight_hi(QuicByteCount inflight_hi) { |
| inflight_hi_ = inflight_hi; |
| } |
| |
| float cwnd_gain() const { return cwnd_gain_; } |
| void set_cwnd_gain(float cwnd_gain) { cwnd_gain_ = cwnd_gain; } |
| |
| float pacing_gain() const { return pacing_gain_; } |
| void set_pacing_gain(float pacing_gain) { pacing_gain_ = pacing_gain; } |
| |
| bool full_bandwidth_reached() const { return full_bandwidth_reached_; } |
| void set_full_bandwidth_reached() { full_bandwidth_reached_ = true; } |
| QuicBandwidth full_bandwidth_baseline() const { |
| return full_bandwidth_baseline_; |
| } |
| QuicRoundTripCount rounds_without_bandwidth_growth() const { |
| return rounds_without_bandwidth_growth_; |
| } |
| |
| private: |
| // Called when a new round trip starts. |
| void OnNewRound(); |
| |
| const Bbr2Params& Params() const { return *params_; } |
| const Bbr2Params* const params_; |
| RoundTripCounter round_trip_counter_; |
| |
| // Bandwidth sampler provides BBR with the bandwidth measurements at |
| // individual points. |
| BandwidthSampler bandwidth_sampler_; |
| // The filter that tracks the maximum bandwidth over multiple recent round |
| // trips. |
| Bbr2MaxBandwidthFilter max_bandwidth_filter_; |
| MinRttFilter min_rtt_filter_; |
| |
| // Bytes lost in the current round. Updated once per congestion event. |
| QuicByteCount bytes_lost_in_round_ = 0; |
| // Number of loss marking events in the current round. |
| int64_t loss_events_in_round_ = 0; |
| |
| // A max of bytes delivered among all congestion events in the current round. |
| // A congestions event's bytes delivered is the total bytes acked between time |
| // Ts and Ta, which is the time when the largest acked packet(within the |
| // congestion event) was sent and acked, respectively. |
| QuicByteCount max_bytes_delivered_in_round_ = 0; |
| |
| // The minimum bytes in flight during this round. |
| QuicByteCount min_bytes_in_flight_in_round_ = 0; |
| |
| // Max bandwidth in the current round. Updated once per congestion event. |
| QuicBandwidth bandwidth_latest_ = QuicBandwidth::Zero(); |
| // Max bandwidth of recent rounds. Updated once per round. |
| QuicBandwidth bandwidth_lo_ = bandwidth_lo_default(); |
| // bandwidth_lo_ at the beginning of a round with loss. Only used when the |
| // bw_lo_mode is non-default. |
| QuicBandwidth prior_bandwidth_lo_ = QuicBandwidth::Zero(); |
| |
| // Max inflight in the current round. Updated once per congestion event. |
| QuicByteCount inflight_latest_ = 0; |
| // Max inflight of recent rounds. Updated once per round. |
| QuicByteCount inflight_lo_ = inflight_lo_default(); |
| QuicByteCount inflight_hi_ = inflight_hi_default(); |
| |
| float cwnd_gain_; |
| float pacing_gain_; |
| |
| // Whether we are cwnd limited prior to the start of the current aggregation |
| // epoch. |
| bool cwnd_limited_before_aggregation_epoch_ = false; |
| |
| // STARTUP-centric fields which experimentally used by PROBE_UP. |
| bool full_bandwidth_reached_ = false; |
| QuicBandwidth full_bandwidth_baseline_ = QuicBandwidth::Zero(); |
| QuicRoundTripCount rounds_without_bandwidth_growth_ = 0; |
| }; |
| |
| enum class Bbr2Mode : uint8_t { |
| // Startup phase of the connection. |
| STARTUP, |
| // After achieving the highest possible bandwidth during the startup, lower |
| // the pacing rate in order to drain the queue. |
| DRAIN, |
| // Cruising mode. |
| PROBE_BW, |
| // Temporarily slow down sending in order to empty the buffer and measure |
| // the real minimum RTT. |
| PROBE_RTT, |
| }; |
| |
| QUIC_EXPORT_PRIVATE inline std::ostream& operator<<(std::ostream& os, |
| const Bbr2Mode& mode) { |
| switch (mode) { |
| case Bbr2Mode::STARTUP: |
| return os << "STARTUP"; |
| case Bbr2Mode::DRAIN: |
| return os << "DRAIN"; |
| case Bbr2Mode::PROBE_BW: |
| return os << "PROBE_BW"; |
| case Bbr2Mode::PROBE_RTT: |
| return os << "PROBE_RTT"; |
| } |
| return os << "<Invalid Mode>"; |
| } |
| |
| // The base class for all BBRv2 modes. A Bbr2Sender is in one mode at a time, |
| // this interface is used to implement mode-specific behaviors. |
| class Bbr2Sender; |
| class QUIC_EXPORT_PRIVATE Bbr2ModeBase { |
| public: |
| Bbr2ModeBase(const Bbr2Sender* sender, Bbr2NetworkModel* model) |
| : sender_(sender), model_(model) {} |
| |
| virtual ~Bbr2ModeBase() = default; |
| |
| // Called when entering/leaving this mode. |
| // congestion_event != nullptr means BBRv2 is switching modes in the context |
| // of a ack and/or loss. |
| virtual void Enter(QuicTime now, |
| const Bbr2CongestionEvent* congestion_event) = 0; |
| virtual void Leave(QuicTime now, |
| const Bbr2CongestionEvent* congestion_event) = 0; |
| |
| virtual Bbr2Mode OnCongestionEvent( |
| QuicByteCount prior_in_flight, QuicTime event_time, |
| const AckedPacketVector& acked_packets, |
| const LostPacketVector& lost_packets, |
| const Bbr2CongestionEvent& congestion_event) = 0; |
| |
| virtual Limits<QuicByteCount> GetCwndLimits() const = 0; |
| |
| virtual bool IsProbingForBandwidth() const = 0; |
| |
| virtual Bbr2Mode OnExitQuiescence(QuicTime now, |
| QuicTime quiescence_start_time) = 0; |
| |
| protected: |
| const Bbr2Sender* const sender_; |
| Bbr2NetworkModel* model_; |
| }; |
| |
| QUIC_EXPORT_PRIVATE inline QuicByteCount BytesInFlight( |
| const SendTimeState& send_state) { |
| QUICHE_DCHECK(send_state.is_valid); |
| if (send_state.bytes_in_flight != 0) { |
| return send_state.bytes_in_flight; |
| } |
| return send_state.total_bytes_sent - send_state.total_bytes_acked - |
| send_state.total_bytes_lost; |
| } |
| |
| } // namespace quic |
| |
| #endif // QUICHE_QUIC_CORE_CONGESTION_CONTROL_BBR2_MISC_H_ |