Mirrors/VILLASnode
1
0
Fork 0
mirror of https://git.rwth-aachen.de/acs/public/villas/node/ synced 2025-03-09 00:00:00 +01:00
Code Issues Releases Wiki Activity

added histogram of delay distribution

Browse source
This commit is contained in:
Steffen Vogel 2015-06-02 22:45:37 +02:00
parent 375a16243e
commit 5cb89c1ac8
2 changed files with 25 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
server/include/path.h
View file

@ -52,8 +52,10 @@ struct path
/** A pointer to the previously received message */
struct msg *previous;
/** Counter for received messages according to their sequence no displacement */
struct hist histogram;
/** Histogram of sequence number displacement of received messages */
struct hist hist_seq;
/** Histogram for delay of received messages */
struct hist hist_delay;
/** Counter for sent messages to all outgoing nodes */
unsigned int sent;

27
server/src/path.c
View file

@ -86,6 +86,9 @@ skip: for(;;) {
/* Receive message */
int recv = node_read(p->in, p->pool, p->poolsize, p->received, p->in->combine);
struct timespec now;
clock_gettime(CLOCK_REALTIME, &now);
debug(10, "Received %u messages from node '%s'", recv, p->in->name);
/* For each received message... */
@ -110,7 +113,8 @@ skip: for(;;) {
if (dist > UINT16_MAX / 2)
dist -= UINT16_MAX;
hist_put(&p->histogram, dist);
/* Update sequence histogram */
hist_put(&p->hist_seq, dist);
/* Handle simulation restart */
if (p->current->sequence == 0 && abs(dist) >= 1) {
@ -125,6 +129,10 @@ skip: for(;;) {
p->dropped++;
goto skip;
}
/* Update delay histogram */
struct timespec sent = MSG_TS(p->current);
hist_put(&p->hist_delay, time_delta(&sent, &now));
}
/* Call hook callbacks */
@ -174,8 +182,12 @@ int path_stop(struct path *p)
close(p->tfd);
}
if (p->received)
hist_print(&p->histogram);
if (p->received) {
info("Delay distribution:");
hist_print(&p->hist_delay);
info("Sequence number displacement:");
hist_print(&p->hist_seq);
}
return 0;
}
@ -188,7 +200,8 @@ int path_reset(struct path *p)
p->skipped = 0;
p->dropped = 0;
hist_reset(&p->histogram);
hist_reset(&p->hist_seq);
hist_reset(&p->hist_delay);
return 0;
}
@ -227,7 +240,8 @@ struct path * path_create()
list_init(&p->destinations, NULL);
list_init(&p->hooks, NULL);
hist_create(&p->histogram, -HIST_SEQ, +HIST_SEQ, 1);
hist_create(&p->hist_seq, -HIST_SEQ, +HIST_SEQ, 1);
hist_create(&p->hist_delay, 0, 2, 100e-3);
return p;
}
@ -236,7 +250,8 @@ void path_destroy(struct path *p)
{
list_destroy(&p->destinations);
list_destroy(&p->hooks);
hist_destroy(&p->histogram);
hist_destroy(&p->hist_seq);
hist_destroy(&p->hist_delay);
free(p->pool);
free(p);