| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ | 5 #ifndef NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ |
| 6 #define NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ | 6 #define NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ |
| 7 | 7 |
| 8 #include <algorithm> | 8 #include <algorithm> |
| 9 #include <map> | 9 #include <map> |
| 10 | 10 |
| (...skipping 25 matching lines...) Expand all Loading... |
| 36 | 36 |
| 37 // Returns the time the next packet will be lost, or zero if there | 37 // Returns the time the next packet will be lost, or zero if there |
| 38 // are no nacked pending packets outstanding. | 38 // are no nacked pending packets outstanding. |
| 39 // TODO(ianswett): Ideally the RTT variance and the RTT would be used to | 39 // TODO(ianswett): Ideally the RTT variance and the RTT would be used to |
| 40 // determine the time a packet is considered lost. | 40 // determine the time a packet is considered lost. |
| 41 // TODO(ianswett): Consider using Max(1.25 * srtt, 1.125 * last_rtt). | 41 // TODO(ianswett): Consider using Max(1.25 * srtt, 1.125 * last_rtt). |
| 42 virtual QuicTime GetLossTimeout() const OVERRIDE; | 42 virtual QuicTime GetLossTimeout() const OVERRIDE; |
| 43 | 43 |
| 44 private: | 44 private: |
| 45 QuicTime loss_detection_timeout_; | 45 QuicTime loss_detection_timeout_; |
| 46 |
| 47 DISALLOW_COPY_AND_ASSIGN(TimeLossAlgorithm); |
| 46 }; | 48 }; |
| 47 | 49 |
| 48 } // namespace net | 50 } // namespace net |
| 49 | 51 |
| 50 #endif // NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ | 52 #endif // NET_QUIC_CONGESTION_CONTROL_TIME_LOSS_ALGORITHM_H_ |
| OLD | NEW |