| 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 prober.CreateProbeCluster(900000); |
| 25 prober.CreateProbeCluster(1800000, 5); | 25 prober.CreateProbeCluster(1800000); |
| 26 EXPECT_FALSE(prober.IsProbing()); | 26 EXPECT_FALSE(prober.IsProbing()); |
| 27 | 27 |
| 28 prober.OnIncomingPacket(1000); | 28 prober.OnIncomingPacket(1000); |
| 29 EXPECT_TRUE(prober.IsProbing()); | 29 EXPECT_TRUE(prober.IsProbing()); |
| 30 EXPECT_EQ(0, prober.CurrentClusterId()); | 30 EXPECT_EQ(0, prober.CurrentClusterId()); |
| 31 | 31 |
| 32 // First packet should probe as soon as possible. | 32 // First packet should probe as soon as possible. |
| 33 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 33 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 34 prober.ProbeSent(now_ms, 1000); | 34 prober.ProbeSent(now_ms, 1000); |
| 35 | 35 |
| 36 for (int i = 0; i < 5; ++i) { | 36 for (int i = 0; i < 4; ++i) { |
| 37 EXPECT_EQ(8, prober.TimeUntilNextProbe(now_ms)); | 37 EXPECT_EQ(8, prober.TimeUntilNextProbe(now_ms)); |
| 38 now_ms += 4; | 38 now_ms += 4; |
| 39 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); | 39 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); |
| 40 now_ms += 4; | 40 now_ms += 4; |
| 41 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 41 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 42 EXPECT_EQ(0, prober.CurrentClusterId()); | 42 EXPECT_EQ(0, prober.CurrentClusterId()); |
| 43 prober.ProbeSent(now_ms, 1000); | 43 prober.ProbeSent(now_ms, 1000); |
| 44 } | 44 } |
| 45 for (int i = 0; i < 5; ++i) { | 45 for (int i = 0; i < 5; ++i) { |
| 46 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); | 46 EXPECT_EQ(4, prober.TimeUntilNextProbe(now_ms)); |
| 47 now_ms += 4; | 47 now_ms += 4; |
| 48 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 48 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 49 EXPECT_EQ(1, prober.CurrentClusterId()); | 49 EXPECT_EQ(1, prober.CurrentClusterId()); |
| 50 prober.ProbeSent(now_ms, 1000); | 50 prober.ProbeSent(now_ms, 1000); |
| 51 } | 51 } |
| 52 | 52 |
| 53 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 53 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 54 EXPECT_FALSE(prober.IsProbing()); | 54 EXPECT_FALSE(prober.IsProbing()); |
| 55 } | 55 } |
| 56 | 56 |
| 57 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { | 57 TEST(BitrateProberTest, DoesntProbeWithoutRecentPackets) { |
| 58 BitrateProber prober; | 58 BitrateProber prober; |
| 59 EXPECT_FALSE(prober.IsProbing()); | 59 EXPECT_FALSE(prober.IsProbing()); |
| 60 int64_t now_ms = 0; | 60 int64_t now_ms = 0; |
| 61 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 61 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 62 | 62 |
| 63 prober.CreateProbeCluster(900000, 6); | 63 prober.CreateProbeCluster(900000); |
| 64 EXPECT_FALSE(prober.IsProbing()); | 64 EXPECT_FALSE(prober.IsProbing()); |
| 65 | 65 |
| 66 prober.OnIncomingPacket(1000); | 66 prober.OnIncomingPacket(1000); |
| 67 EXPECT_TRUE(prober.IsProbing()); | 67 EXPECT_TRUE(prober.IsProbing()); |
| 68 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); | 68 EXPECT_EQ(0, prober.TimeUntilNextProbe(now_ms)); |
| 69 prober.ProbeSent(now_ms, 1000); | 69 prober.ProbeSent(now_ms, 1000); |
| 70 // Let time pass, no large enough packets put into prober. | 70 // Let time pass, no large enough packets put into prober. |
| 71 now_ms += 6000; | 71 now_ms += 6000; |
| 72 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); | 72 EXPECT_EQ(-1, prober.TimeUntilNextProbe(now_ms)); |
| 73 // Insert a small packet, not a candidate for probing. | 73 // Insert a small packet, not a candidate for probing. |
| (...skipping 16 matching lines...) Expand all Loading... |
| 90 EXPECT_FALSE(prober.IsProbing()); | 90 EXPECT_FALSE(prober.IsProbing()); |
| 91 | 91 |
| 92 prober.OnIncomingPacket(100); | 92 prober.OnIncomingPacket(100); |
| 93 EXPECT_FALSE(prober.IsProbing()); | 93 EXPECT_FALSE(prober.IsProbing()); |
| 94 } | 94 } |
| 95 | 95 |
| 96 TEST(BitrateProberTest, VerifyProbeSizeOnHighBitrate) { | 96 TEST(BitrateProberTest, VerifyProbeSizeOnHighBitrate) { |
| 97 BitrateProber prober; | 97 BitrateProber prober; |
| 98 constexpr unsigned kHighBitrateBps = 10000000; // 10 Mbps | 98 constexpr unsigned kHighBitrateBps = 10000000; // 10 Mbps |
| 99 | 99 |
| 100 prober.CreateProbeCluster(kHighBitrateBps, 6); | 100 prober.CreateProbeCluster(kHighBitrateBps); |
| 101 // Probe size should ensure a minimum of 1 ms interval. | 101 // Probe size should ensure a minimum of 1 ms interval. |
| 102 EXPECT_GT(prober.RecommendedMinProbeSize(), kHighBitrateBps / 8000); | 102 EXPECT_GT(prober.RecommendedMinProbeSize(), kHighBitrateBps / 8000); |
| 103 } | 103 } |
| 104 | 104 |
| 105 TEST(BitrateProberTest, MinumumNumberOfProbingPackets) { |
| 106 BitrateProber prober; |
| 107 // Even when probing at a low bitrate we expect a minimum number |
| 108 // of packets to be sent. |
| 109 constexpr int kBitrateBps = 100000; // 100 kbps |
| 110 constexpr int kPacketSizeBytes = 1000; |
| 111 |
| 112 prober.CreateProbeCluster(kBitrateBps); |
| 113 prober.OnIncomingPacket(kPacketSizeBytes); |
| 114 for (int i = 0; i < 5; ++i) { |
| 115 EXPECT_TRUE(prober.IsProbing()); |
| 116 prober.ProbeSent(0, kPacketSizeBytes); |
| 117 } |
| 118 |
| 119 EXPECT_FALSE(prober.IsProbing()); |
| 120 } |
| 121 |
| 122 TEST(BitrateProberTest, ScaleBytesUsedForProbing) { |
| 123 BitrateProber prober; |
| 124 constexpr int kBitrateBps = 10000000; // 10 Mbps |
| 125 constexpr int kPacketSizeBytes = 1000; |
| 126 constexpr int kExpectedBytesSent = kBitrateBps * 15 / 8000; |
| 127 |
| 128 prober.CreateProbeCluster(kBitrateBps); |
| 129 prober.OnIncomingPacket(kPacketSizeBytes); |
| 130 int bytes_sent = 0; |
| 131 while (bytes_sent < kExpectedBytesSent) { |
| 132 EXPECT_TRUE(prober.IsProbing()); |
| 133 prober.ProbeSent(0, kPacketSizeBytes); |
| 134 bytes_sent += kPacketSizeBytes; |
| 135 } |
| 136 |
| 137 EXPECT_FALSE(prober.IsProbing()); |
| 138 } |
| 139 |
| 105 } // namespace webrtc | 140 } // namespace webrtc |
| OLD | NEW |