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
|
# Copyright (c) 2016-2017 Intel Corporation
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
""" Fixed traffic profile definitions """
from __future__ import absolute_import
import logging
from yardstick.network_services.traffic_profile.prox_profile import ProxProfile
LOG = logging.getLogger(__name__)
class ProxBinSearchProfile(ProxProfile):
"""
This profile adds a single stream at the beginning of the traffic session
"""
def __init__(self, tp_config):
super(ProxBinSearchProfile, self).__init__(tp_config)
self.current_lower = self.lower_bound
self.current_upper = self.upper_bound
@property
def delta(self):
return self.current_upper - self.current_lower
@property
def mid_point(self):
return (self.current_lower + self.current_upper) / 2
def bounds_iterator(self, logger=None):
self.current_lower = self.lower_bound
self.current_upper = self.upper_bound
test_value = self.current_upper
while abs(self.delta) >= self.precision:
if logger:
logger.debug("New interval [%s, %s), precision: %d", self.current_lower,
self.current_upper, self.step_value)
logger.info("Testing with value %s", test_value)
yield test_value
test_value = self.mid_point
def run_test_with_pkt_size(self, traffic_gen, pkt_size, duration):
"""Run the test for a single packet size.
:param queue: queue object we put samples into
:type queue: Queue
:param traffic_gen: traffic generator instance
:type traffic_gen: TrafficGen
:param pkt_size: The packet size to test with.
:type pkt_size: int
:param duration: The duration for each try.
:type duration: int
"""
LOG.info("Testing with packet size %d", pkt_size)
# Binary search assumes the lower value of the interval is
# successful and the upper value is a failure.
# The first value that is tested, is the maximum value. If that
# succeeds, no more searching is needed. If it fails, a regular
# binary search is performed.
#
# The test_value used for the first iteration of binary search
# is adjusted so that the delta between this test_value and the
# upper bound is a power-of-2 multiple of precision. In the
# optimistic situation where this first test_value results in a
# success, the binary search will complete on an integer multiple
# of the precision, rather than on a fraction of it.
# throughput and packet loss from the most recent successful test
successful_pkt_loss = 0.0
for test_value in self.bounds_iterator(LOG):
result = traffic_gen.resource_helper.run_test(pkt_size, duration,
test_value, self.tolerated_loss)
if result.success:
LOG.debug("Success! Increasing lower bound")
self.current_lower = test_value
successful_pkt_loss = result.pkt_loss
else:
LOG.debug("Failure... Decreasing upper bound")
self.current_upper = test_value
samples = result.get_samples(pkt_size, successful_pkt_loss)
self.queue.put(samples)
|