2 * Copyright (c) 2010, 2012, 2013 Nicira, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include "multipath.h"
28 #include "ofp-actions.h"
32 main(int argc, char *argv[])
34 enum { MP_MAX_LINKS = 63 };
35 struct ofpact_multipath mp;
40 set_program_name(argv[0]);
43 ovs_fatal(0, "usage: %s multipath_action", program_name);
46 error = multipath_parse(&mp, argv[1]);
48 ovs_fatal(0, "%s", error);
51 for (n = 1; n <= MP_MAX_LINKS; n++) {
52 enum { N_FLOWS = 65536 };
53 double disruption, perfect, distribution;
54 int histogram[MP_MAX_LINKS];
55 double sum_dev2, stddev;
60 memset(histogram, 0, sizeof histogram);
61 for (i = 0; i < N_FLOWS; i++) {
62 int old_link, new_link;
63 struct flow_wildcards wc;
66 flow_random_hash_fields(&flow);
69 multipath_execute(&mp, &flow, &wc);
70 old_link = flow.regs[0];
73 multipath_execute(&mp, &flow, &wc);
74 new_link = flow.regs[0];
76 assert(old_link >= 0 && old_link < n);
77 assert(new_link >= 0 && new_link < n + 1);
79 histogram[old_link]++;
80 changed += old_link != new_link;
84 for (i = 0; i < n; i++) {
85 double mean = (double) N_FLOWS / n;
86 double deviation = histogram[i] - mean;
88 sum_dev2 += deviation * deviation;
90 stddev = sqrt(sum_dev2 / n);
92 disruption = (double) changed / N_FLOWS;
93 perfect = 1.0 / (n + 1);
94 distribution = stddev / ((double) N_FLOWS / n);
95 printf("%2d -> %2d: disruption=%.2f (perfect=%.2f); "
96 "stddev/expected=%.4f\n",
97 n, n + 1, disruption, perfect, distribution);
99 switch (mp.algorithm) {
100 case NX_MP_ALG_MODULO_N:
101 if (disruption < (n < 2 ? .25 : .5)) {
102 fprintf(stderr, "%d -> %d: disruption=%.2f < .5\n",
103 n, n + 1, disruption);
108 case NX_MP_ALG_HASH_THRESHOLD:
109 if (disruption < .48 || disruption > .52) {
110 fprintf(stderr, "%d -> %d: disruption=%.2f not approximately "
111 ".5\n", n, n + 1, disruption);
116 case NX_MP_ALG_ITER_HASH:
117 if (!(n & (n - 1))) {
122 if (fabs(disruption - perfect) >= .01) {
123 fprintf(stderr, "%d -> %d: disruption=%.5f differs from "
124 "perfect=%.5f by more than .01\n",
125 n, n + 1, disruption, perfect);