Parent: [6ccca6] (diff)

Download this file

REDMonitor.cc    60 lines (47 with data), 1.6 kB

 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
//
// Copyright Š 2014 - 2015 PRISTINE Consortium (http://ict-pristine.eu)
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see http://www.gnu.org/licenses/.
//
#include <REDMonitor.h>
Define_Module(REDMonitor);
void REDMonitor::postQueueCreation(RMTQueue* queue)
{
qAvgLengths[queue] = 0.0;
qCounters[queue] = -1;
qWeights[queue] = par("queueWeight").doubleValue();
}
void REDMonitor::preQueueRemoval(RMTQueue* queue)
{
qAvgLengths.erase(queue);
qWeights.erase(queue);
qCounters.erase(queue);
}
void REDMonitor::onMessageArrival(RMTQueue* queue)
{
int length = queue->getLength();
double avg = qAvgLengths[queue];
double weight = qWeights[queue];
simtime_t qTime = queue->getQTime();
if (length > 0)
{
avg = (1 - weight) * avg + weight * length;
}
else
{
const double m = SIMTIME_DBL(simTime() - qTime);
avg = pow(1 - weight, m) * avg;
}
qAvgLengths[queue] = avg;
}