2 This file is part of GNUnet.
3 (C) 2011 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
22 * @file ats/gnunet-service-ats-solver_mlp.c
23 * @brief ats mlp problem solver
24 * @author Matthias Wachs
25 * @author Christian Grothoff
28 #include "gnunet_util_lib.h"
29 #include "gnunet-service-ats-solver_mlp.h"
30 #include "gnunet_statistics_service.h"
35 * NOTE: Do not modify this documentation. This documentation is based on
36 * gnunet.org:/vcs/fsnsg/ats-paper.git/tech-doku/ats-tech-guide.tex
37 * use build_txt.sh to generate plaintext output
39 * The MLP solver (mlp) tries to finds an optimal bandwidth assignmentby
40 * optimizing an mixed integer programming problem. The MLP solver uses a
41 * number of constraints to find the best adddress for a peer and an optimal
42 * bandwidth assignment. mlp uses the GNU Linear Programming Kit to solve the
45 * We defined a constraint system to find an optimal bandwidth assignment.
46 * This constraint system uses as an input data addresses, bandwidth quotas,
47 * preferences and quality values. This constraint system is stored in an
48 * matrix based equotation system.
52 * A (M)LP problem consists of a target function to optimizes, constraints
53 * and rows and columns. FIXME GLP uses three arrays to index the matrix: two
54 * integer arrays storing the row and column indices in the matrix and an
55 * float array to store the coeeficient.
57 * To solve the problem we first find an initial solution for the LP problem
58 * using the LP solver and then find an MLP solution based on this solution
59 * using the MLP solver.
61 * Solving (M)LP problems has the property that finding an initial solution
62 * for the LP problem is computationally expensive and finding the MLP
63 * solution is cheaper. This is especially interesting an existing LP
64 * solution can be reused if only coefficients in the matrix have changed
65 * (addresses updated). Only when the problem size changes (addresses added
66 * or deleted) a new LP solution has to be found.
69 * The mlp solver solves the bandwidth assignment problem only on demand when
70 * an address suggestion is requested. When an address is requested mlp the
71 * solves the mlp problem and if the active address or the bandwidth assigned
72 * changes it calls the callback to addresses. The mlp solver gets notified
73 * about new addresses (adding sessions), removed addresses (address
74 * deletions) and address updates. To benefit from the mlp properties
75 * mentioned in section 5 the solver rembers if since the last solution
76 * addresses were added or deleted (problem size changed, problem has to be
77 * rebuild and solved from sratch) or if addresses were updated and the
78 * existing solution can be reused.
82 * The quotas for each network segment are passed by addresses. MLP can be
83 * adapted using configuration settings and uses the following parameters:
85 * Maximum duration for a MLP solution procees (default: 3 sec.)
87 * Maximum number of iterations for a MLP solution process (default:
89 * * MLP_MIN_CONNECTIONS:
90 * Minimum number of desired connections (default: 4)
91 * * MLP_MIN_BANDWIDTH:
92 * Minimum amount of bandwidth assigned to an address (default: 1024)
93 * * MLP_COEFFICIENT_D:
94 * Diversity coefficient (default: 1.0)
95 * * MLP_COEFFICIENT_R:
96 * Relativity coefficient (default: 1.0)
97 * * MLP_COEFFICIENT_U:
98 * Utilization coefficient (default: 1.0)
99 * * MLP_COEFFICIENT_D:
100 * Diversity coefficient (default: 1.0)
101 * * MLP_COEFFICIENT_QUALITY_DELAY:
102 * Quality delay coefficient (default: 1.0)
103 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
104 * Quality distance coefficient (default: 1.0)
105 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
106 * Quality distance coefficient (default: 1.0)
107 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
108 * Quality distance coefficient (default: 1.0)
109 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
110 * Quality distance coefficient (default: 1.0)
112 * 5.2 Data structures used
114 * mlp has for each known peer a struct ATS_Peer containing information about
115 * a specific peer. The address field solver_information contains information
116 * about the mlp properties of this address.
120 * During initialization mlp initializes the GLPK libray used to solve the
121 * MLP problem: it initializes the glpk environment and creates an initial LP
122 * problem. Next it loads the configuration values from the configuration or
123 * uses the default values configured in -addresses_mlp.h. The quotas used
124 * are given by addresses but may have to be adjusted. mlp uses a upper limit
125 * for the bandwidth assigned called BIG M and a minimum amount of bandwidth
126 * an address gets assigned as well as a minium desired number of
127 * connections. If the configured quota is bigger than BIG M, it is reduced
128 * to BIG M. If the configured quota is smaller than MLP_MIN_CONNECTIONS
129 * *MLP_MIN_BANDWIDTH it is increased to this value.
135 #define LOG(kind,...) GNUNET_log_from (kind, "ats-mlp",__VA_ARGS__)
138 * Print debug output for mlp problem creation
140 #define DEBUG_MLP_PROBLEM_CREATION GNUNET_NO
143 * Enable GLPK verbose output
145 #define VERBOSE_GLPK GNUNET_NO
148 * Maximize bandwidth assigned
150 * This option can be used to test if problem can be solved at all without
151 * optimizing for utility, diversity or relativity
154 #define MAXIMIZE_FOR_BANDWIDTH_ASSIGNED GNUNET_NO
157 * Intercept GLPK terminal output
158 * @param info the mlp handle
159 * @param s the string to print
160 * @return 0: glpk prints output on terminal, 0 != surpress output
163 mlp_term_hook (void *info, const char *s)
165 /* Not needed atm struct MLP_information *mlp = info; */
166 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s", s);
172 * Reset peers for next problem creation
174 * @param cls not used
176 * @param value ATS_Peer
180 reset_peers (void *cls, const struct GNUNET_HashCode * key, void *value)
182 struct ATS_Peer *peer = value;
183 peer->processed = GNUNET_NO;
188 * Delete the MLP problem and free the constrain matrix
190 * @param mlp the MLP handle
193 mlp_delete_problem (struct GAS_MLP_Handle *mlp)
198 if (mlp->p.prob != NULL)
200 glp_delete_prob(mlp->p.prob);
204 /* delete row index */
205 if (mlp->p.ia != NULL)
207 GNUNET_free (mlp->p.ia);
211 /* delete column index */
212 if (mlp->p.ja != NULL)
214 GNUNET_free (mlp->p.ja);
218 /* delete coefficients */
219 if (mlp->p.ar != NULL)
221 GNUNET_free (mlp->p.ar);
227 mlp->p.c_d = MLP_UNDEFINED;
228 mlp->p.c_r = MLP_UNDEFINED;
229 mlp->p.r_c2 = MLP_UNDEFINED;
230 mlp->p.r_c4 = MLP_UNDEFINED;
231 mlp->p.r_c6 = MLP_UNDEFINED;
232 mlp->p.r_c9 = MLP_UNDEFINED;
233 for (c = 0; c < mlp->pv.m_q ; c ++)
234 mlp->p.r_q[c] = MLP_UNDEFINED;
235 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c ++)
236 mlp->p.r_quota[c] = MLP_UNDEFINED;
237 mlp->p.ci = MLP_UNDEFINED;
240 GNUNET_CONTAINER_multihashmap_iterate (mlp->requested_peers, &reset_peers, NULL);
245 * Translate ATS properties to text
246 * Just intended for debugging
248 * @param ats_index the ATS index
249 * @return string with result
252 mlp_ats_to_string (int ats_index)
255 case GNUNET_ATS_ARRAY_TERMINATOR:
256 return "GNUNET_ATS_ARRAY_TERMINATOR";
257 case GNUNET_ATS_UTILIZATION_UP:
258 return "GNUNET_ATS_UTILIZATION_UP";
259 case GNUNET_ATS_UTILIZATION_DOWN:
260 return "GNUNET_ATS_UTILIZATION_DOWN";
261 case GNUNET_ATS_COST_LAN:
262 return "GNUNET_ATS_COST_LAN";
263 case GNUNET_ATS_COST_WAN:
264 return "GNUNET_ATS_COST_LAN";
265 case GNUNET_ATS_COST_WLAN:
266 return "GNUNET_ATS_COST_WLAN";
267 case GNUNET_ATS_NETWORK_TYPE:
268 return "GNUNET_ATS_NETWORK_TYPE";
269 case GNUNET_ATS_QUALITY_NET_DELAY:
270 return "GNUNET_ATS_QUALITY_NET_DELAY";
271 case GNUNET_ATS_QUALITY_NET_DISTANCE:
272 return "GNUNET_ATS_QUALITY_NET_DISTANCE";
280 * Translate glpk status error codes to text
281 * @param retcode return code
282 * @return string with result
285 mlp_status_to_string (int retcode)
289 return "solution is undefined";
291 return "solution is feasible";
293 return "solution is infeasible";
295 return "no feasible solution exists";
297 return "solution is optimal";
299 return "solution is unbounded";
302 return "unknown error";
307 * Translate glpk solver error codes to text
308 * @param retcode return code
309 * @return string with result
312 mlp_solve_to_string (int retcode)
318 return "invalid basis";
320 return "singular matrix";
322 return "ill-conditioned matrix";
324 return "invalid bounds";
326 return "solver failed";
328 return "objective lower limit reached";
330 return "objective upper limit reached";
332 return "iteration limit exceeded";
334 return "time limit exceeded";
336 return "no primal feasible solution";
338 return "no dual feasible solution";
340 return "root LP optimum not provided";
342 return "search terminated by application";
344 return "relative mip gap tolerance reached";
346 return "no dual feasible solution";
348 return "no convergence";
350 return "numerical instability";
352 return "invalid data";
354 return "result out of range";
357 return "unknown error";
362 * Extract an ATS performance info from an address
364 * @param address the address
365 * @param type the type to extract in HBO
366 * @return the value in HBO or GNUNET_ATS_VALUE_UNDEFINED in HBO if value does not exist
369 get_performance_info (struct ATS_Address *address, uint32_t type)
372 GNUNET_assert (NULL != address);
374 if ((NULL == address->atsi) || (0 == address->atsi_count))
375 return GNUNET_ATS_VALUE_UNDEFINED;
377 for (c1 = 0; c1 < address->atsi_count; c1++)
379 if (ntohl(address->atsi[c1].type) == type)
380 return ntohl(address->atsi[c1].value);
382 return GNUNET_ATS_VALUE_UNDEFINED;
388 struct GNUNET_CONTAINER_MultiHashMap * peers;
393 mlp_create_problem_count_addresses_it (void *cls, const struct GNUNET_HashCode *key, void *value)
395 struct CountContext *cctx = cls;
396 /* Check if we have to add this peer due to a pending request */
397 if (GNUNET_YES == GNUNET_CONTAINER_multihashmap_contains(cctx->peers, key))
402 static int mlp_create_problem_count_addresses (
403 struct GNUNET_CONTAINER_MultiHashMap * peers,
404 const struct GNUNET_CONTAINER_MultiHashMap * addresses)
406 struct CountContext cctx;
409 GNUNET_CONTAINER_multihashmap_iterate (addresses, &mlp_create_problem_count_addresses_it, &cctx);
415 * Updates an existing value in the matrix
417 * Extract the row, updates the value and updates the row in the problem
419 * @param p the mlp problem
420 * @param row the row to create the value in
421 * @param col the column to create the value in
422 * @param val the value to set
423 * @param line calling line for debbuging
424 * @return GNUNET_YES value changed, GNUNET_NO value did not change, GNUNET_SYSERR
428 mlp_create_problem_update_value (struct MLP_Problem *p,
429 int row, int col, double val,
440 GNUNET_assert (NULL != p);
441 GNUNET_assert (NULL != p->prob);
443 /* Get number of columns and prepare data structure */
444 c_cols = glp_get_num_cols(p->prob);
446 return GNUNET_SYSERR;
448 val_array = GNUNET_malloc ((c_cols +1)* sizeof (double));
449 GNUNET_assert (NULL != val_array);
450 ind_array = GNUNET_malloc ((c_cols+1) * sizeof (int));
451 GNUNET_assert (NULL != ind_array);
452 /* Extract the row */
454 /* Update the value */
455 c_elems = glp_get_mat_row (p->prob, row, ind_array, val_array);
457 for (c1 = 1; c1 < (c_elems+1); c1++)
459 if (ind_array[c1] == col)
465 if (GNUNET_NO == found)
467 ind_array[c_elems+1] = col;
468 val_array[c_elems+1] = val;
469 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Setting value in [%s : %s] to `%.2f'\n",
470 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
472 glp_set_mat_row (p->prob, row, c_elems+1, ind_array, val_array);
473 GNUNET_free (ind_array);
474 GNUNET_free (val_array);
480 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Updating value in [%s : %s] from `%.2f' to `%.2f'\n",
481 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
483 if (val != val_array[c1])
488 /* Update the row in the matrix */
489 glp_set_mat_row (p->prob, row, c_elems, ind_array, val_array);
492 GNUNET_free (ind_array);
493 GNUNET_free (val_array);
498 * Creates a new value in the matrix
500 * Sets the row and column index in the problem array and increments the
503 * @param p the mlp problem
504 * @param row the row to create the value in
505 * @param col the column to create the value in
506 * @param val the value to set
507 * @param line calling line for debbuging
510 mlp_create_problem_set_value (struct MLP_Problem *p,
511 int row, int col, double val,
514 if ((p->ci) >= p->num_elements)
516 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Request for index %u bigger than array size of %u\n",
517 line, p->ci + 1, p->num_elements);
521 if ((0 == row) || (0 == col))
526 #if DEBUG_MLP_PROBLEM_CREATION
527 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Set value [%u,%u] in index %u == %.2f\n",
528 line, p->ia[p->ci], p->ja[p->ci], p->ci, p->ar[p->ci]);
534 mlp_create_problem_create_column (struct MLP_Problem *p, char *name,
535 unsigned int type, unsigned int bound, double lb, double ub,
538 int col = glp_add_cols (p->prob, 1);
539 glp_set_col_name (p->prob, col, name);
540 glp_set_col_bnds (p->prob, col, bound, lb, ub);
541 glp_set_col_kind (p->prob, col, type);
542 glp_set_obj_coef (p->prob, col, coef);
543 #if DEBUG_MLP_PROBLEM_CREATION
544 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added column [%u] `%s': %.2f\n",
551 mlp_create_problem_create_constraint (struct MLP_Problem *p, char *name,
552 unsigned int bound, double lb, double ub)
555 int row = glp_add_rows (p->prob, 1);
557 glp_set_row_name (p->prob, row, name);
558 /* set row bounds: <= 0 */
559 glp_set_row_bnds (p->prob, row, bound, lb, ub);
562 GNUNET_asprintf(&op, "-inf <= x <= %.2f", ub);
565 GNUNET_asprintf(&op, "%.2f <= x <= %.2f", lb, ub);
568 GNUNET_asprintf(&op, "%.2f == x == %.2f", lb, ub);
571 GNUNET_asprintf(&op, "%.2f <= x <= inf", lb);
574 GNUNET_asprintf(&op, "ERROR");
577 #if DEBUG_MLP_PROBLEM_CREATION
578 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added row [%u] `%s': %s\n",
587 * - address columns b and n
588 * - address dependent constraint rows c1, c3
589 * - peer dependent rows c2 and c9
590 * - Set address dependent entries in problem matrix as well
593 mlp_create_problem_add_address_information (void *cls, const struct GNUNET_HashCode *key, void *value)
595 struct GAS_MLP_Handle *mlp = cls;
596 struct MLP_Problem *p = &mlp->p;
597 struct ATS_Address *address = value;
598 struct ATS_Peer *peer;
599 struct MLP_information *mlpi;
605 /* Check if we have to add this peer due to a pending request */
606 if (GNUNET_NO == GNUNET_CONTAINER_multihashmap_contains(mlp->requested_peers, key))
609 mlpi = address->solver_information;
612 fprintf (stderr, "%s %p\n",GNUNET_i2s (&address->peer), address);
618 peer = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, key);
619 if (peer->processed == GNUNET_NO)
621 /* Add peer dependent constraints */
622 /* Add constraint c2 */
623 GNUNET_asprintf(&name, "c2_%s", GNUNET_i2s(&address->peer));
624 peer->r_c2 = mlp_create_problem_create_constraint (p, name, GLP_FX, 1.0, 1.0);
626 /* Add constraint c9 */
627 GNUNET_asprintf(&name, "c9_%s", GNUNET_i2s(&address->peer));
628 peer->r_c9 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
630 /* c 9) set coefficient */
631 mlp_create_problem_set_value (p, peer->r_c9, p->c_r, -peer->f, __LINE__);
632 peer->processed = GNUNET_YES;
635 /* Reset addresses' solver information */
642 /* Add bandwidth column */
643 GNUNET_asprintf (&name, "b_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
644 #if TEST_MAX_BW_ASSIGNMENT
645 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 1.0);
647 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 0.0);
652 /* Add usage column */
653 GNUNET_asprintf (&name, "n_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
654 mlpi->c_n = mlp_create_problem_create_column (p, name, GLP_IV, GLP_DB, 0.0, 1.0, 0.0);
657 /* Add address dependent constraints */
658 /* Add constraint c1) bandwidth capping
659 * b_t + (-M) * n_t <= 0
661 GNUNET_asprintf(&name, "c1_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
662 mlpi->r_c1 = mlp_create_problem_create_constraint (p, name, GLP_UP, 0.0, 0.0);
665 /* c1) set b = 1 coefficient */
666 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_b, 1, __LINE__);
667 /* c1) set n = -M coefficient */
668 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_n, -mlp->pv.BIG_M, __LINE__);
670 /* Add constraint c 3) minimum bandwidth
671 * b_t + (-n_t * b_min) >= 0
673 GNUNET_asprintf(&name, "c3_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
674 mlpi->r_c3 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
677 /* c3) set b = 1 coefficient */
678 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_b, 1, __LINE__);
679 /* c3) set n = -b_min coefficient */
680 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_n, - ((double )mlp->pv.b_min), __LINE__);
683 /* Set coefficient entries in invariant rows */
684 /* c 4) minimum connections */
685 mlp_create_problem_set_value (p, p->r_c4, mlpi->c_n, 1, __LINE__);
686 /* c 6) maximize diversity */
687 mlp_create_problem_set_value (p, p->r_c6, mlpi->c_n, 1, __LINE__);
688 /* c 2) 1 address peer peer */
689 mlp_create_problem_set_value (p, peer->r_c2, mlpi->c_n, 1, __LINE__);
690 /* c 9) relativity */
691 mlp_create_problem_set_value (p, peer->r_c9, mlpi->c_b, 1, __LINE__);
693 mlp_create_problem_set_value (p, p->r_c8, mlpi->c_b, 1, __LINE__);
695 /* c 10) obey network specific quotas
696 * (1)*b_1 + ... + (1)*b_m <= quota_n
698 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
700 addr_net = get_performance_info (address, GNUNET_ATS_NETWORK_TYPE);
701 if (GNUNET_ATS_VALUE_UNDEFINED == addr_net)
702 addr_net = GNUNET_ATS_NET_UNSPECIFIED;
704 if (mlp->pv.quota_index[c] == addr_net)
706 mlp_create_problem_set_value (p, p->r_quota[c], mlpi->c_b, 1, __LINE__);
711 /* c 7) Optimize quality */
712 /* For all quality metrics, set quality of this address */
713 props = mlp->get_properties (mlp->get_properties_cls, address);
714 for (c = 0; c < mlp->pv.m_q; c++)
715 mlp_create_problem_set_value (p, p->r_q[c], mlpi->c_b, props[c], __LINE__);
721 * Create the invariant columns c4, c6, c10, c8, c7
724 mlp_create_problem_add_invariant_rows (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
729 /* Row for c4) minimum connection */
730 /* Number of minimum connections is min(|Peers|, n_min) */
731 p->r_c4 = mlp_create_problem_create_constraint (p, "c4", GLP_LO, (mlp->pv.n_min > p->num_peers) ? p->num_peers : mlp->pv.n_min, 0.0);
733 /* Add row for c6) */
734 p->r_c6 = mlp_create_problem_create_constraint (p, "c6", GLP_FX, 0.0, 0.0);
736 mlp_create_problem_set_value (p, p->r_c6, p->c_d, -1, __LINE__);
738 /* Add rows for c 10) */
739 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
742 GNUNET_asprintf(&text, "c10_quota_ats_%s", GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]));
743 p->r_quota[c] = mlp_create_problem_create_constraint (p, text, GLP_DB, 0.0, mlp->pv.quota_out[c]);
747 /* Adding rows for c 8) */
748 p->r_c8 = mlp_create_problem_create_constraint (p, "c8", GLP_FX, 0.0, 0.0);
750 mlp_create_problem_set_value (p, p->r_c8, p->c_u, -1, __LINE__);
752 /* c 7) For all quality metrics */
753 for (c = 0; c < mlp->pv.m_q; c++)
755 GNUNET_asprintf(&name, "c7_q%i_%s", c, mlp_ats_to_string(mlp->pv.q[c]));
756 p->r_q[c] = mlp_create_problem_create_constraint (p, name, GLP_FX, 0.0, 0.0);
758 mlp_create_problem_set_value (p, p->r_q[c], p->c_q[c], -1, __LINE__);
764 * Create the invariant columns d, u, r, q0 ... qm
767 mlp_create_problem_add_invariant_columns (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
772 #if TEST_MAX_BW_ASSIGNMENT
777 //mlp->pv.co_R = 0.0;
779 /* Diversity d column */
780 p->c_d = mlp_create_problem_create_column (p, "d", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_D);
782 /* Utilization u column */
783 p->c_u = mlp_create_problem_create_column (p, "u", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_U);
785 /* Relativity r column */
786 p->c_r = mlp_create_problem_create_column (p, "r", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_R);
788 /* Quality metric columns */
789 for (c = 0; c < mlp->pv.m_q; c++)
791 GNUNET_asprintf (&name, "q_%u", mlp->pv.q[c]);
792 #if TEST_MAX_BW_ASSIGNMENT
793 p->c_q[c] = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 0.0);
795 p->c_q[c] = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_Q[c]);
803 * Create the MLP problem
805 * @param mlp the MLP handle
806 * @return GNUNET_OK or GNUNET_SYSERR
809 mlp_create_problem (struct GAS_MLP_Handle *mlp)
811 struct MLP_Problem *p = &mlp->p;
814 GNUNET_assert (p->prob == NULL);
815 GNUNET_assert (p->ia == NULL);
816 GNUNET_assert (p->ja == NULL);
817 GNUNET_assert (p->ar == NULL);
818 /* Reset MLP problem struct */
820 /* create the glpk problem */
821 p->prob = glp_create_prob ();
822 GNUNET_assert (NULL != p->prob);
823 p->num_peers = GNUNET_CONTAINER_multihashmap_size (mlp->requested_peers);
824 p->num_addresses = mlp_create_problem_count_addresses (mlp->requested_peers, mlp->addresses);
826 /* Create problem matrix: 10 * #addresses + #q * #addresses + #q, + #peer + 2 + 1 */
827 p->num_elements = (10 * p->num_addresses + mlp->pv.m_q * p->num_addresses + mlp->pv.m_q + p->num_peers + 2 + 1);
828 LOG (GNUNET_ERROR_TYPE_DEBUG, "Rebuilding problem for %u peer(s) and %u addresse(s) and %u quality metrics == %u elements\n",
829 p->num_peers, p->num_addresses, mlp->pv.m_q, p->num_elements);
831 /* Set a problem name */
832 glp_set_prob_name (p->prob, "GNUnet ATS bandwidth distribution");
833 /* Set optimization direction to maximize */
834 glp_set_obj_dir (p->prob, GLP_MAX);
836 /* Create problem matrix */
837 /* last +1 caused by glpk index starting with one: [1..elements]*/
840 p->ia = GNUNET_malloc (p->num_elements * sizeof (int));
842 p->ja = GNUNET_malloc (p->num_elements * sizeof (int));
844 p->ar = GNUNET_malloc (p->num_elements * sizeof (double));
846 if ((NULL == p->ia) || (NULL == p->ja) || (NULL == p->ar))
848 LOG (GNUNET_ERROR_TYPE_ERROR, _("Problem size too large, cannot allocate memory!\n"));
849 return GNUNET_SYSERR;
852 /* Adding invariant columns */
853 mlp_create_problem_add_invariant_columns (mlp, p);
855 /* Adding address independent constraint rows */
856 mlp_create_problem_add_invariant_rows (mlp, p);
858 /* Adding address dependent columns constraint rows */
859 GNUNET_CONTAINER_multihashmap_iterate (mlp->addresses, &mlp_create_problem_add_address_information, mlp);
861 /* Load the matrix */
862 LOG (GNUNET_ERROR_TYPE_DEBUG, "Loading matrix\n");
863 glp_load_matrix(p->prob, (p->ci)-1, p->ia, p->ja, p->ar);
869 * Solves the LP problem
871 * @param mlp the MLP Handle
872 * @return GNUNET_OK if could be solved, GNUNET_SYSERR on failure
875 mlp_solve_lp_problem (struct GAS_MLP_Handle *mlp)
879 res = glp_simplex(mlp->p.prob, &mlp->control_param_lp);
881 LOG (GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem: 0x%02X %s\n", res, mlp_solve_to_string(res));
883 LOG (GNUNET_ERROR_TYPE_WARNING, "Solving LP problem failed: 0x%02X %s\n", res, mlp_solve_to_string(res));
885 /* Analyze problem status */
886 res = glp_get_status (mlp->p.prob);
888 /* solution is optimal */
890 /* solution is feasible */
892 LOG (GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem: 0x%02X %s\n",
893 res, mlp_status_to_string(res));
895 /* Problem was ill-defined, no way to handle that */
897 LOG (GNUNET_ERROR_TYPE_WARNING, "Solving LP problem failed, no solution: 0x%02X %s\n",
898 res, mlp_status_to_string(res));
899 return GNUNET_SYSERR;
905 * Solves the MLP problem
907 * @param mlp the MLP Handle
908 * @return GNUNET_OK if could be solved, GNUNET_SYSERR on failure
911 mlp_solve_mlp_problem (struct GAS_MLP_Handle *mlp)
914 res = glp_intopt(mlp->p.prob, &mlp->control_param_mlp);
916 LOG (GNUNET_ERROR_TYPE_DEBUG, "Solving MLP problem: 0x%02X %s\n", res, mlp_solve_to_string(res));
918 LOG (GNUNET_ERROR_TYPE_WARNING, "Solving MLP problem failed: 0x%02X %s\n", res, mlp_solve_to_string(res));
919 /* Analyze problem status */
920 res = glp_mip_status(mlp->p.prob);
922 /* solution is optimal */
924 /* solution is feasible */
926 LOG (GNUNET_ERROR_TYPE_DEBUG, "Solving MLP problem: 0x%02X %s\n", res, mlp_status_to_string(res));
928 /* Problem was ill-defined, no way to handle that */
930 LOG (GNUNET_ERROR_TYPE_WARNING,"Solving MLP problem failed, 0x%02X %s\n\n", res, mlp_status_to_string(res));
931 return GNUNET_SYSERR;
937 * Propagates the results when MLP problem was solved
939 * @param cls the MLP handle
940 * @param key the peer identity
941 * @param value the address
942 * @return GNUNET_OK to continue
945 mlp_propagate_results (void *cls, const struct GNUNET_HashCode *key, void *value)
947 struct GAS_MLP_Handle *mlp = cls;
948 struct ATS_Address *address;
949 struct MLP_information *mlpi;
950 double mlp_bw_in = MLP_NaN;
951 double mlp_bw_out = MLP_NaN;
952 double mlp_use = MLP_NaN;
954 /* Check if we have to add this peer due to a pending request */
955 if (GNUNET_NO == GNUNET_CONTAINER_multihashmap_contains(mlp->requested_peers, key))
958 GNUNET_assert (address->solver_information != NULL);
959 mlpi = address->solver_information;
961 mlp_bw_in = glp_mip_col_val(mlp->p.prob, mlpi->c_b);/* FIXME */
962 if (mlp_bw_in > (double) UINT32_MAX)
964 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
965 mlp_bw_in = (double) UINT32_MAX;
967 mlp_bw_out = glp_mip_col_val(mlp->p.prob, mlpi->c_b);
968 if (mlp_bw_out > (double) UINT32_MAX)
970 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
971 mlp_bw_out = (double) UINT32_MAX;
973 mlp_use = glp_mip_col_val(mlp->p.prob, mlpi->c_n);
977 if ((GLP_YES == mlp_use) && (GNUNET_NO == address->active))
979 /* Address switch: Activate address*/
980 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : enabling address\n", (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
981 address->active = GNUNET_YES;
982 address->assigned_bw_in.value__ = htonl (mlp_bw_in);
983 mlpi->b_in.value__ = htonl(mlp_bw_in);
984 address->assigned_bw_out.value__ = htonl (mlp_bw_out);
985 mlpi->b_out.value__ = htonl(mlp_bw_out);
987 mlp->bw_changed_cb (mlp->bw_changed_cb_cls, address);
989 else if ((GLP_NO == mlp_use) && (GNUNET_YES == address->active))
991 /* Address switch: Disable address*/
992 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : disabling address\n", (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
993 address->active = GNUNET_NO;
994 /* Set bandwidth to 0 */
995 address->assigned_bw_in.value__ = htonl (0);
996 mlpi->b_in.value__ = htonl(mlp_bw_in);
997 address->assigned_bw_out.value__ = htonl (0);
998 mlpi->b_out.value__ = htonl(mlp_bw_out);
1000 mlp->bw_changed_cb (mlp->bw_changed_cb_cls, address);
1002 else if ((mlp_bw_out != ntohl(address->assigned_bw_out.value__)) ||
1003 (mlp_bw_in != ntohl(address->assigned_bw_in.value__)))
1005 /* Bandwidth changed */
1006 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : bandwidth changed\n", (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1007 address->assigned_bw_in.value__ = htonl (mlp_bw_in);
1008 mlpi->b_in.value__ = htonl(mlp_bw_in);
1009 address->assigned_bw_out.value__ = htonl (mlp_bw_out);
1010 mlpi->b_out.value__ = htonl(mlp_bw_out);
1012 mlp->bw_changed_cb (mlp->bw_changed_cb_cls, address);
1016 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : no change\n", (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1025 * Solves the MLP problem
1027 * @param solver the MLP Handle
1028 * @return GNUNET_OK if could be solved, GNUNET_SYSERR on failure
1031 GAS_mlp_solve_problem (void *solver)
1033 struct GAS_MLP_Handle *mlp = solver;
1037 struct GNUNET_TIME_Absolute start_build;
1038 struct GNUNET_TIME_Relative duration_build;
1039 struct GNUNET_TIME_Absolute start_lp;
1040 struct GNUNET_TIME_Relative duration_lp;
1041 struct GNUNET_TIME_Absolute start_mlp;
1042 struct GNUNET_TIME_Relative duration_mlp;
1043 GNUNET_assert (NULL != solver);
1045 if (GNUNET_YES == mlp->bulk_lock)
1047 mlp->bulk_request ++;
1051 if (0 == GNUNET_CONTAINER_multihashmap_size(mlp->requested_peers))
1056 if (0 == GNUNET_CONTAINER_multihashmap_size(mlp->addresses))
1062 if ((GNUNET_NO == mlp->mlp_prob_changed) && (GNUNET_NO == mlp->mlp_prob_updated))
1064 LOG (GNUNET_ERROR_TYPE_DEBUG, "No changes to problem\n");
1067 if (GNUNET_YES == mlp->mlp_prob_changed)
1069 LOG (GNUNET_ERROR_TYPE_DEBUG, "Problem size changed, rebuilding\n");
1070 mlp_delete_problem (mlp);
1071 start_build = GNUNET_TIME_absolute_get();
1072 if (GNUNET_SYSERR == mlp_create_problem (mlp))
1073 return GNUNET_SYSERR;
1074 duration_build = GNUNET_TIME_absolute_get_duration (start_build);
1075 mlp->control_param_lp.presolve = GLP_YES;
1076 mlp->control_param_mlp.presolve = GNUNET_NO; /* No presolver, we have LP solution */
1080 LOG (GNUNET_ERROR_TYPE_DEBUG, "Problem was updated, resolving\n");
1081 duration_build.rel_value_us = 0;
1085 LOG (GNUNET_ERROR_TYPE_DEBUG, "Running LP solver %s\n", (GLP_YES == mlp->control_param_lp.presolve)? "with presolver": "without presolver");
1086 start_lp = GNUNET_TIME_absolute_get();
1087 res_lp = mlp_solve_lp_problem (mlp);
1088 duration_lp = GNUNET_TIME_absolute_get_duration (start_lp);
1092 LOG (GNUNET_ERROR_TYPE_DEBUG, "Running MLP solver \n");
1093 start_mlp = GNUNET_TIME_absolute_get();
1094 res_mip = mlp_solve_mlp_problem (mlp);
1096 duration_mlp = GNUNET_TIME_absolute_get_duration (start_mlp);
1099 mlp->ps.lp_res = res_lp;
1100 mlp->ps.mip_res = res_mip;
1101 mlp->ps.build_dur = duration_build;
1102 mlp->ps.lp_dur = duration_lp;
1103 mlp->ps.mip_dur = duration_mlp;
1104 mlp->ps.lp_presolv = mlp->control_param_lp.presolve;
1105 mlp->ps.mip_presolv = mlp->control_param_mlp.presolve;
1106 mlp->ps.p_cols = glp_get_num_cols (mlp->p.prob);
1107 mlp->ps.p_rows = glp_get_num_rows (mlp->p.prob);
1108 mlp->ps.p_elements = mlp->p.num_elements;
1110 LOG (GNUNET_ERROR_TYPE_DEBUG,
1111 "Execution time: Build %s\n",
1112 GNUNET_STRINGS_relative_time_to_string (duration_build, GNUNET_NO));
1113 LOG (GNUNET_ERROR_TYPE_DEBUG,
1114 "Execution time: LP %s\n",
1115 GNUNET_STRINGS_relative_time_to_string (duration_lp, GNUNET_NO));
1116 LOG (GNUNET_ERROR_TYPE_DEBUG,
1117 "Execution time: MLP %s\n",
1118 GNUNET_STRINGS_relative_time_to_string (duration_mlp, GNUNET_NO));
1120 /* Propagate result*/
1121 if ((GNUNET_OK == res_lp) && (GNUNET_OK == res_mip))
1122 GNUNET_CONTAINER_multihashmap_iterate (mlp->addresses, &mlp_propagate_results, mlp);
1124 struct GNUNET_TIME_Absolute time = GNUNET_TIME_absolute_get();
1125 if (GNUNET_YES == mlp->write_mip_mps)
1127 /* Write problem to disk */
1128 GNUNET_asprintf (&filename, "problem_p_%u_a%u_%llu.mps", mlp->p.num_peers, mlp->p.num_addresses, time.abs_value_us);
1129 LOG (GNUNET_ERROR_TYPE_ERROR, "DUMP: %s \n", filename);
1130 glp_write_lp(mlp->p.prob, NULL, filename);
1131 GNUNET_free (filename);
1133 if (GNUNET_YES == mlp->write_mip_sol)
1135 /* Write solution to disk */
1136 GNUNET_asprintf (&filename, "problem_p_%u_a%u_%llu.sol", mlp->p.num_peers, mlp->p.num_addresses, time.abs_value_us);
1137 glp_print_mip (mlp->p.prob, filename );
1138 LOG (GNUNET_ERROR_TYPE_ERROR, "DUMP: %s \n", filename);
1139 GNUNET_free (filename);
1142 /* Reset change and update marker */
1143 mlp->control_param_lp.presolve = GLP_NO;
1144 mlp->mlp_prob_updated = GNUNET_NO;
1145 mlp->mlp_prob_changed = GNUNET_NO;
1147 if ((GNUNET_OK == res_lp) && (GNUNET_OK == res_mip))
1150 return GNUNET_SYSERR;
1154 * Add a single address to the solve
1156 * @param solver the solver Handle
1157 * @param address the address to add
1158 * @param network network type of this address
1161 GAS_mlp_address_add (void *solver,
1162 struct ATS_Address *address,
1165 struct GAS_MLP_Handle *mlp = solver;
1168 GNUNET_assert (NULL != solver);
1169 GNUNET_assert (NULL != address);
1171 if (NULL == address->solver_information)
1173 address->solver_information = GNUNET_malloc (sizeof (struct MLP_information));
1176 LOG (GNUNET_ERROR_TYPE_ERROR, _("Adding address for peer `%s' multiple times\n"), GNUNET_i2s(&address->peer));
1178 /* Is this peer included in the problem? */
1179 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, &address->peer.hashPubKey)))
1181 LOG (GNUNET_ERROR_TYPE_DEBUG, "Adding address for peer `%s' without address request \n", GNUNET_i2s(&address->peer));
1185 LOG (GNUNET_ERROR_TYPE_DEBUG, "Adding address for peer `%s' with address request \n", GNUNET_i2s(&address->peer));
1186 /* Problem size changed: new address for peer with pending request */
1187 mlp->mlp_prob_changed = GNUNET_YES;
1188 if (GNUNET_YES == mlp->mlp_auto_solve)
1189 GAS_mlp_solve_problem (solver);
1194 * Transport properties for this address have changed
1196 * @param solver solver handle
1197 * @param address the address
1198 * @param type the ATSI type in HBO
1199 * @param abs_value the absolute value of the property
1200 * @param rel_value the normalized value
1203 GAS_mlp_address_property_changed (void *solver,
1204 struct ATS_Address *address,
1209 struct MLP_information *mlpi = address->solver_information;
1210 struct GAS_MLP_Handle *mlp = solver;
1215 GNUNET_assert (NULL != solver);
1216 GNUNET_assert (NULL != address);
1220 LOG (GNUNET_ERROR_TYPE_ERROR,
1221 _("Updating address property `%s' for peer `%s' %p not added before\n"),
1222 GNUNET_ATS_print_property_type (type),
1223 GNUNET_i2s(&address->peer),
1229 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers,
1230 &address->peer.hashPubKey)))
1232 /* Peer is not requested, so no need to update problem */
1235 LOG (GNUNET_ERROR_TYPE_DEBUG, "Updating property `%s' address for peer `%s'\n",
1236 GNUNET_ATS_print_property_type (type),
1237 GNUNET_i2s(&address->peer));
1239 /* Find row index */
1241 for (c1 = 0; c1 < mlp->pv.m_q; c1++)
1243 if (type == mlp->pv.q[c1])
1249 if (-1 == type_index)
1252 return; /* quality index not found */
1255 /* Update c7) [r_q[index]][c_b] = f_q * q_averaged[type_index] */
1256 if (GNUNET_YES == mlp_create_problem_update_value (&mlp->p,
1257 mlp->p.r_q[type_index], mlpi->c_b, rel_value, __LINE__))
1259 mlp->mlp_prob_updated = GNUNET_YES;
1260 if (GNUNET_YES == mlp->mlp_auto_solve)
1261 GAS_mlp_solve_problem (solver);
1267 * Transport session for this address has changed
1269 * NOTE: values in addresses are already updated
1271 * @param solver solver handle
1272 * @param address the address
1273 * @param cur_session the current session
1274 * @param new_session the new session
1277 GAS_mlp_address_session_changed (void *solver,
1278 struct ATS_Address *address,
1279 uint32_t cur_session,
1280 uint32_t new_session)
1282 /* Nothing to do here */
1288 * Transport session for this address has changed
1290 * NOTE: values in addresses are already updated
1292 * @param solver solver handle
1293 * @param address the address
1294 * @param in_use usage state
1297 GAS_mlp_address_inuse_changed (void *solver,
1298 struct ATS_Address *address,
1301 /* Nothing to do here */
1307 * Network scope for this address has changed
1309 * NOTE: values in addresses are already updated
1311 * @param solver solver handle
1312 * @param address the address
1313 * @param current_network the current network
1314 * @param new_network the new network
1317 GAS_mlp_address_change_network (void *solver,
1318 struct ATS_Address *address,
1319 uint32_t current_network,
1320 uint32_t new_network)
1322 struct MLP_information *mlpi = address->solver_information;
1323 struct GAS_MLP_Handle *mlp = solver;
1325 int nets_avail[] = GNUNET_ATS_NetworkType;
1328 GNUNET_assert (NULL != solver);
1329 GNUNET_assert (NULL != address);
1337 if (mlpi->c_b == MLP_UNDEFINED)
1338 return; /* This address is not yet in the matrix*/
1340 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers,
1341 &address->peer.hashPubKey)))
1343 /* Peer is not requested, so no need to update problem */
1348 if (current_network == new_network)
1354 for (c1 = 0; c1 < GNUNET_ATS_NetworkTypeCount ; c1 ++)
1356 if (nets_avail[c1] == new_network)
1360 if (GNUNET_ATS_NetworkTypeCount == c1)
1362 /* Invalid network */
1367 LOG (GNUNET_ERROR_TYPE_DEBUG, "Updating network for peer `%s' from `%s' to `%s'\n",
1368 GNUNET_i2s (&address->peer),
1369 GNUNET_ATS_print_network_type(current_network),
1370 GNUNET_ATS_print_network_type(new_network));
1372 for (c1 = 0; c1 < GNUNET_ATS_NetworkTypeCount; c1++)
1374 if (mlp->pv.quota_index[c1] == current_network)
1376 /* Remove from old network */
1377 mlp_create_problem_update_value (&mlp->p,
1379 mlpi->c_b, 0.0, __LINE__);
1384 for (c1 = 0; c1 < GNUNET_ATS_NetworkTypeCount; c1++)
1386 if (mlp->pv.quota_index[c1] == new_network)
1388 /* Remove from old network */
1389 if (GNUNET_SYSERR == mlp_create_problem_update_value (&mlp->p,
1391 mlpi->c_b, 1.0, __LINE__))
1393 /* This quota did not exist in the problem, recreate */
1400 mlp->mlp_prob_changed = GNUNET_YES;
1405 * Deletes a single address in the MLP problem
1407 * The MLP problem has to be recreated and the problem has to be resolved
1409 * @param solver the MLP Handle
1410 * @param address the address to delete
1411 * @param session_only delete only session not whole address
1414 GAS_mlp_address_delete (void *solver,
1415 struct ATS_Address *address,
1419 struct GAS_MLP_Handle *mlp = solver;
1420 struct MLP_information *mlpi;
1422 GNUNET_assert (NULL != solver);
1423 GNUNET_assert (NULL != address);
1425 mlpi = address->solver_information;
1426 if ((GNUNET_NO == session_only) && (NULL != mlpi))
1429 address->solver_information = NULL;
1432 /* Is this peer included in the problem? */
1433 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, &address->peer.hashPubKey)))
1435 LOG (GNUNET_ERROR_TYPE_DEBUG, "Deleting %s for peer `%s' without address request \n",
1436 (session_only == GNUNET_YES) ? "session" : "address",
1437 GNUNET_i2s(&address->peer));
1440 LOG (GNUNET_ERROR_TYPE_DEBUG, "Deleting %s for peer `%s' with address request \n",
1441 (session_only == GNUNET_YES) ? "session" : "address",
1442 GNUNET_i2s(&address->peer));
1444 /* Problem size changed: new address for peer with pending request */
1445 mlp->mlp_prob_changed = GNUNET_YES;
1446 if (GNUNET_YES == mlp->mlp_auto_solve)
1447 GAS_mlp_solve_problem (solver);
1453 * Find the active address in the set of addresses of a peer
1454 * @param cls destination
1455 * @param key peer id
1456 * @param value address
1460 mlp_get_preferred_address_it (void *cls, const struct GNUNET_HashCode * key, void *value)
1463 struct ATS_Address *aa = (struct ATS_Address *) cls;
1464 struct ATS_Address *addr = value;
1465 struct MLP_information *mlpi = addr->solver_information;
1468 if (mlpi->n == GNUNET_YES)
1471 aa->assigned_bw_in = mlpi->b_in;
1472 aa->assigned_bw_out = mlpi->b_out;
1479 static double get_peer_pref_value (struct GAS_MLP_Handle *mlp, const struct GNUNET_PeerIdentity *peer)
1482 const double *preferences = NULL;
1484 preferences = mlp->get_preferences (mlp->get_preferences_cls, peer);
1487 for (c = 0; c < GNUNET_ATS_PreferenceCount; c++)
1489 if (c != GNUNET_ATS_PREFERENCE_END)
1491 //fprintf (stderr, "VALUE[%u] %s %.3f \n", c, GNUNET_i2s (&cur->addr->peer), t[c]);
1492 res += preferences[c];
1495 res /= (GNUNET_ATS_PreferenceCount -1);
1501 * Get the preferred address for a specific peer
1503 * @param solver the MLP Handle
1504 * @param peer the peer
1505 * @return suggested address
1507 const struct ATS_Address *
1508 GAS_mlp_get_preferred_address (void *solver,
1509 const struct GNUNET_PeerIdentity *peer)
1511 struct GAS_MLP_Handle *mlp = solver;
1513 struct ATS_Address *res = NULL;
1515 GNUNET_assert (NULL != solver);
1516 GNUNET_assert (NULL != peer);
1518 LOG (GNUNET_ERROR_TYPE_DEBUG, "Getting preferred address for `%s'\n",
1521 /* Is this peer included in the problem? */
1522 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, &peer->hashPubKey)))
1524 LOG (GNUNET_ERROR_TYPE_DEBUG, "Adding peer `%s' to list of requested_peers with requests\n",
1527 p = GNUNET_malloc (sizeof (struct ATS_Peer));
1529 p->f = get_peer_pref_value (mlp, peer);
1530 GNUNET_CONTAINER_multihashmap_put (mlp->requested_peers, &peer->hashPubKey, p, GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
1532 /* Added new peer, we have to rebuild problem before solving */
1533 mlp->mlp_prob_changed = GNUNET_YES;
1535 if (GNUNET_YES == mlp->mlp_auto_solve)
1536 GAS_mlp_solve_problem (mlp);
1538 /* Get prefered address */
1539 GNUNET_CONTAINER_multihashmap_get_multiple (mlp->addresses, &peer->hashPubKey,
1540 mlp_get_preferred_address_it, res);
1547 * Start a bulk operation
1549 * @param solver the solver
1552 GAS_mlp_bulk_start (void *solver)
1554 LOG (GNUNET_ERROR_TYPE_DEBUG, "Locking solver for bulk operation ...\n");
1555 struct GAS_MLP_Handle *s = (struct GAS_MLP_Handle *) solver;
1557 GNUNET_assert (NULL != solver);
1563 GAS_mlp_bulk_stop (void *solver)
1565 LOG (GNUNET_ERROR_TYPE_DEBUG, "Unlocking solver from bulk operation ...\n");
1567 struct GAS_MLP_Handle *s = (struct GAS_MLP_Handle *) solver;
1568 GNUNET_assert (NULL != solver);
1570 if (s->bulk_lock < 1)
1577 if (0 < s->bulk_request)
1579 GAS_mlp_solve_problem (solver);
1587 * Stop notifying about address and bandwidth changes for this peer
1589 * @param solver the MLP handle
1590 * @param peer the peer
1593 GAS_mlp_stop_get_preferred_address (void *solver,
1594 const struct GNUNET_PeerIdentity *peer)
1596 struct GAS_MLP_Handle *mlp = solver;
1597 struct ATS_Peer *p = NULL;
1599 GNUNET_assert (NULL != solver);
1600 GNUNET_assert (NULL != peer);
1602 if (NULL != (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, &peer->hashPubKey)))
1604 GNUNET_CONTAINER_multihashmap_remove (mlp->requested_peers, &peer->hashPubKey, p);
1611 * Changes the preferences for a peer in the MLP problem
1613 * @param solver the MLP Handle
1614 * @param peer the peer
1615 * @param kind the kind to change the preference
1616 * @param pref_rel the relative score
1619 GAS_mlp_address_change_preference (void *solver,
1620 const struct GNUNET_PeerIdentity *peer,
1621 enum GNUNET_ATS_PreferenceKind kind,
1624 struct GAS_MLP_Handle *mlp = solver;
1625 struct ATS_Peer *p = NULL;
1627 LOG (GNUNET_ERROR_TYPE_DEBUG, "Changing preference for address for peer `%s' to %.2f\n",
1628 GNUNET_i2s(peer), pref_rel);
1630 GNUNET_STATISTICS_update (mlp->stats,"# LP address preference changes", 1, GNUNET_NO);
1631 /* Update the constraints with changed preferences */
1633 /* Update quality constraint c7 */
1635 /* Update relativity constraint c9 */
1636 if (NULL == (p = GNUNET_CONTAINER_multihashmap_get (mlp->requested_peers, &peer->hashPubKey)))
1638 LOG (GNUNET_ERROR_TYPE_ERROR, "Updating preference for unknown peer `%s'\n", GNUNET_i2s(peer));
1641 p->f = get_peer_pref_value (mlp, peer);
1642 LOG (GNUNET_ERROR_TYPE_ERROR, "PEER PREF: %s %.2f\n",
1643 GNUNET_i2s(peer), p->f);
1644 mlp_create_problem_update_value (&mlp->p, p->r_c9, mlp->p.c_r, -p->f, __LINE__);
1646 /* Problem size changed: new address for peer with pending request */
1647 mlp->mlp_prob_updated = GNUNET_YES;
1648 if (GNUNET_YES == mlp->mlp_auto_solve)
1649 GAS_mlp_solve_problem (solver);
1655 * Get application feedback for a peer
1657 * @param solver the solver handle
1658 * @param application the application
1659 * @param peer the peer to change the preference for
1660 * @param kind the kind to change the preference
1661 * @param score the score
1664 GAS_mlp_address_preference_feedback (void *solver,
1666 const struct GNUNET_PeerIdentity *peer,
1667 enum GNUNET_ATS_PreferenceKind kind,
1670 struct GAS_PROPORTIONAL_Handle *s = solver;
1671 GNUNET_assert (NULL != solver);
1672 GNUNET_assert (NULL != peer);
1674 GNUNET_assert (NULL != s);
1679 mlp_free_peers (void *cls, const struct GNUNET_HashCode *key, void *value)
1681 struct GNUNET_CONTAINER_MultiHashMap *map = cls;
1682 struct ATS_Peer *p = value;
1684 GNUNET_CONTAINER_multihashmap_remove (map, key, value);
1692 * Shutdown the MLP problem solving component
1694 * @param solver the solver handle
1697 GAS_mlp_done (void *solver)
1699 struct GAS_MLP_Handle *mlp = solver;
1700 GNUNET_assert (mlp != NULL);
1702 LOG (GNUNET_ERROR_TYPE_DEBUG, "Shutting down mlp solver\n");
1703 mlp_delete_problem (mlp);
1705 GNUNET_CONTAINER_multihashmap_iterate (mlp->requested_peers, &mlp_free_peers, mlp->requested_peers);
1706 GNUNET_CONTAINER_multihashmap_destroy (mlp->requested_peers);
1707 mlp->requested_peers = NULL;
1709 /* Clean up GLPK environment */
1713 LOG (GNUNET_ERROR_TYPE_DEBUG, "Shutdown down of mlp solver complete\n");
1718 * Init the MLP problem solving component
1720 * @param cfg the GNUNET_CONFIGURATION_Handle handle
1721 * @param stats the GNUNET_STATISTICS handle
1722 * @param addresses the address hashmap
1723 * @param network array of GNUNET_ATS_NetworkType with length dest_length
1724 * @param out_dest array of outbound quotas
1725 * @param in_dest array of outbound quota
1726 * @param dest_length array length for quota arrays
1727 * @param bw_changed_cb callback for changed bandwidth amounts
1728 * @param bw_changed_cb_cls cls for callback
1729 * @param get_preference callback to get relative preferences for a peer
1730 * @param get_preference_cls cls for callback to get relative preferences
1731 * @param get_properties callback to get relative properties
1732 * @param get_properties_cls cls for callback to get relative properties
1733 * @return struct GAS_MLP_Handle on success, NULL on fail
1736 GAS_mlp_init (const struct GNUNET_CONFIGURATION_Handle *cfg,
1737 const struct GNUNET_STATISTICS_Handle *stats,
1738 const struct GNUNET_CONTAINER_MultiHashMap *addresses,
1740 unsigned long long *out_dest,
1741 unsigned long long *in_dest,
1743 GAS_bandwidth_changed_cb bw_changed_cb,
1744 void *bw_changed_cb_cls,
1745 GAS_get_preferences get_preference,
1746 void *get_preference_cls,
1747 GAS_get_properties get_properties,
1748 void *get_properties_cls)
1750 struct GAS_MLP_Handle * mlp = GNUNET_malloc (sizeof (struct GAS_MLP_Handle));
1755 unsigned long long tmp;
1762 struct GNUNET_TIME_Relative max_duration;
1763 long long unsigned int max_iterations;
1765 GNUNET_assert (NULL != cfg);
1766 GNUNET_assert (NULL != stats);
1767 GNUNET_assert (NULL != addresses);
1768 GNUNET_assert (NULL != bw_changed_cb);
1769 GNUNET_assert (NULL != get_preference);
1770 GNUNET_assert (NULL != get_properties);
1772 /* Init GLPK environment */
1773 int res = glp_init_env();
1776 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
1777 "initialization successful");
1780 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
1781 "environment is already initialized");
1784 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
1785 "initialization failed (insufficient memory)");
1790 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
1791 "initialization failed (unsupported programming model)");
1799 mlp->write_mip_mps = GNUNET_CONFIGURATION_get_value_yesno (cfg, "ats",
1801 if (GNUNET_SYSERR == mlp->write_mip_mps)
1802 mlp->write_mip_mps = GNUNET_NO;
1803 mlp->write_mip_sol = GNUNET_CONFIGURATION_get_value_yesno (cfg, "ats",
1805 if (GNUNET_SYSERR == mlp->write_mip_sol)
1806 mlp->write_mip_sol = GNUNET_NO;
1808 mlp->pv.BIG_M = (double) BIG_M_VALUE;
1810 /* Get timeout for iterations */
1811 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_time(cfg, "ats", "MLP_MAX_DURATION", &max_duration))
1813 max_duration = MLP_MAX_EXEC_DURATION;
1816 /* Get maximum number of iterations */
1817 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_size(cfg, "ats", "MLP_MAX_ITERATIONS", &max_iterations))
1819 max_iterations = MLP_MAX_ITERATIONS;
1822 /* Get diversity coefficient from configuration */
1823 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1824 "MLP_COEFFICIENT_D",
1826 D = (double) tmp / 100;
1830 /* Get proportionality coefficient from configuration */
1831 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1832 "MLP_COEFFICIENT_R",
1834 R = (double) tmp / 100;
1838 /* Get utilization coefficient from configuration */
1839 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1840 "MLP_COEFFICIENT_U",
1842 U = (double) tmp / 100;
1846 /* Get quality metric coefficients from configuration */
1847 int i_delay = MLP_NaN;
1848 int i_distance = MLP_NaN;
1849 int q[GNUNET_ATS_QualityPropertiesCount] = GNUNET_ATS_QualityProperties;
1850 for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
1852 /* initialize quality coefficients with default value 1.0 */
1853 mlp->pv.co_Q[c] = DEFAULT_QUALITY;
1855 mlp->pv.q[c] = q[c];
1856 if (q[c] == GNUNET_ATS_QUALITY_NET_DELAY)
1858 if (q[c] == GNUNET_ATS_QUALITY_NET_DISTANCE)
1862 if ((i_delay != MLP_NaN) && (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1863 "MLP_COEFFICIENT_QUALITY_DELAY",
1866 mlp->pv.co_Q[i_delay] = (double) tmp / 100;
1868 mlp->pv.co_Q[i_delay] = DEFAULT_QUALITY;
1870 if ((i_distance != MLP_NaN) && (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1871 "MLP_COEFFICIENT_QUALITY_DISTANCE",
1873 mlp->pv.co_Q[i_distance] = (double) tmp / 100;
1875 mlp->pv.co_Q[i_distance] = DEFAULT_QUALITY;
1877 /* Get minimum bandwidth per used address from configuration */
1878 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1879 "MLP_MIN_BANDWIDTH",
1884 b_min = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1887 /* Get minimum number of connections from configuration */
1888 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats",
1889 "MLP_MIN_CONNECTIONS",
1893 n_min = DEFAULT_MIN_CONNECTIONS;
1895 /* Init network quotas */
1896 int quotas[GNUNET_ATS_NetworkTypeCount] = GNUNET_ATS_NetworkType;
1897 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1900 for (c2 = 0; c2 < dest_length; c2++)
1902 if (quotas[c] == network[c2])
1904 mlp->pv.quota_index[c] = network[c2];
1905 mlp->pv.quota_out[c] = out_dest[c2];
1906 mlp->pv.quota_in[c] = in_dest[c2];
1908 LOG (GNUNET_ERROR_TYPE_DEBUG, "Quota for network `%s' (in/out) %llu/%llu\n",
1909 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1910 mlp->pv.quota_out[c],
1911 mlp->pv.quota_in[c]);
1916 /* Check if defined quota could make problem unsolvable */
1917 if ((n_min * b_min) > mlp->pv.quota_out[c])
1919 LOG (GNUNET_ERROR_TYPE_INFO, _("Adjusting inconsistent outbound quota configuration for network `%s', is %llu must be at least %llu\n"),
1920 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1921 mlp->pv.quota_out[c],
1923 mlp->pv.quota_out[c] = (n_min * b_min);
1925 if ((n_min * b_min) > mlp->pv.quota_in[c])
1927 LOG (GNUNET_ERROR_TYPE_INFO, _("Adjusting inconsistent inbound quota configuration for network `%s', is %llu must be at least %llu\n"),
1928 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1929 mlp->pv.quota_in[c],
1931 mlp->pv.quota_in[c] = (n_min * b_min);
1934 /* Check if bandwidth is too big to make problem solvable */
1935 if (mlp->pv.BIG_M < mlp->pv.quota_out[c])
1937 LOG (GNUNET_ERROR_TYPE_INFO, _("Adjusting outbound quota configuration for network `%s'from %llu to %.0f\n"),
1938 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1939 mlp->pv.quota_out[c],
1941 mlp->pv.quota_out[c] = mlp->pv.BIG_M ;
1943 if (mlp->pv.BIG_M < mlp->pv.quota_in[c])
1945 LOG (GNUNET_ERROR_TYPE_INFO, _("Adjusting inbound quota configuration for network `%s' from %llu to %.0f\n"),
1946 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1947 mlp->pv.quota_in[c],
1949 mlp->pv.quota_in[c] = mlp->pv.BIG_M ;
1952 if (GNUNET_NO == found)
1954 mlp->pv.quota_in[c] = ntohl(GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1955 mlp->pv.quota_out[c] = ntohl(GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1956 LOG (GNUNET_ERROR_TYPE_INFO, _("Using default quota configuration for network `%s' (in/out) %llu/%llu\n"),
1957 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
1958 mlp->pv.quota_in[c],
1959 mlp->pv.quota_out[c]);
1963 /* Assign options to handle */
1964 mlp->stats = (struct GNUNET_STATISTICS_Handle *) stats;
1965 mlp->addresses = addresses;
1966 mlp->bw_changed_cb = bw_changed_cb;
1967 mlp->bw_changed_cb_cls = bw_changed_cb_cls;
1968 mlp->get_preferences = get_preference;
1969 mlp->get_preferences_cls = get_preference_cls;
1970 mlp->get_properties = get_properties;
1971 mlp->get_properties_cls = get_properties_cls;
1972 /* Setting MLP Input variables */
1976 mlp->pv.b_min = b_min;
1977 mlp->pv.n_min = n_min;
1978 mlp->pv.m_q = GNUNET_ATS_QualityPropertiesCount;
1979 mlp->mlp_prob_changed = GNUNET_NO;
1980 mlp->mlp_prob_updated = GNUNET_NO;
1981 mlp->mlp_auto_solve = GNUNET_YES;
1982 mlp->requested_peers = GNUNET_CONTAINER_multihashmap_create (10, GNUNET_NO);
1983 mlp->bulk_request = 0;
1987 /* Redirect GLPK output to GNUnet logging */
1988 glp_term_hook (&mlp_term_hook, (void *) mlp);
1990 /* Init LP solving parameters */
1991 glp_init_smcp(&mlp->control_param_lp);
1992 mlp->control_param_lp.msg_lev = GLP_MSG_OFF;
1994 mlp->control_param_lp.msg_lev = GLP_MSG_ALL;
1996 mlp->control_param_lp.it_lim = max_iterations;
1997 mlp->control_param_lp.tm_lim = max_duration.rel_value_us / 1000LL;
1999 /* Init MLP solving parameters */
2000 glp_init_iocp(&mlp->control_param_mlp);
2001 mlp->control_param_mlp.msg_lev = GLP_MSG_OFF;
2003 mlp->control_param_mlp.msg_lev = GLP_MSG_ALL;
2005 mlp->control_param_mlp.tm_lim = max_duration.rel_value_us / 1000LL;
2007 LOG (GNUNET_ERROR_TYPE_DEBUG, "solver ready\n");
2012 /* end of gnunet-service-ats_addresses_mlp.c */