OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ | 5 #ifndef NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ |
6 #define NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ | 6 #define NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ |
7 | 7 |
8 #include <algorithm> | 8 #include <algorithm> |
9 #include <map> | 9 #include <map> |
10 | 10 |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 QuicTime time, | 52 QuicTime time, |
53 const RttStats& rtt_stats, | 53 const RttStats& rtt_stats, |
54 QuicPacketNumber spurious_retransmission) override; | 54 QuicPacketNumber spurious_retransmission) override; |
55 | 55 |
56 int reordering_shift() const { return reordering_shift_; } | 56 int reordering_shift() const { return reordering_shift_; } |
57 | 57 |
58 private: | 58 private: |
59 QuicTime loss_detection_timeout_; | 59 QuicTime loss_detection_timeout_; |
60 // Largest sent packet when a spurious retransmit is detected. | 60 // Largest sent packet when a spurious retransmit is detected. |
61 // Prevents increasing the reordering threshold multiple times per epoch. | 61 // Prevents increasing the reordering threshold multiple times per epoch. |
| 62 // TODO(ianswett): Deprecate when |
| 63 // quic_reloadable_flag_quic_fix_adaptive_time_loss is deprecated. |
62 QuicPacketNumber largest_sent_on_spurious_retransmit_; | 64 QuicPacketNumber largest_sent_on_spurious_retransmit_; |
63 LossDetectionType loss_type_; | 65 LossDetectionType loss_type_; |
64 // Fraction of a max(SRTT, latest_rtt) to permit reordering before declaring | 66 // Fraction of a max(SRTT, latest_rtt) to permit reordering before declaring |
65 // loss. Fraction calculated by shifting max(SRTT, latest_rtt) to the right | 67 // loss. Fraction calculated by shifting max(SRTT, latest_rtt) to the right |
66 // by reordering_shift. | 68 // by reordering_shift. |
67 int reordering_shift_; | 69 int reordering_shift_; |
68 // The largest newly acked from the previous call to DetectLosses. | 70 // The largest newly acked from the previous call to DetectLosses. |
69 QuicPacketNumber largest_previously_acked_; | 71 QuicPacketNumber largest_previously_acked_; |
70 | 72 |
71 DISALLOW_COPY_AND_ASSIGN(GeneralLossAlgorithm); | 73 DISALLOW_COPY_AND_ASSIGN(GeneralLossAlgorithm); |
72 }; | 74 }; |
73 | 75 |
74 } // namespace net | 76 } // namespace net |
75 | 77 |
76 #endif // NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ | 78 #endif // NET_QUIC_CORE_CONGESTION_CONTROL_GENERAL_LOSS_ALGORITHM_H_ |
OLD | NEW |