1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
// Copyright (c) 2012 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.
#include "base/basictypes.h"
#include "base/logging.h"
#include "base/memory/scoped_ptr.h"
#include "net/quic/congestion_control/cubic.h"
#include "net/quic/test_tools/mock_clock.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace net {
namespace test {
class CubicPeer : public Cubic {
public:
explicit CubicPeer(QuicClock* clock)
: Cubic(clock) {
}
using Cubic::CubeRoot;
};
class CubicTest : public ::testing::Test {
protected:
CubicTest()
: one_ms_(QuicTime::Delta::FromMilliseconds(1)),
hundred_ms_(QuicTime::Delta::FromMilliseconds(100)) {
}
virtual void SetUp() {
cubic_.reset(new CubicPeer(&clock_));
}
const QuicTime::Delta one_ms_;
const QuicTime::Delta hundred_ms_;
MockClock clock_;
scoped_ptr<CubicPeer> cubic_;
};
TEST_F(CubicTest, CubeRootLow) {
for (uint32 i = 1; i < 256; ++i) {
uint64 cube = i * i * i;
uint8 cube_root = cubic_->CubeRoot(cube);
EXPECT_EQ(i, cube_root);
}
}
TEST_F(CubicTest, CubeRootHigh) {
// Test the range we will opperate in, 1300 to 130 000.
// We expect some loss in accuracy, accepting +-0.2%.
for (uint64 i = 1300; i < 20000; i += 100) {
uint64 cube = i * i * i;
uint32 cube_root = cubic_->CubeRoot(cube);
uint32 margin = cube_root >> 9; // Calculate 0.2% roughly by
// dividing by 512.
EXPECT_LE(i - margin, cube_root);
EXPECT_GE(i + margin, cube_root);
}
for (uint64 i = 20000; i < 130000; i *= 2) {
uint64 cube = i * i * i;
uint32 cube_root = cubic_->CubeRoot(cube);
uint32 margin = cube_root >> 9;
EXPECT_LE(i - margin, cube_root);
EXPECT_GE(i + margin, cube_root);
}
}
TEST_F(CubicTest, AboveOrgin) {
// Convex growth.
const QuicTime::Delta rtt_min = hundred_ms_;
uint32 current_cwnd = 10;
uint32 expected_cwnd = current_cwnd + 1;
// Initialize the state.
clock_.AdvanceTime(one_ms_);
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
current_cwnd = expected_cwnd;
// Normal TCP phase.
for (int i = 0; i < 48; ++i) {
for (uint32 n = 1; n < current_cwnd; ++n) {
// Call once per ACK.
EXPECT_EQ(current_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
}
clock_.AdvanceTime(hundred_ms_);
current_cwnd = cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min);
EXPECT_EQ(expected_cwnd, current_cwnd);
expected_cwnd++;
}
// Cubic phase.
for (int j = 48; j < 100; ++j) {
for (uint32 n = 1; n < current_cwnd; ++n) {
// Call once per ACK.
EXPECT_EQ(current_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
}
clock_.AdvanceTime(hundred_ms_);
current_cwnd = cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min);
}
float elapsed_time_s = 10.0f + 0.1f; // We need to add the RTT here.
expected_cwnd = 11 + (elapsed_time_s * elapsed_time_s * elapsed_time_s * 410)
/ 1024;
EXPECT_EQ(expected_cwnd, current_cwnd);
}
TEST_F(CubicTest, LossEvents) {
const QuicTime::Delta rtt_min = hundred_ms_;
uint32 current_cwnd = 422;
uint32 expected_cwnd = current_cwnd + 1;
// Initialize the state.
clock_.AdvanceTime(one_ms_);
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
expected_cwnd = current_cwnd * 717 / 1024;
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterPacketLoss(current_cwnd));
expected_cwnd = current_cwnd * 717 / 1024;
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterPacketLoss(current_cwnd));
}
TEST_F(CubicTest, BelowOrgin) {
// Concave growth.
const QuicTime::Delta rtt_min = hundred_ms_;
uint32 current_cwnd = 422;
uint32 expected_cwnd = current_cwnd + 1;
// Initialize the state.
clock_.AdvanceTime(one_ms_);
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
expected_cwnd = current_cwnd * 717 / 1024;
EXPECT_EQ(expected_cwnd,
cubic_->CongestionWindowAfterPacketLoss(current_cwnd));
current_cwnd = expected_cwnd;
// First update after epoch.
current_cwnd = cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min);
// Cubic phase.
for (int i = 0; i < 54; ++i) {
for (uint32 n = 1; n < current_cwnd; ++n) {
// Call once per ACK.
EXPECT_EQ(current_cwnd,
cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min));
}
clock_.AdvanceTime(hundred_ms_);
current_cwnd = cubic_->CongestionWindowAfterAck(current_cwnd, rtt_min);
}
expected_cwnd = 422;
EXPECT_EQ(expected_cwnd, current_cwnd);
}
} // namespace testing
} // namespace net
|
