OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 #include <limits> | 11 #include <limits> |
12 | 12 |
13 #include "webrtc/modules/pacing/bitrate_prober.h" | 13 #include "webrtc/modules/pacing/bitrate_prober.h" |
14 #include "webrtc/test/gtest.h" | 14 #include "webrtc/test/gtest.h" |
15 | 15 |
16 namespace webrtc { | 16 namespace webrtc { |
17 | 17 |
18 TEST(BitrateProberTest, VerifyStatesAndTimeBetweenProbes) { | 18 TEST(BitrateProberTest, VerifyStatesAndTimeBetweenProbes) { |
19 BitrateProber prober; | 19 BitrateProber prober; |
20 EXPECT_FALSE(prober.IsProbing()); | 20 EXPECT_FALSE(prober.IsProbing()); |
21 int64_t now_ms = 0; | 21 int64_t now_ms = 0; |
22 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 22 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
23 | 23 |
24 prober.CreateProbeCluster(900000, 6); | 24 const int kTestBitrate1 = 900000; |
25 prober.CreateProbeCluster(1800000, 5); | 25 const int kTestBitrate2 = 1800000; |
| 26 const int kClusterSize = 5; |
| 27 const int kProbeSize = 1000; |
| 28 |
| 29 prober.CreateProbeCluster(kTestBitrate1, kClusterSize); |
| 30 prober.CreateProbeCluster(kTestBitrate2, kClusterSize); |
26 EXPECT_FALSE(prober.IsProbing()); | 31 EXPECT_FALSE(prober.IsProbing()); |
27 | 32 |
28 prober.OnIncomingPacket(1000); | 33 prober.OnIncomingPacket(kProbeSize); |
29 EXPECT_TRUE(prober.IsProbing()); | 34 EXPECT_TRUE(prober.IsProbing()); |
30 EXPECT_EQ(0, prober.CurrentClusterId()); | 35 EXPECT_EQ(0, prober.CurrentClusterId()); |
31 | 36 |
32 // First packet should probe as soon as possible. | 37 // First packet should probe as soon as possible. |
33 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 38 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
34 prober.ProbeSent(now_ms, 1000); | |
35 | 39 |
36 for (int i = 0; i < 5; ++i) { | 40 for (int i = 0; i < kClusterSize; ++i) { |
37 EXPECT_EQ(8, prober.TimeUntilNextProbe(now_ms)); | 41 now_ms += prober.TimeUntilNextProbe(now_ms); |
38 now_ms += 4; | |
39 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); | |
40 now_ms += 4; | |
41 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 42 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
42 EXPECT_EQ(0, prober.CurrentClusterId()); | 43 EXPECT_EQ(0, prober.CurrentClusterId()); |
43 prober.ProbeSent(now_ms, 1000); | 44 prober.ProbeSent(now_ms, kProbeSize); |
44 } | 45 } |
45 for (int i = 0; i < 5; ++i) { | 46 // Verify that the actual bitrate is withing 10% of the target. |
46 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); | 47 double bitrate = kProbeSize * (kClusterSize - 1) * 8 * 1000.0 / now_ms; |
47 now_ms += 4; | 48 EXPECT_GT(bitrate, kTestBitrate1 * 0.9); |
| 49 EXPECT_LT(bitrate, kTestBitrate1 * 1.1); |
| 50 |
| 51 now_ms += prober.TimeUntilNextProbe(now_ms); |
| 52 int64_t probe2_started = now_ms; |
| 53 |
| 54 for (int i = 0; i < kClusterSize; ++i) { |
| 55 now_ms += prober.TimeUntilNextProbe(now_ms); |
48 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 56 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
49 EXPECT_EQ(1, prober.CurrentClusterId()); | 57 EXPECT_EQ(1, prober.CurrentClusterId()); |
50 prober.ProbeSent(now_ms, 1000); | 58 prober.ProbeSent(now_ms, kProbeSize); |
51 } | 59 } |
52 | 60 |
| 61 // Verify that the actual bitrate is withing 10% of the target. |
| 62 bitrate = |
| 63 kProbeSize * (kClusterSize - 1) * 8 * 1000.0 / (now_ms - probe2_started); |
| 64 EXPECT_GT(bitrate, kTestBitrate2 * 0.9); |
| 65 EXPECT_LT(bitrate, kTestBitrate2 * 1.1); |
| 66 |
53 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 67 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
54 EXPECT_FALSE(prober.IsProbing()); | 68 EXPECT_FALSE(prober.IsProbing()); |
55 } | 69 } |
56 | 70 |
57 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { | 71 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { |
58 BitrateProber prober; | 72 BitrateProber prober; |
59 EXPECT_FALSE(prober.IsProbing()); | 73 EXPECT_FALSE(prober.IsProbing()); |
60 int64_t now_ms = 0; | 74 int64_t now_ms = 0; |
61 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 75 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
62 | 76 |
(...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
96 TEST(BitrateProberTest, VerifyProbeSizeOnHighBitrate) { | 110 TEST(BitrateProberTest, VerifyProbeSizeOnHighBitrate) { |
97 BitrateProber prober; | 111 BitrateProber prober; |
98 constexpr unsigned kHighBitrateBps = 10000000; // 10 Mbps | 112 constexpr unsigned kHighBitrateBps = 10000000; // 10 Mbps |
99 | 113 |
100 prober.CreateProbeCluster(kHighBitrateBps, 6); | 114 prober.CreateProbeCluster(kHighBitrateBps, 6); |
101 // Probe size should ensure a minimum of 1 ms interval. | 115 // Probe size should ensure a minimum of 1 ms interval. |
102 EXPECT_GT(prober.RecommendedMinProbeSize(), kHighBitrateBps / 8000); | 116 EXPECT_GT(prober.RecommendedMinProbeSize(), kHighBitrateBps / 8000); |
103 } | 117 } |
104 | 118 |
105 } // namespace webrtc | 119 } // namespace webrtc |
OLD | NEW |