This source file includes following definitions.
- GetLossDetectionType
- DetectLostPackets
- GetLossTimeout
#include "net/quic/congestion_control/time_loss_algorithm.h"
#include "net/quic/congestion_control/rtt_stats.h"
#include "net/quic/quic_protocol.h"
namespace net {
namespace {
static const size_t kMinLossDelayMs = 5;
static const double kLossDelayMultiplier = 1.25;
}
TimeLossAlgorithm::TimeLossAlgorithm()
: loss_detection_timeout_(QuicTime::Zero()) { }
LossDetectionType TimeLossAlgorithm::GetLossDetectionType() const {
return kTime;
}
SequenceNumberSet TimeLossAlgorithm::DetectLostPackets(
const QuicUnackedPacketMap& unacked_packets,
const QuicTime& time,
QuicPacketSequenceNumber largest_observed,
const RttStats& rtt_stats) {
SequenceNumberSet lost_packets;
loss_detection_timeout_ = QuicTime::Zero();
QuicTime::Delta loss_delay = QuicTime::Delta::Max(
QuicTime::Delta::FromMilliseconds(kMinLossDelayMs),
QuicTime::Delta::Max(rtt_stats.SmoothedRtt(), rtt_stats.latest_rtt())
.Multiply(kLossDelayMultiplier));
for (QuicUnackedPacketMap::const_iterator it = unacked_packets.begin();
it != unacked_packets.end() && it->first <= largest_observed; ++it) {
if (!it->second.pending) {
continue;
}
LOG_IF(DFATAL, it->second.nack_count == 0)
<< "All packets less than largest observed should have been nacked.";
QuicTime when_lost = it->second.sent_time.Add(loss_delay);
if (time < when_lost) {
loss_detection_timeout_ = when_lost;
break;
}
lost_packets.insert(it->first);
}
return lost_packets;
}
QuicTime TimeLossAlgorithm::GetLossTimeout() const {
return loss_detection_timeout_;
}
}