2 This file is part of GNUnet.
3 Copyright (C) 2011-2014 GNUnet e.V.
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., 51 Franklin Street, Fifth Floor,
18 Boston, MA 02110-1301, USA.
22 * @file ats/plugin_ats_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_ats_service.h"
30 #include "gnunet_ats_plugin.h"
31 #include "gnunet-service-ats_addresses.h"
32 #include "gnunet_statistics_service.h"
37 #define BIG_M_VALUE (UINT32_MAX) /10
38 #define BIG_M_STRING "unlimited"
40 #define MLP_AVERAGING_QUEUE_LENGTH 3
42 #define MLP_MAX_EXEC_DURATION GNUNET_TIME_relative_multiply(GNUNET_TIME_UNIT_SECONDS, 10)
43 #define MLP_MAX_ITERATIONS 4096
45 #define MLP_DEFAULT_D 1.0
46 #define MLP_DEFAULT_R 1.0
47 #define MLP_DEFAULT_U 1.0
48 #define MLP_DEFAULT_QUALITY 1.0
49 #define MLP_DEFAULT_MIN_CONNECTIONS 4
50 #define MLP_DEFAULT_PEER_PREFERENCE 1.0
53 #define MLP_UNDEFINED 0
57 enum MLP_Output_Format
67 RQ_QUALITY_METRIC_DELAY = 0,
68 RQ_QUALITY_METRIC_DISTANCE = 1,
69 RQ_QUALITY_METRIC_COUNT = 2
74 print_quality_type (enum QualityMetrics qm)
77 case RQ_QUALITY_METRIC_DELAY:
79 case RQ_QUALITY_METRIC_DISTANCE:
95 double lp_objective_value;
96 double mlp_objective_value;
111 struct GNUNET_PeerIdentity id;
113 /* Was this peer already added to the current problem? */
116 /* constraint 2: 1 address per peer*/
119 /* constraint 9: relativity */
122 /* Legacy preference value */
129 * GLPK (MLP) problem object
133 /* Number of addresses in problem */
134 unsigned int num_addresses;
135 /* Number of peers in problem */
136 unsigned int num_peers;
137 /* Number of elements in problem matrix */
138 unsigned int num_elements;
140 /* Row index constraint 2: */
142 /* Row index constraint 4: minimum connections */
144 /* Row index constraint 6: maximize diversity */
146 /* Row index constraint 8: utilization*/
148 /* Row index constraint 9: relativity*/
150 /* Row indices quality metrics */
151 int r_q[RQ_QUALITY_METRIC_COUNT];
152 /* Row indices ATS network quotas */
153 int r_quota[GNUNET_ATS_NetworkTypeCount];
155 /* Column index Diversity (D) column */
157 /* Column index Utilization (U) column */
159 /* Column index Proportionality (R) column */
161 /* Column index quality metrics */
162 int c_q[RQ_QUALITY_METRIC_COUNT];
167 /* Row index array */
169 /* Column index array */
171 /* Column index value */
178 /* Big M value for bandwidth capping */
187 /* Number of quality metrics @deprecated, use RQ_QUALITY_METRIC_COUNT */
190 /* Number of quality metrics */
193 /* Quality metric coefficients*/
194 double co_Q[RQ_QUALITY_METRIC_COUNT];
196 /* Ressource costs coefficients*/
197 double co_RC[RQ_QUALITY_METRIC_COUNT];
199 /* Diversity coefficient */
202 /* Utility coefficient */
205 /* Relativity coefficient */
208 /* Minimum bandwidth assigned to an address */
211 /* Minimum number of addresses with bandwidth assigned */
215 /* Array mapping array index to ATS network */
216 int quota_index[GNUNET_ATS_NetworkTypeCount];
217 /* Outbound quotas */
218 unsigned long long quota_out[GNUNET_ATS_NetworkTypeCount];
221 unsigned long long quota_in[GNUNET_ATS_NetworkTypeCount];
223 /* ATS ressource costs
224 * array with GNUNET_ATS_QualityPropertiesCount elements
225 * contains mapping to GNUNET_ATS_Property
227 int rc[RQ_QUALITY_METRIC_COUNT];
234 struct GAS_MLP_Handle
236 struct GNUNET_ATS_PluginEnvironment *env;
239 * Exclude peer from next result propagation
241 const struct GNUNET_PeerIdentity *exclude_peer;
244 * Encapsulation for the MLP problem
246 struct MLP_Problem p;
249 * Encapsulation for the MLP problem variables
251 struct MLP_Variables pv;
254 * Encapsulation for the MLP solution
256 struct MLP_Solution ps;
264 * Number of changes while solver was locked
266 int stat_bulk_requests;
269 * GLPK LP control parameter
271 glp_smcp control_param_lp;
274 * GLPK LP control parameter
276 glp_iocp control_param_mlp;
279 * Peers with pending address requests
281 struct GNUNET_CONTAINER_MultiPeerMap *requested_peers;
284 * Was the problem updated since last solution
286 int stat_mlp_prob_updated;
289 * Has the problem size changed since last solution
291 int stat_mlp_prob_changed;
294 * Solve the problem automatically when updates occur?
295 * Default: GNUNET_YES
296 * Can be disabled for test and measurements
298 int opt_mlp_auto_solve;
301 * Write all MILP problems to a MPS file
303 int opt_dump_problem_all;
306 * Write all MILP problem solutions to a file
308 int opt_dump_solution_all;
311 * Write MILP problems to a MPS file when solver fails
313 int opt_dump_problem_on_fail;
316 * Write MILP problem solutions to a file when solver fails
318 int opt_dump_solution_on_fail;
321 * solve feasibility only
323 int opt_dbg_feasibility_only;
326 * solve autoscale the problem
328 int opt_dbg_autoscale_problem;
331 * use the intopt presolver instead of simplex
333 int opt_dbg_intopt_presolver;
338 int opt_dbg_glpk_verbose;
341 * solve autoscale the problem
343 int opt_dbg_optimize_relativity;
346 * solve autoscale the problem
348 int opt_dbg_optimize_diversity;
351 * solve autoscale the problem
353 int opt_dbg_optimize_quality;
356 * solve autoscale the problem
358 int opt_dbg_optimize_utility;
364 enum MLP_Output_Format opt_log_format;
368 * Address specific MLP information
370 struct MLP_information
374 * Bandwidth assigned outbound
379 * Bandwidth assigned inbound
389 * bandwidth column index
394 * address usage column
401 * constraint 1: bandwidth capping
406 * constraint 3: minimum bandwidth
415 * NOTE: Do not modify this documentation. This documentation is based on
416 * gnunet.org:/vcs/fsnsg/ats-paper.git/tech-doku/ats-tech-guide.tex
417 * use build_txt.sh to generate plaintext output
419 * The MLP solver (mlp) tries to finds an optimal bandwidth assignmentby
420 * optimizing an mixed integer programming problem. The MLP solver uses a
421 * number of constraints to find the best adddress for a peer and an optimal
422 * bandwidth assignment. mlp uses the GNU Linear Programming Kit to solve the
425 * We defined a constraint system to find an optimal bandwidth assignment.
426 * This constraint system uses as an input data addresses, bandwidth quotas,
427 * preferences and quality values. This constraint system is stored in an
428 * matrix based equotation system.
432 * A (M)LP problem consists of a target function to optimizes, constraints
433 * and rows and columns. FIXME GLP uses three arrays to index the matrix: two
434 * integer arrays storing the row and column indices in the matrix and an
435 * float array to store the coeeficient.
437 * To solve the problem we first find an initial solution for the LP problem
438 * using the LP solver and then find an MLP solution based on this solution
439 * using the MLP solver.
441 * Solving (M)LP problems has the property that finding an initial solution
442 * for the LP problem is computationally expensive and finding the MLP
443 * solution is cheaper. This is especially interesting an existing LP
444 * solution can be reused if only coefficients in the matrix have changed
445 * (addresses updated). Only when the problem size changes (addresses added
446 * or deleted) a new LP solution has to be found.
449 * The mlp solver solves the bandwidth assignment problem only on demand when
450 * an address suggestion is requested. When an address is requested mlp the
451 * solves the mlp problem and if the active address or the bandwidth assigned
452 * changes it calls the callback to addresses. The mlp solver gets notified
453 * about new addresses (adding sessions), removed addresses (address
454 * deletions) and address updates. To benefit from the mlp properties
455 * mentioned in section 5 the solver rembers if since the last solution
456 * addresses were added or deleted (problem size changed, problem has to be
457 * rebuild and solved from sratch) or if addresses were updated and the
458 * existing solution can be reused.
462 * The quotas for each network segment are passed by addresses. MLP can be
463 * adapted using configuration settings and uses the following parameters:
464 * * MLP_MAX_DURATION:
465 * Maximum duration for a MLP solution procees (default: 3 sec.)
466 * * MLP_MAX_ITERATIONS:
467 * Maximum number of iterations for a MLP solution process (default:
469 * * MLP_MIN_CONNECTIONS:
470 * Minimum number of desired connections (default: 4)
471 * * MLP_MIN_BANDWIDTH:
472 * Minimum amount of bandwidth assigned to an address (default: 1024)
473 * * MLP_COEFFICIENT_D:
474 * Diversity coefficient (default: 1.0)
475 * * MLP_COEFFICIENT_R:
476 * Relativity coefficient (default: 1.0)
477 * * MLP_COEFFICIENT_U:
478 * Utilization coefficient (default: 1.0)
479 * * MLP_COEFFICIENT_D:
480 * Diversity coefficient (default: 1.0)
481 * * MLP_COEFFICIENT_QUALITY_DELAY:
482 * Quality delay coefficient (default: 1.0)
483 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
484 * Quality distance coefficient (default: 1.0)
485 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
486 * Quality distance coefficient (default: 1.0)
487 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
488 * Quality distance coefficient (default: 1.0)
489 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
490 * Quality distance coefficient (default: 1.0)
492 * 5.2 Data structures used
494 * mlp has for each known peer a struct ATS_Peer containing information about
495 * a specific peer. The address field solver_information contains information
496 * about the mlp properties of this address.
500 * During initialization mlp initializes the GLPK libray used to solve the
501 * MLP problem: it initializes the glpk environment and creates an initial LP
502 * problem. Next it loads the configuration values from the configuration or
503 * uses the default values configured in -addresses_mlp.h. The quotas used
504 * are given by addresses but may have to be adjusted. mlp uses a upper limit
505 * for the bandwidth assigned called BIG M and a minimum amount of bandwidth
506 * an address gets assigned as well as a minium desired number of
507 * connections. If the configured quota is bigger than BIG M, it is reduced
508 * to BIG M. If the configured quota is smaller than MLP_MIN_CONNECTIONS
509 * *MLP_MIN_BANDWIDTH it is increased to this value.
515 #define LOG(kind,...) GNUNET_log_from (kind, "ats-mlp",__VA_ARGS__)
518 * Print debug output for mlp problem creation
520 #define DEBUG_MLP_PROBLEM_CREATION GNUNET_NO
524 * Intercept GLPK terminal output
525 * @param info the mlp handle
526 * @param s the string to print
527 * @return 0: glpk prints output on terminal, 0 != surpress output
530 mlp_term_hook (void *info, const char *s)
532 struct GAS_MLP_Handle *mlp = info;
534 if (mlp->opt_dbg_glpk_verbose)
535 LOG (GNUNET_ERROR_TYPE_ERROR, "%s", s);
541 * Reset peers for next problem creation
543 * @param cls not used
545 * @param value ATS_Peer
549 reset_peers (void *cls,
550 const struct GNUNET_PeerIdentity *key,
553 struct ATS_Peer *peer = value;
554 peer->processed = GNUNET_NO;
559 * Delete the MLP problem and free the constrain matrix
561 * @param mlp the MLP handle
564 mlp_delete_problem (struct GAS_MLP_Handle *mlp)
569 if (mlp->p.prob != NULL)
571 glp_delete_prob(mlp->p.prob);
575 /* delete row index */
576 if (mlp->p.ia != NULL)
578 GNUNET_free (mlp->p.ia);
582 /* delete column index */
583 if (mlp->p.ja != NULL)
585 GNUNET_free (mlp->p.ja);
589 /* delete coefficients */
590 if (mlp->p.ar != NULL)
592 GNUNET_free (mlp->p.ar);
598 mlp->p.c_d = MLP_UNDEFINED;
599 mlp->p.c_r = MLP_UNDEFINED;
600 mlp->p.r_c2 = MLP_UNDEFINED;
601 mlp->p.r_c4 = MLP_UNDEFINED;
602 mlp->p.r_c6 = MLP_UNDEFINED;
603 mlp->p.r_c9 = MLP_UNDEFINED;
604 for (c = 0; c < RQ_QUALITY_METRIC_COUNT ; c ++)
605 mlp->p.r_q[c] = MLP_UNDEFINED;
606 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c ++)
607 mlp->p.r_quota[c] = MLP_UNDEFINED;
608 mlp->p.ci = MLP_UNDEFINED;
611 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
617 * Translate glpk status error codes to text
618 * @param retcode return code
619 * @return string with result
622 mlp_status_to_string (int retcode)
626 return "solution is undefined";
628 return "solution is feasible";
630 return "solution is infeasible";
632 return "no feasible solution exists";
634 return "solution is optimal";
636 return "solution is unbounded";
639 return "unknown error";
645 * Translate glpk solver error codes to text
646 * @param retcode return code
647 * @return string with result
650 mlp_solve_to_string (int retcode)
656 return "invalid basis";
658 return "singular matrix";
660 return "ill-conditioned matrix";
662 return "invalid bounds";
664 return "solver failed";
666 return "objective lower limit reached";
668 return "objective upper limit reached";
670 return "iteration limit exceeded";
672 return "time limit exceeded";
674 return "no primal feasible solution";
676 return "no dual feasible solution";
678 return "root LP optimum not provided";
680 return "search terminated by application";
682 return "relative mip gap tolerance reached";
684 return "no dual feasible solution";
686 return "no convergence";
688 return "numerical instability";
690 return "invalid data";
692 return "result out of range";
695 return "unknown error";
702 const struct GNUNET_CONTAINER_MultiPeerMap *map;
707 mlp_create_problem_count_addresses_it (void *cls,
708 const struct GNUNET_PeerIdentity *key,
711 struct CountContext *cctx = cls;
713 /* Check if we have to add this peer due to a pending request */
714 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
721 mlp_create_problem_count_addresses (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
722 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
724 struct CountContext cctx;
726 cctx.map = requested_peers;
728 GNUNET_CONTAINER_multipeermap_iterate (addresses,
729 &mlp_create_problem_count_addresses_it, &cctx);
735 mlp_create_problem_count_peers_it (void *cls,
736 const struct GNUNET_PeerIdentity *key,
739 struct CountContext *cctx = cls;
741 /* Check if we have to addresses for the requested peer */
742 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
749 mlp_create_problem_count_peers (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
750 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
752 struct CountContext cctx;
754 cctx.map = addresses;
756 GNUNET_CONTAINER_multipeermap_iterate (requested_peers,
757 &mlp_create_problem_count_peers_it, &cctx);
763 * Updates an existing value in the matrix
765 * Extract the row, updates the value and updates the row in the problem
767 * @param p the mlp problem
768 * @param row the row to create the value in
769 * @param col the column to create the value in
770 * @param val the value to set
771 * @param line calling line for debbuging
772 * @return GNUNET_YES value changed, GNUNET_NO value did not change, GNUNET_SYSERR
776 mlp_create_problem_update_value (struct MLP_Problem *p,
777 int row, int col, double val,
788 GNUNET_assert (NULL != p->prob);
790 /* Get number of columns and prepare data structure */
791 c_cols = glp_get_num_cols(p->prob);
793 return GNUNET_SYSERR;
795 val_array = GNUNET_malloc ((c_cols +1)* sizeof (double));
796 GNUNET_assert (NULL != val_array);
797 ind_array = GNUNET_malloc ((c_cols+1) * sizeof (int));
798 GNUNET_assert (NULL != ind_array);
799 /* Extract the row */
801 /* Update the value */
802 c_elems = glp_get_mat_row (p->prob, row, ind_array, val_array);
804 for (c1 = 1; c1 < (c_elems+1); c1++)
806 if (ind_array[c1] == col)
812 if (GNUNET_NO == found)
814 ind_array[c_elems+1] = col;
815 val_array[c_elems+1] = val;
816 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Setting value in [%s : %s] to `%.2f'\n",
817 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
819 glp_set_mat_row (p->prob, row, c_elems+1, ind_array, val_array);
820 GNUNET_free (ind_array);
821 GNUNET_free (val_array);
827 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Updating value in [%s : %s] from `%.2f' to `%.2f'\n",
828 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
830 if (val != val_array[c1])
835 /* Update the row in the matrix */
836 glp_set_mat_row (p->prob, row, c_elems, ind_array, val_array);
839 GNUNET_free (ind_array);
840 GNUNET_free (val_array);
845 * Creates a new value in the matrix
847 * Sets the row and column index in the problem array and increments the
850 * @param p the mlp problem
851 * @param row the row to create the value in
852 * @param col the column to create the value in
853 * @param val the value to set
854 * @param line calling line for debbuging
857 mlp_create_problem_set_value (struct MLP_Problem *p,
858 int row, int col, double val,
861 if ((p->ci) >= p->num_elements)
863 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Request for index %u bigger than array size of %u\n",
864 line, p->ci + 1, p->num_elements);
868 if ((0 == row) || (0 == col))
871 LOG (GNUNET_ERROR_TYPE_ERROR, "[P]: Invalid call from line %u: row = %u, col = %u\n",
877 #if DEBUG_MLP_PROBLEM_CREATION
878 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Set value [%u,%u] in index %u == %.2f\n",
879 line, p->ia[p->ci], p->ja[p->ci], p->ci, p->ar[p->ci]);
885 mlp_create_problem_create_column (struct MLP_Problem *p, char *name,
886 unsigned int type, unsigned int bound, double lb, double ub,
889 int col = glp_add_cols (p->prob, 1);
890 glp_set_col_name (p->prob, col, name);
891 glp_set_col_bnds (p->prob, col, bound, lb, ub);
892 glp_set_col_kind (p->prob, col, type);
893 glp_set_obj_coef (p->prob, col, coef);
894 #if DEBUG_MLP_PROBLEM_CREATION
895 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added column [%u] `%s': %.2f\n",
902 mlp_create_problem_create_constraint (struct MLP_Problem *p, char *name,
903 unsigned int bound, double lb, double ub)
906 int row = glp_add_rows (p->prob, 1);
908 glp_set_row_name (p->prob, row, name);
909 /* set row bounds: <= 0 */
910 glp_set_row_bnds (p->prob, row, bound, lb, ub);
914 GNUNET_asprintf(&op, "-inf <= x <= %.2f", ub);
917 GNUNET_asprintf(&op, "%.2f <= x <= %.2f", lb, ub);
920 GNUNET_asprintf(&op, "%.2f == x == %.2f", lb, ub);
923 GNUNET_asprintf(&op, "%.2f <= x <= inf", lb);
926 GNUNET_asprintf(&op, "ERROR");
929 #if DEBUG_MLP_PROBLEM_CREATION
930 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added row [%u] `%s': %s\n",
939 * - address columns b and n
940 * - address dependent constraint rows c1, c3
941 * - peer dependent rows c2 and c9
942 * - Set address dependent entries in problem matrix as well
945 mlp_create_problem_add_address_information (void *cls,
946 const struct GNUNET_PeerIdentity *key,
949 struct GAS_MLP_Handle *mlp = cls;
950 struct MLP_Problem *p = &mlp->p;
951 struct ATS_Address *address = value;
952 struct ATS_Peer *peer;
953 struct MLP_information *mlpi;
957 uint32_t addr_net_index;
958 unsigned long long max_quota;
961 /* Check if we have to add this peer due to a pending request */
962 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains(mlp->requested_peers, key))
965 mlpi = address->solver_information;
968 fprintf (stderr, "%s %p\n",GNUNET_i2s (&address->peer), address);
973 addr_net = address->properties.scope;
974 for (addr_net_index = 0; addr_net_index < GNUNET_ATS_NetworkTypeCount; addr_net_index++)
976 if (mlp->pv.quota_index[addr_net_index] == addr_net)
980 if (addr_net_index >= GNUNET_ATS_NetworkTypeCount)
987 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
989 if (mlp->pv.quota_out[c] > max_quota)
990 max_quota = mlp->pv.quota_out[c];
991 if (mlp->pv.quota_in[c] > max_quota)
992 max_quota = mlp->pv.quota_in[c];
994 if (max_quota > mlp->pv.BIG_M)
995 cur_bigm = (double) mlp->pv.BIG_M;
997 cur_bigm = max_quota;
1001 peer = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, key);
1002 GNUNET_assert (NULL != peer);
1003 if (peer->processed == GNUNET_NO)
1005 /* Add peer dependent constraints */
1006 /* Add c2) One address active per peer */
1007 GNUNET_asprintf(&name, "c2_%s", GNUNET_i2s(&address->peer));
1008 peer->r_c2 = mlp_create_problem_create_constraint (p, name, GLP_FX, 1.0, 1.0);
1010 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1012 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1014 /* Add c9) Relativity */
1015 GNUNET_asprintf(&name, "c9_%s", GNUNET_i2s(&address->peer));
1016 peer->r_c9 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1018 /* c9) set coefficient */
1019 mlp_create_problem_set_value (p, peer->r_c9, p->c_r, -peer->f , __LINE__);
1022 peer->processed = GNUNET_YES;
1025 /* Reset addresses' solver information */
1032 /* Add bandwidth column */
1033 GNUNET_asprintf (&name, "b_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1034 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1036 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 0.0);
1040 /* Maximize for bandwidth assignment in feasibility testing */
1041 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 1.0);
1045 /* Add address active column */
1046 GNUNET_asprintf (&name, "n_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1047 mlpi->c_n = mlp_create_problem_create_column (p, name, GLP_IV, GLP_DB, 0.0, 1.0, 0.0);
1050 /* Add address dependent constraints */
1051 /* Add c1) bandwidth capping: b_t + (-M) * n_t <= 0 */
1052 GNUNET_asprintf(&name, "c1_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1053 mlpi->r_c1 = mlp_create_problem_create_constraint (p, name, GLP_UP, 0.0, 0.0);
1055 /* c1) set b = 1 coefficient */
1056 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_b, 1, __LINE__);
1057 /* c1) set n = - min (M, quota) coefficient */
1058 cur_bigm = (double) mlp->pv.quota_out[addr_net_index];
1059 if (cur_bigm > mlp->pv.BIG_M)
1060 cur_bigm = (double) mlp->pv.BIG_M;
1061 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_n, -cur_bigm, __LINE__);
1063 /* Add constraint c 3) minimum bandwidth
1064 * b_t + (-n_t * b_min) >= 0
1066 GNUNET_asprintf(&name, "c3_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1067 mlpi->r_c3 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1070 /* c3) set b = 1 coefficient */
1071 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_b, 1, __LINE__);
1072 /* c3) set n = -b_min coefficient */
1073 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_n, - ((double )mlp->pv.b_min), __LINE__);
1076 /* Set coefficient entries in invariant rows */
1080 /* c 4) minimum connections */
1081 mlp_create_problem_set_value (p, p->r_c4, mlpi->c_n, 1, __LINE__);
1082 /* c 2) 1 address peer peer */
1083 mlp_create_problem_set_value (p, peer->r_c2, mlpi->c_n, 1, __LINE__);
1084 /* c 10) obey network specific quotas
1085 * (1)*b_1 + ... + (1)*b_m <= quota_n
1087 mlp_create_problem_set_value (p, p->r_quota[addr_net_index], mlpi->c_b, 1, __LINE__);
1090 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1092 /* c 6) maximize diversity */
1093 mlp_create_problem_set_value (p, p->r_c6, mlpi->c_n, 1, __LINE__);
1094 /* c 9) relativity */
1095 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1096 mlp_create_problem_set_value (p, peer->r_c9, mlpi->c_b, 1, __LINE__);
1098 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1099 mlp_create_problem_set_value (p, p->r_c8, mlpi->c_b, 1, __LINE__);
1100 /* c 7) Optimize quality */
1101 /* For all quality metrics, set quality of this address */
1102 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1104 mlp_create_problem_set_value (p,
1105 p->r_q[RQ_QUALITY_METRIC_DELAY],
1107 address->norm_delay.norm,
1109 mlp_create_problem_set_value (p,
1110 p->r_q[RQ_QUALITY_METRIC_DISTANCE],
1112 address->norm_distance.norm,
1122 * Create the invariant columns c4, c6, c10, c8, c7
1125 mlp_create_problem_add_invariant_rows (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1131 /* Row for c4) minimum connection */
1132 /* Number of minimum connections is min(|Peers|, n_min) */
1133 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);
1135 /* Rows for c 10) Enforce network quotas */
1136 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1139 GNUNET_asprintf(&text, "c10_quota_ats_%s",
1140 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]));
1141 p->r_quota[c] = mlp_create_problem_create_constraint (p, text, GLP_DB, 0.0, mlp->pv.quota_out[c]);
1146 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1149 /* Add row for c6) Maximize for diversity */
1150 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1152 p->r_c6 = mlp_create_problem_create_constraint (p, "c6", GLP_FX, 0.0, 0.0);
1153 /* Set c6 ) Setting -D */
1154 mlp_create_problem_set_value (p, p->r_c6, p->c_d, -1, __LINE__);
1157 /* Adding rows for c 8) Maximize utility */
1158 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1160 p->r_c8 = mlp_create_problem_create_constraint (p, "c8", GLP_FX, 0.0, 0.0);
1162 mlp_create_problem_set_value (p, p->r_c8, p->c_u, -1, __LINE__);
1165 /* For all quality metrics:
1166 * c 7) Maximize quality, austerity */
1167 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1169 for (c = 0; c < mlp->pv.m_q; c++)
1171 GNUNET_asprintf (&name,
1173 print_quality_type (c));
1174 p->r_q[c] = mlp_create_problem_create_constraint (p, name, GLP_FX, 0.0, 0.0);
1176 mlp_create_problem_set_value (p,
1178 p->c_q[c], -1, __LINE__);
1186 * Create the invariant columns d, u, r, q0 ... qm
1189 mlp_create_problem_add_invariant_columns (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1191 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1196 /* Diversity d column */
1197 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1198 p->c_d = mlp_create_problem_create_column (p, "d", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_D);
1200 /* Utilization u column */
1201 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1202 p->c_u = mlp_create_problem_create_column (p, "u", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_U);
1204 /* Relativity r column */
1205 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1206 p->c_r = mlp_create_problem_create_column (p, "r", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_R);
1208 /* Quality metric columns */
1209 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1211 for (c = 0; c < mlp->pv.m_q; c++)
1213 GNUNET_asprintf (&name, "q_%u", c);
1214 p->c_q[c] = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_Q[c]);
1223 * Create the MLP problem
1225 * @param mlp the MLP handle
1226 * @return #GNUNET_OK or #GNUNET_SYSERR
1229 mlp_create_problem (struct GAS_MLP_Handle *mlp)
1231 struct MLP_Problem *p = &mlp->p;
1232 int res = GNUNET_OK;
1234 GNUNET_assert (p->prob == NULL);
1235 GNUNET_assert (p->ia == NULL);
1236 GNUNET_assert (p->ja == NULL);
1237 GNUNET_assert (p->ar == NULL);
1238 /* Reset MLP problem struct */
1240 /* create the glpk problem */
1241 p->prob = glp_create_prob ();
1242 GNUNET_assert (NULL != p->prob);
1243 p->num_peers = mlp_create_problem_count_peers (mlp->requested_peers, mlp->env->addresses);
1244 p->num_addresses = mlp_create_problem_count_addresses (mlp->requested_peers,
1245 mlp->env->addresses);
1247 /* Create problem matrix: 10 * #addresses + #q * #addresses + #q, + #peer + 2 + 1 */
1248 p->num_elements = (10 * p->num_addresses + mlp->pv.m_q * p->num_addresses +
1249 mlp->pv.m_q + p->num_peers + 2 + 1);
1250 LOG (GNUNET_ERROR_TYPE_DEBUG,
1251 "Rebuilding problem for %u peer(s) and %u addresse(s) and %u quality metrics == %u elements\n",
1257 /* Set a problem name */
1258 glp_set_prob_name (p->prob, "GNUnet ATS bandwidth distribution");
1259 /* Set optimization direction to maximize */
1260 glp_set_obj_dir (p->prob, GLP_MAX);
1262 /* Create problem matrix */
1263 /* last +1 caused by glpk index starting with one: [1..elements]*/
1266 p->ia = GNUNET_malloc (p->num_elements * sizeof (int));
1268 p->ja = GNUNET_malloc (p->num_elements * sizeof (int));
1270 p->ar = GNUNET_malloc (p->num_elements * sizeof (double));
1272 if ((NULL == p->ia) || (NULL == p->ja) || (NULL == p->ar))
1274 LOG (GNUNET_ERROR_TYPE_ERROR, _("Problem size too large, cannot allocate memory!\n"));
1275 return GNUNET_SYSERR;
1278 /* Adding invariant columns */
1279 mlp_create_problem_add_invariant_columns (mlp, p);
1281 /* Adding address independent constraint rows */
1282 mlp_create_problem_add_invariant_rows (mlp, p);
1284 /* Adding address dependent columns constraint rows */
1285 GNUNET_CONTAINER_multipeermap_iterate (mlp->env->addresses,
1286 &mlp_create_problem_add_address_information,
1289 /* Load the matrix */
1290 LOG (GNUNET_ERROR_TYPE_DEBUG, "Loading matrix\n");
1291 glp_load_matrix(p->prob, (p->ci)-1, p->ia, p->ja, p->ar);
1292 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
1294 glp_scale_prob (p->prob, GLP_SF_AUTO);
1302 * Solves the LP problem
1304 * @param mlp the MLP Handle
1305 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1308 mlp_solve_lp_problem (struct GAS_MLP_Handle *mlp)
1312 res = glp_simplex(mlp->p.prob, &mlp->control_param_lp);
1314 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem: %s\n",
1315 mlp_solve_to_string (res));
1317 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem failed: %s\n",
1318 mlp_solve_to_string (res));
1320 /* Analyze problem status */
1321 res_status = glp_get_status (mlp->p.prob);
1322 switch (res_status) {
1323 case GLP_OPT: /* solution is optimal */
1324 LOG (GNUNET_ERROR_TYPE_INFO,
1325 "Solving LP problem: %s, %s\n",
1326 mlp_solve_to_string(res),
1327 mlp_status_to_string(res_status));
1330 LOG (GNUNET_ERROR_TYPE_ERROR,
1331 "Solving LP problem failed: %s %s\n",
1332 mlp_solve_to_string(res),
1333 mlp_status_to_string(res_status));
1334 return GNUNET_SYSERR;
1340 * Propagates the results when MLP problem was solved
1342 * @param cls the MLP handle
1343 * @param key the peer identity
1344 * @param value the address
1345 * @return #GNUNET_OK to continue
1348 mlp_propagate_results (void *cls,
1349 const struct GNUNET_PeerIdentity *key,
1352 struct GAS_MLP_Handle *mlp = cls;
1353 struct ATS_Address *address;
1354 struct MLP_information *mlpi;
1355 double mlp_bw_in = MLP_NaN;
1356 double mlp_bw_out = MLP_NaN;
1357 double mlp_use = MLP_NaN;
1359 /* Check if we have to add this peer due to a pending request */
1360 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains (mlp->requested_peers,
1366 GNUNET_assert (address->solver_information != NULL);
1367 mlpi = address->solver_information;
1369 mlp_bw_in = glp_mip_col_val(mlp->p.prob, mlpi->c_b);/* FIXME */
1370 if (mlp_bw_in > (double) UINT32_MAX)
1372 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1373 mlp_bw_in = (double) UINT32_MAX;
1375 mlp_bw_out = glp_mip_col_val(mlp->p.prob, mlpi->c_b);
1376 if (mlp_bw_out > (double) UINT32_MAX)
1378 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1379 mlp_bw_out = (double) UINT32_MAX;
1381 mlp_use = glp_mip_col_val(mlp->p.prob, mlpi->c_n);
1385 * LOG (GNUNET_ERROR_TYPE_INFO, "MLP result address: `%s' `%s' length %u session %u, mlp use %.3f\n",
1386 * GNUNET_i2s(&address->peer), address->plugin,
1387 * address->addr_len, address->session_id);
1390 if (GLP_YES == mlp_use)
1392 /* This address was selected by the solver to be used */
1393 mlpi->n = GNUNET_YES;
1394 if (GNUNET_NO == address->active)
1396 /* Address was not used before, enabling address */
1397 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : enabling address\n",
1398 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1399 address->active = GNUNET_YES;
1400 address->assigned_bw_in = mlp_bw_in;
1401 mlpi->b_in = mlp_bw_in;
1402 address->assigned_bw_out = mlp_bw_out;
1403 mlpi->b_out = mlp_bw_out;
1404 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1405 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1408 else if (GNUNET_YES == address->active)
1410 /* Address was used before, check for bandwidth change */
1411 if ((mlp_bw_out != address->assigned_bw_out) ||
1412 (mlp_bw_in != address->assigned_bw_in))
1414 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : bandwidth changed\n",
1415 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1416 address->assigned_bw_in = mlp_bw_in;
1417 mlpi->b_in = mlp_bw_in;
1418 address->assigned_bw_out = mlp_bw_out;
1419 mlpi->b_out = mlp_bw_out;
1420 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1421 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1428 else if (GLP_NO == mlp_use)
1430 /* This address was selected by the solver to be not used */
1431 mlpi->n = GNUNET_NO;
1432 if (GNUNET_NO == address->active)
1434 /* Address was not used before, nothing to do */
1435 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : no change\n",
1436 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1439 else if (GNUNET_YES == address->active)
1441 /* Address was used before, disabling address */
1442 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : disabling address\n",
1443 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1444 address->active = GNUNET_NO;
1445 /* Set bandwidth to 0 */
1446 address->assigned_bw_in = 0;
1448 address->assigned_bw_out = 0;
1463 notify (struct GAS_MLP_Handle *mlp,
1464 enum GAS_Solver_Operation op,
1465 enum GAS_Solver_Status stat,
1466 enum GAS_Solver_Additional_Information add)
1468 mlp->env->info_cb (mlp->env->cls,
1476 mlp_branch_and_cut_cb (glp_tree *tree, void *info)
1478 struct GAS_MLP_Handle *mlp = info;
1481 switch (glp_ios_reason (tree))
1484 /* Do nothing here */
1487 /* Do nothing here */
1490 /* Do nothing here */
1493 /* Do nothing here */
1496 /* Do nothing here */
1499 /* Do nothing here */
1502 /* A better solution was found */
1503 mlp->ps.mlp_gap = glp_ios_mip_gap (tree);
1504 mlp_obj = glp_mip_obj_val (mlp->p.prob);
1505 mlp->ps.lp_mlp_gap = (abs(mlp_obj - mlp->ps.lp_objective_value)) / (abs(mlp_obj) + DBL_EPSILON);
1507 LOG (GNUNET_ERROR_TYPE_INFO,
1508 "Found better integer solution, current gaps: %.3f <= %.3f, %.3f <= %.3f\n",
1509 mlp->ps.mlp_gap, mlp->pv.mip_gap,
1510 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1512 if (mlp->ps.mlp_gap <= mlp->pv.mip_gap)
1514 LOG (GNUNET_ERROR_TYPE_INFO,
1515 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1516 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1517 glp_ios_terminate (tree);
1520 if (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap)
1522 LOG (GNUNET_ERROR_TYPE_INFO,
1523 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1524 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1525 glp_ios_terminate (tree);
1537 * Solves the MLP problem
1539 * @param solver the MLP Handle
1540 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1543 GAS_mlp_solve_problem (void *solver)
1545 struct GAS_MLP_Handle *mlp = solver;
1551 struct GNUNET_TIME_Absolute start_total;
1552 struct GNUNET_TIME_Absolute start_cur_op;
1553 struct GNUNET_TIME_Relative dur_total;
1554 struct GNUNET_TIME_Relative dur_setup;
1555 struct GNUNET_TIME_Relative dur_lp;
1556 struct GNUNET_TIME_Relative dur_mlp;
1558 GNUNET_assert(NULL != solver);
1560 if (GNUNET_YES == mlp->stat_bulk_lock)
1562 mlp->stat_bulk_requests++;
1565 notify(mlp, GAS_OP_SOLVE_START, GAS_STAT_SUCCESS,
1566 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1567 start_total = GNUNET_TIME_absolute_get();
1569 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->requested_peers))
1571 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1572 return GNUNET_OK; /* No pending requests */
1574 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->env->addresses))
1576 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1577 return GNUNET_OK; /* No addresses available */
1580 if ((GNUNET_NO == mlp->stat_mlp_prob_changed)
1581 && (GNUNET_NO == mlp->stat_mlp_prob_updated))
1583 LOG(GNUNET_ERROR_TYPE_DEBUG, "No changes to problem\n");
1584 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1587 if (GNUNET_YES == mlp->stat_mlp_prob_changed)
1589 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem size changed, rebuilding\n");
1590 notify(mlp, GAS_OP_SOLVE_SETUP_START, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1591 mlp_delete_problem (mlp);
1592 if (GNUNET_SYSERR == mlp_create_problem (mlp))
1594 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_FAIL, GAS_INFO_FULL);
1595 return GNUNET_SYSERR;
1597 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1598 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1600 mlp->control_param_lp.presolve = GLP_YES; /* LP presolver, we need lp solution */
1601 mlp->control_param_mlp.presolve = GNUNET_NO; /* No presolver, we have LP solution */
1605 mlp->control_param_lp.presolve = GNUNET_NO; /* LP presolver, we need lp solution */
1606 mlp->control_param_mlp.presolve = GLP_YES; /* No presolver, we have LP solution */
1607 dur_lp = GNUNET_TIME_UNIT_ZERO;
1612 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem was updated, resolving\n");
1615 /* Reset solution info */
1616 mlp->ps.lp_objective_value = 0.0;
1617 mlp->ps.mlp_gap = 1.0;
1618 mlp->ps.mlp_objective_value = 0.0;
1619 mlp->ps.lp_mlp_gap = 0.0;
1621 dur_setup = GNUNET_TIME_absolute_get_duration (start_total);
1624 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1626 notify(mlp, GAS_OP_SOLVE_MLP_LP_START, GAS_STAT_SUCCESS,
1627 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1628 LOG(GNUNET_ERROR_TYPE_DEBUG,
1629 "Running LP solver %s\n",
1630 (GLP_YES == mlp->control_param_lp.presolve)? "with presolver": "without presolver");
1631 start_cur_op = GNUNET_TIME_absolute_get();
1634 /* Only for debugging:
1635 * Always use LP presolver:
1636 * mlp->control_param_lp.presolve = GLP_YES; */
1637 res_lp = mlp_solve_lp_problem(mlp);
1638 if (GNUNET_OK == res_lp)
1640 mlp->ps.lp_objective_value = glp_get_obj_val (mlp->p.prob);
1641 LOG (GNUNET_ERROR_TYPE_DEBUG,
1642 "LP solution was: %.3f\n",
1643 mlp->ps.lp_objective_value);
1646 dur_lp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1647 notify(mlp, GAS_OP_SOLVE_MLP_LP_STOP,
1648 (GNUNET_OK == res_lp) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1649 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1652 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1655 /* Run MLP solver */
1656 if ((GNUNET_OK == res_lp) || (GNUNET_YES == mlp->opt_dbg_intopt_presolver))
1658 LOG(GNUNET_ERROR_TYPE_DEBUG, "Running MLP solver \n");
1659 notify(mlp, GAS_OP_SOLVE_MLP_MLP_START, GAS_STAT_SUCCESS,
1660 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1661 start_cur_op = GNUNET_TIME_absolute_get();
1665 /* Only for debugging, always use LP presolver */
1666 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1667 mlp->control_param_mlp.presolve = GNUNET_YES;
1669 mip_res = glp_intopt (mlp->p.prob, &mlp->control_param_mlp);
1674 LOG (GNUNET_ERROR_TYPE_INFO,
1675 "Solving MLP problem: %s\n",
1676 mlp_solve_to_string (mip_res));
1678 case GLP_ETMLIM: /* Time limit reached */
1679 case GLP_EMIPGAP: /* MIP gap tolerance limit reached */
1680 case GLP_ESTOP: /* Solver was instructed to stop*/
1681 /* Semi-successful */
1682 LOG (GNUNET_ERROR_TYPE_INFO,
1683 "Solving MLP problem solution was interupted: %s\n",
1684 mlp_solve_to_string (mip_res));
1693 LOG (GNUNET_ERROR_TYPE_INFO,
1694 "Solving MLP problem failed: %s\n",
1695 mlp_solve_to_string (mip_res));
1699 /* Analyze problem status */
1700 mip_status = glp_mip_status(mlp->p.prob);
1703 case GLP_OPT: /* solution is optimal */
1704 LOG (GNUNET_ERROR_TYPE_WARNING,
1705 "Solution of MLP problem is optimal: %s, %s\n",
1706 mlp_solve_to_string (mip_res),
1707 mlp_status_to_string (mip_status));
1708 mip_res = GNUNET_OK;
1710 case GLP_FEAS: /* solution is feasible but not proven optimal */
1712 if ( (mlp->ps.mlp_gap <= mlp->pv.mip_gap) ||
1713 (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap) )
1715 LOG (GNUNET_ERROR_TYPE_INFO,
1716 "Solution of MLP problem is feasible and solution within gap constraints: %s, %s\n",
1717 mlp_solve_to_string (mip_res),
1718 mlp_status_to_string (mip_status));
1719 mip_res = GNUNET_OK;
1723 LOG (GNUNET_ERROR_TYPE_WARNING,
1724 "Solution of MLP problem is feasible but solution not within gap constraints: %s, %s\n",
1725 mlp_solve_to_string (mip_res),
1726 mlp_status_to_string (mip_status));
1727 mip_res = GNUNET_SYSERR;
1730 case GLP_UNDEF: /* Solution undefined */
1731 case GLP_NOFEAS: /* No feasible solution */
1733 LOG (GNUNET_ERROR_TYPE_ERROR,
1734 "Solving MLP problem failed: %s %s\n",
1735 mlp_solve_to_string (mip_res),
1736 mlp_status_to_string (mip_status));
1737 mip_res = GNUNET_SYSERR;
1741 dur_mlp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1742 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1744 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP,
1745 (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1746 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1750 /* Do not execute mip solver since lp solution is invalid */
1751 dur_mlp = GNUNET_TIME_UNIT_ZERO;
1752 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1754 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP, GAS_STAT_FAIL,
1755 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1756 mip_res = GNUNET_SYSERR;
1759 /* Notify about end */
1760 notify(mlp, GAS_OP_SOLVE_STOP,
1761 ((GNUNET_OK == mip_res) && (GNUNET_OK == mip_res)) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1762 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1764 LOG (GNUNET_ERROR_TYPE_DEBUG,
1765 "Execution time for %s solve: (total/setup/lp/mlp) : %llu %llu %llu %llu\n",
1766 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? "full" : "updated",
1767 (unsigned long long) dur_total.rel_value_us,
1768 (unsigned long long) dur_setup.rel_value_us,
1769 (unsigned long long) dur_lp.rel_value_us,
1770 (unsigned long long) dur_mlp.rel_value_us);
1773 mlp->ps.lp_res = res_lp;
1774 mlp->ps.mip_res = mip_res;
1775 mlp->ps.lp_presolv = mlp->control_param_lp.presolve;
1776 mlp->ps.mip_presolv = mlp->control_param_mlp.presolve;
1777 mlp->ps.p_cols = glp_get_num_cols(mlp->p.prob);
1778 mlp->ps.p_rows = glp_get_num_rows(mlp->p.prob);
1779 mlp->ps.p_elements = mlp->p.num_elements;
1781 /* Propagate result*/
1782 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
1783 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1785 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1787 GNUNET_CONTAINER_multipeermap_iterate(mlp->env->addresses,
1788 &mlp_propagate_results, mlp);
1790 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
1791 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1794 struct GNUNET_TIME_Absolute time = GNUNET_TIME_absolute_get();
1795 if ( (GNUNET_YES == mlp->opt_dump_problem_all) ||
1796 (mlp->opt_dump_problem_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1798 /* Write problem to disk */
1799 switch (mlp->opt_log_format) {
1801 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.cplex", mlp->p.num_peers,
1802 mlp->p.num_addresses, time.abs_value_us);
1803 glp_write_lp (mlp->p.prob, NULL, filename);
1806 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.glpk", mlp->p.num_peers,
1807 mlp->p.num_addresses, time.abs_value_us);
1808 glp_write_prob (mlp->p.prob, 0, filename);
1811 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.mps", mlp->p.num_peers,
1812 mlp->p.num_addresses, time.abs_value_us);
1813 glp_write_mps (mlp->p.prob, GLP_MPS_FILE, NULL, filename);
1818 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped problem to file: `%s' \n", filename);
1819 GNUNET_free(filename);
1821 if ( (mlp->opt_dump_solution_all) ||
1822 (mlp->opt_dump_solution_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1824 /* Write solution to disk */
1825 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.sol", mlp->p.num_peers,
1826 mlp->p.num_addresses, time.abs_value_us);
1827 glp_print_mip(mlp->p.prob, filename);
1828 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped solution to file: `%s' \n", filename);
1829 GNUNET_free(filename);
1832 /* Reset change and update marker */
1833 mlp->control_param_lp.presolve = GLP_NO;
1834 mlp->stat_mlp_prob_updated = GNUNET_NO;
1835 mlp->stat_mlp_prob_changed = GNUNET_NO;
1837 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1840 return GNUNET_SYSERR;
1844 * Add a single address to the solve
1846 * @param solver the solver Handle
1847 * @param address the address to add
1848 * @param network network type of this address
1851 GAS_mlp_address_add (void *solver,
1852 struct ATS_Address *address,
1855 struct GAS_MLP_Handle *mlp = solver;
1857 if (GNUNET_ATS_NetworkTypeCount <= network)
1863 if (NULL == address->solver_information)
1865 address->solver_information = GNUNET_new (struct MLP_information);
1868 LOG (GNUNET_ERROR_TYPE_ERROR,
1869 _("Adding address for peer `%s' multiple times\n"),
1870 GNUNET_i2s(&address->peer));
1872 /* Is this peer included in the problem? */
1874 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1877 /* FIXME: should this be an error? */
1878 LOG (GNUNET_ERROR_TYPE_DEBUG,
1879 "Adding address for peer `%s' without address request\n",
1880 GNUNET_i2s(&address->peer));
1884 LOG (GNUNET_ERROR_TYPE_DEBUG,
1885 "Adding address for peer `%s' with address request \n",
1886 GNUNET_i2s(&address->peer));
1887 /* Problem size changed: new address for peer with pending request */
1888 mlp->stat_mlp_prob_changed = GNUNET_YES;
1889 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
1890 GAS_mlp_solve_problem (solver);
1895 * Transport properties for this address have changed
1897 * @param solver solver handle
1898 * @param address the address
1901 GAS_mlp_address_property_changed (void *solver,
1902 struct ATS_Address *address)
1904 struct MLP_information *mlpi = address->solver_information;
1905 struct GAS_MLP_Handle *mlp = solver;
1907 if (NULL == mlp->p.prob)
1908 return; /* There is no MLP problem to update yet */
1912 LOG (GNUNET_ERROR_TYPE_INFO,
1913 _("Updating address property for peer `%s' %p not added before\n"),
1914 GNUNET_i2s (&address->peer),
1920 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1923 /* Peer is not requested, so no need to update problem */
1926 LOG (GNUNET_ERROR_TYPE_DEBUG,
1927 "Updating properties for peer `%s'\n",
1928 GNUNET_i2s(&address->peer));
1930 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
1933 /* Update c7) [r_q[index]][c_b] = f_q * q_averaged[type_index] */
1935 mlp_create_problem_update_value (&mlp->p,
1936 mlp->p.r_q[RQ_QUALITY_METRIC_DELAY],
1938 address->norm_delay.norm,
1941 mlp_create_problem_update_value (&mlp->p,
1942 mlp->p.r_q[RQ_QUALITY_METRIC_DISTANCE],
1944 address->norm_distance.norm,
1947 mlp->stat_mlp_prob_updated = GNUNET_YES;
1948 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
1949 GAS_mlp_solve_problem (solver);
1956 * Find the active address in the set of addresses of a peer
1957 * @param cls destination
1958 * @param key peer id
1959 * @param value address
1960 * @return #GNUNET_OK
1963 mlp_get_preferred_address_it (void *cls,
1964 const struct GNUNET_PeerIdentity *key,
1967 static int counter = 0;
1968 struct ATS_Address **aa = cls;
1969 struct ATS_Address *addr = value;
1970 struct MLP_information *mlpi = addr->solver_information;
1977 * GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
1978 * "MLP [%u] Peer `%s' %s length %u session %u active %s mlp active %s\n",
1979 * counter, GNUNET_i2s (&addr->peer), addr->plugin, addr->addr_len, addr->session_id,
1980 * (GNUNET_YES == addr->active) ? "active" : "inactive",
1981 * (GNUNET_YES == mlpi->n) ? "active" : "inactive");
1984 if (GNUNET_YES == mlpi->n)
1988 (*aa)->assigned_bw_in = mlpi->b_in;
1989 (*aa)->assigned_bw_out = mlpi->b_out;
1998 get_peer_pref_value (struct GAS_MLP_Handle *mlp,
1999 const struct GNUNET_PeerIdentity *peer)
2002 const double *preferences;
2005 preferences = mlp->env->get_preferences (mlp->env->cls, peer);
2007 for (c = 0; c < GNUNET_ATS_PREFERENCE_END; c++)
2009 /* fprintf (stderr, "VALUE[%u] %s %.3f \n",
2010 * c, GNUNET_i2s (&cur->addr->peer), t[c]); */
2011 res += preferences[c];
2014 res /= GNUNET_ATS_PREFERENCE_END;
2017 LOG (GNUNET_ERROR_TYPE_DEBUG,
2018 "Peer preference for peer `%s' == %.2f\n",
2019 GNUNET_i2s(peer), res);
2026 * Get the preferred address for a specific peer
2028 * @param solver the MLP Handle
2029 * @param peer the peer
2032 GAS_mlp_get_preferred_address (void *solver,
2033 const struct GNUNET_PeerIdentity *peer)
2035 struct GAS_MLP_Handle *mlp = solver;
2037 struct ATS_Address *res;
2039 LOG (GNUNET_ERROR_TYPE_DEBUG,
2040 "Getting preferred address for `%s'\n",
2043 /* Is this peer included in the problem? */
2045 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2048 LOG (GNUNET_ERROR_TYPE_INFO, "Adding peer `%s' to list of requested_peers with requests\n",
2051 p = GNUNET_new (struct ATS_Peer);
2053 p->f = get_peer_pref_value (mlp, peer);
2054 GNUNET_CONTAINER_multipeermap_put (mlp->requested_peers,
2056 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
2058 /* Added new peer, we have to rebuild problem before solving */
2059 mlp->stat_mlp_prob_changed = GNUNET_YES;
2061 if ((GNUNET_YES == mlp->opt_mlp_auto_solve)&&
2062 (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains(mlp->env->addresses,
2065 mlp->exclude_peer = peer;
2066 GAS_mlp_solve_problem (mlp);
2067 mlp->exclude_peer = NULL;
2070 /* Get prefered address */
2072 GNUNET_CONTAINER_multipeermap_get_multiple (mlp->env->addresses, peer,
2073 &mlp_get_preferred_address_it, &res);
2075 mlp->env->bandwidth_changed_cb (mlp->env->cls,
2081 * Deletes a single address in the MLP problem
2083 * The MLP problem has to be recreated and the problem has to be resolved
2085 * @param solver the MLP Handle
2086 * @param address the address to delete
2089 GAS_mlp_address_delete (void *solver,
2090 struct ATS_Address *address)
2092 struct GAS_MLP_Handle *mlp = solver;
2093 struct MLP_information *mlpi;
2094 struct ATS_Address *res;
2097 mlpi = address->solver_information;
2100 /* Remove full address */
2102 address->solver_information = NULL;
2104 was_active = address->active;
2105 address->active = GNUNET_NO;
2106 address->assigned_bw_in = 0;
2107 address->assigned_bw_out = 0;
2109 /* Is this peer included in the problem? */
2111 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2114 LOG (GNUNET_ERROR_TYPE_INFO,
2115 "Deleting address for peer `%s' without address request \n",
2116 GNUNET_i2s(&address->peer));
2119 LOG (GNUNET_ERROR_TYPE_INFO,
2120 "Deleting address for peer `%s' with address request \n",
2121 GNUNET_i2s (&address->peer));
2123 /* Problem size changed: new address for peer with pending request */
2124 mlp->stat_mlp_prob_changed = GNUNET_YES;
2125 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2127 GAS_mlp_solve_problem (solver);
2129 if (GNUNET_YES == was_active)
2131 GAS_mlp_get_preferred_address (solver, &address->peer);
2133 GNUNET_CONTAINER_multipeermap_get_multiple (mlp->env->addresses,
2135 &mlp_get_preferred_address_it,
2139 /* No alternative address, disconnecting peer */
2140 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
2147 * Start a bulk operation
2149 * @param solver the solver
2152 GAS_mlp_bulk_start (void *solver)
2154 struct GAS_MLP_Handle *s = solver;
2156 LOG (GNUNET_ERROR_TYPE_DEBUG,
2157 "Locking solver for bulk operation ...\n");
2158 GNUNET_assert (NULL != solver);
2159 s->stat_bulk_lock ++;
2164 GAS_mlp_bulk_stop (void *solver)
2166 struct GAS_MLP_Handle *s = solver;
2168 LOG (GNUNET_ERROR_TYPE_DEBUG,
2169 "Unlocking solver from bulk operation ...\n");
2170 GNUNET_assert (NULL != solver);
2172 if (s->stat_bulk_lock < 1)
2177 s->stat_bulk_lock --;
2179 if (0 < s->stat_bulk_requests)
2181 GAS_mlp_solve_problem (solver);
2182 s->stat_bulk_requests= 0;
2189 * Stop notifying about address and bandwidth changes for this peer
2191 * @param solver the MLP handle
2192 * @param peer the peer
2195 GAS_mlp_stop_get_preferred_address (void *solver,
2196 const struct GNUNET_PeerIdentity *peer)
2198 struct GAS_MLP_Handle *mlp = solver;
2199 struct ATS_Peer *p = NULL;
2201 GNUNET_assert (NULL != solver);
2202 GNUNET_assert (NULL != peer);
2203 if (NULL != (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2205 GNUNET_assert (GNUNET_YES ==
2206 GNUNET_CONTAINER_multipeermap_remove (mlp->requested_peers, peer, p));
2209 mlp->stat_mlp_prob_changed = GNUNET_YES;
2210 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2212 GAS_mlp_solve_problem (solver);
2219 * Changes the preferences for a peer in the MLP problem
2221 * @param solver the MLP Handle
2222 * @param peer the peer
2223 * @param kind the kind to change the preference
2224 * @param pref_rel the relative score
2227 GAS_mlp_address_change_preference (void *solver,
2228 const struct GNUNET_PeerIdentity *peer,
2229 enum GNUNET_ATS_PreferenceKind kind,
2232 struct GAS_MLP_Handle *mlp = solver;
2235 LOG (GNUNET_ERROR_TYPE_DEBUG,
2236 "Changing preference for address for peer `%s' to %.2f\n",
2240 GNUNET_STATISTICS_update (mlp->env->stats,
2241 "# LP address preference changes", 1, GNUNET_NO);
2242 /* Update the constraints with changed preferences */
2246 /* Update relativity constraint c9 */
2247 if (NULL == (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2249 LOG (GNUNET_ERROR_TYPE_INFO,
2250 "Updating preference for unknown peer `%s'\n",
2255 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
2257 p->f = get_peer_pref_value (mlp, peer);
2258 mlp_create_problem_update_value (&mlp->p,
2264 /* Problem size changed: new address for peer with pending request */
2265 mlp->stat_mlp_prob_updated = GNUNET_YES;
2266 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2267 GAS_mlp_solve_problem (solver);
2273 * Get application feedback for a peer
2275 * @param solver the solver handle
2276 * @param application the application
2277 * @param peer the peer to change the preference for
2278 * @param scope the time interval for this feedback: [now - scope .. now]
2279 * @param kind the kind to change the preference
2280 * @param score the score
2283 GAS_mlp_address_preference_feedback (void *solver,
2284 struct GNUNET_SERVER_Client *application,
2285 const struct GNUNET_PeerIdentity *peer,
2286 const struct GNUNET_TIME_Relative scope,
2287 enum GNUNET_ATS_PreferenceKind kind,
2290 struct GAS_PROPORTIONAL_Handle *s = solver;
2292 GNUNET_assert (NULL != solver);
2293 GNUNET_assert (NULL != peer);
2294 GNUNET_assert (NULL != s);
2299 mlp_free_peers (void *cls,
2300 const struct GNUNET_PeerIdentity *key, void *value)
2302 struct GNUNET_CONTAINER_MultiPeerMap *map = cls;
2303 struct ATS_Peer *p = value;
2305 GNUNET_assert (GNUNET_YES ==
2306 GNUNET_CONTAINER_multipeermap_remove (map, key, value));
2314 * Shutdown the MLP problem solving component
2316 * @param cls the solver handle
2320 libgnunet_plugin_ats_mlp_done (void *cls)
2322 struct GNUNET_ATS_SolverFunctions *sf = cls;
2323 struct GAS_MLP_Handle *mlp = sf->cls;
2325 LOG (GNUNET_ERROR_TYPE_DEBUG,
2326 "Shutting down mlp solver\n");
2327 mlp_delete_problem (mlp);
2328 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
2330 mlp->requested_peers);
2331 GNUNET_CONTAINER_multipeermap_destroy (mlp->requested_peers);
2332 mlp->requested_peers = NULL;
2334 /* Clean up GLPK environment */
2338 LOG (GNUNET_ERROR_TYPE_DEBUG,
2339 "Shutdown down of mlp solver complete\n");
2345 libgnunet_plugin_ats_mlp_init (void *cls)
2347 static struct GNUNET_ATS_SolverFunctions sf;
2348 struct GNUNET_ATS_PluginEnvironment *env = cls;
2349 struct GAS_MLP_Handle * mlp = GNUNET_new (struct GAS_MLP_Handle);
2351 unsigned long long tmp;
2357 struct GNUNET_TIME_Relative max_duration;
2358 long long unsigned int max_iterations;
2360 /* Init GLPK environment */
2361 int res = glp_init_env();
2364 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2365 "initialization successful");
2368 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2369 "environment is already initialized");
2372 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2373 "initialization failed (insufficient memory)");
2378 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2379 "initialization failed (unsupported programming model)");
2387 mlp->opt_dump_problem_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2388 "ats", "MLP_DUMP_PROBLEM_ALL");
2389 if (GNUNET_SYSERR == mlp->opt_dump_problem_all)
2390 mlp->opt_dump_problem_all = GNUNET_NO;
2392 mlp->opt_dump_solution_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2393 "ats", "MLP_DUMP_SOLUTION_ALL");
2394 if (GNUNET_SYSERR == mlp->opt_dump_solution_all)
2395 mlp->opt_dump_solution_all = GNUNET_NO;
2397 mlp->opt_dump_problem_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2398 "ats", "MLP_DUMP_PROBLEM_ON_FAIL");
2399 if (GNUNET_SYSERR == mlp->opt_dump_problem_on_fail)
2400 mlp->opt_dump_problem_on_fail = GNUNET_NO;
2402 mlp->opt_dump_solution_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2403 "ats", "MLP_DUMP_SOLUTION_ON_FAIL");
2404 if (GNUNET_SYSERR == mlp->opt_dump_solution_on_fail)
2405 mlp->opt_dump_solution_on_fail = GNUNET_NO;
2407 mlp->opt_dbg_glpk_verbose = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2408 "ats", "MLP_DBG_GLPK_VERBOSE");
2409 if (GNUNET_SYSERR == mlp->opt_dbg_glpk_verbose)
2410 mlp->opt_dbg_glpk_verbose = GNUNET_NO;
2412 mlp->opt_dbg_feasibility_only = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2413 "ats", "MLP_DBG_FEASIBILITY_ONLY");
2414 if (GNUNET_SYSERR == mlp->opt_dbg_feasibility_only)
2415 mlp->opt_dbg_feasibility_only = GNUNET_NO;
2416 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
2417 LOG (GNUNET_ERROR_TYPE_WARNING,
2418 "MLP solver is configured to check feasibility only!\n");
2420 mlp->opt_dbg_autoscale_problem = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2421 "ats", "MLP_DBG_AUTOSCALE_PROBLEM");
2422 if (GNUNET_SYSERR == mlp->opt_dbg_autoscale_problem)
2423 mlp->opt_dbg_autoscale_problem = GNUNET_NO;
2424 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
2425 LOG (GNUNET_ERROR_TYPE_WARNING,
2426 "MLP solver is configured automatically scale the problem!\n");
2428 mlp->opt_dbg_intopt_presolver = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2429 "ats", "MLP_DBG_INTOPT_PRESOLVE");
2430 if (GNUNET_SYSERR == mlp->opt_dbg_intopt_presolver)
2431 mlp->opt_dbg_intopt_presolver = GNUNET_NO;
2432 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
2433 LOG (GNUNET_ERROR_TYPE_WARNING,
2434 "MLP solver is configured use the mlp presolver\n");
2436 mlp->opt_dbg_optimize_diversity = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2437 "ats", "MLP_DBG_OPTIMIZE_DIVERSITY");
2438 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_diversity)
2439 mlp->opt_dbg_optimize_diversity = GNUNET_YES;
2440 if (GNUNET_NO == mlp->opt_dbg_optimize_diversity)
2441 LOG (GNUNET_ERROR_TYPE_WARNING,
2442 "MLP solver is not optimizing for diversity\n");
2444 mlp->opt_dbg_optimize_relativity= GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2445 "ats", "MLP_DBG_OPTIMIZE_RELATIVITY");
2446 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_relativity)
2447 mlp->opt_dbg_optimize_relativity = GNUNET_YES;
2448 if (GNUNET_NO == mlp->opt_dbg_optimize_relativity)
2449 LOG (GNUNET_ERROR_TYPE_WARNING,
2450 "MLP solver is not optimizing for relativity\n");
2452 mlp->opt_dbg_optimize_quality = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2453 "ats", "MLP_DBG_OPTIMIZE_QUALITY");
2454 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_quality)
2455 mlp->opt_dbg_optimize_quality = GNUNET_YES;
2456 if (GNUNET_NO == mlp->opt_dbg_optimize_quality)
2457 LOG (GNUNET_ERROR_TYPE_WARNING,
2458 "MLP solver is not optimizing for quality\n");
2460 mlp->opt_dbg_optimize_utility = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2461 "ats", "MLP_DBG_OPTIMIZE_UTILITY");
2462 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_utility)
2463 mlp->opt_dbg_optimize_utility = GNUNET_YES;
2464 if (GNUNET_NO == mlp->opt_dbg_optimize_utility)
2465 LOG (GNUNET_ERROR_TYPE_WARNING,
2466 "MLP solver is not optimizing for utility\n");
2468 if ( (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2469 (GNUNET_NO == mlp->opt_dbg_optimize_quality) &&
2470 (GNUNET_NO == mlp->opt_dbg_optimize_relativity) &&
2471 (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2472 (GNUNET_NO == mlp->opt_dbg_feasibility_only))
2474 LOG (GNUNET_ERROR_TYPE_ERROR,
2475 _("MLP solver is not optimizing for anything, changing to feasibility check\n"));
2476 mlp->opt_dbg_feasibility_only = GNUNET_YES;
2479 if (GNUNET_SYSERR == GNUNET_CONFIGURATION_get_value_string (env->cfg,
2480 "ats", "MLP_LOG_FORMAT", &outputformat))
2481 mlp->opt_log_format = MLP_CPLEX;
2484 GNUNET_STRINGS_utf8_toupper(outputformat, outputformat);
2485 if (0 == strcmp (outputformat, "MPS"))
2487 mlp->opt_log_format = MLP_MPS;
2489 else if (0 == strcmp (outputformat, "CPLEX"))
2491 mlp->opt_log_format = MLP_CPLEX;
2493 else if (0 == strcmp (outputformat, "GLPK"))
2495 mlp->opt_log_format = MLP_GLPK;
2499 LOG (GNUNET_ERROR_TYPE_WARNING,
2500 "Invalid log format `%s' in configuration, using CPLEX!\n",
2502 mlp->opt_log_format = MLP_CPLEX;
2504 GNUNET_free (outputformat);
2507 mlp->pv.BIG_M = (double) BIG_M_VALUE;
2509 mlp->pv.mip_gap = (double) 0.0;
2510 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2511 "MLP_MAX_MIP_GAP", &f_tmp))
2513 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2515 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2520 mlp->pv.mip_gap = f_tmp;
2521 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s of %.3f\n",
2526 mlp->pv.lp_mip_gap = (double) 0.0;
2527 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2528 "MLP_MAX_LP_MIP_GAP", &f_tmp))
2530 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2532 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2537 mlp->pv.lp_mip_gap = f_tmp;
2538 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2543 /* Get timeout for iterations */
2544 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_time(env->cfg, "ats",
2545 "MLP_MAX_DURATION", &max_duration))
2547 max_duration = MLP_MAX_EXEC_DURATION;
2550 /* Get maximum number of iterations */
2551 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_size(env->cfg, "ats",
2552 "MLP_MAX_ITERATIONS", &max_iterations))
2554 max_iterations = MLP_MAX_ITERATIONS;
2557 /* Get diversity coefficient from configuration */
2558 mlp->pv.co_D = MLP_DEFAULT_D;
2559 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2560 "MLP_COEFFICIENT_D", &f_tmp))
2564 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2565 "MLP_COEFFICIENT_D", f_tmp);
2569 mlp->pv.co_D = f_tmp;
2570 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2571 "MLP_COEFFICIENT_D", f_tmp);
2575 /* Get relativity coefficient from configuration */
2576 mlp->pv.co_R = MLP_DEFAULT_R;
2577 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2578 "MLP_COEFFICIENT_R", &f_tmp))
2582 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2583 "MLP_COEFFICIENT_R", f_tmp);
2587 mlp->pv.co_R = f_tmp;
2588 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2589 "MLP_COEFFICIENT_R", f_tmp);
2594 /* Get utilization coefficient from configuration */
2595 mlp->pv.co_U = MLP_DEFAULT_U;
2596 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2597 "MLP_COEFFICIENT_U", &f_tmp))
2601 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2602 "MLP_COEFFICIENT_U", f_tmp);
2606 mlp->pv.co_U = f_tmp;
2607 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2608 "MLP_COEFFICIENT_U", f_tmp);
2612 /* Get quality metric coefficients from configuration */
2613 for (c = 0; c < RQ_QUALITY_METRIC_COUNT; c++)
2615 /* initialize quality coefficients with default value 1.0 */
2616 mlp->pv.co_Q[c] = MLP_DEFAULT_QUALITY;
2621 GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2622 "MLP_COEFFICIENT_QUALITY_DELAY",
2624 mlp->pv.co_Q[RQ_QUALITY_METRIC_DELAY] = (double) tmp / 100;
2626 mlp->pv.co_Q[RQ_QUALITY_METRIC_DELAY] = MLP_DEFAULT_QUALITY;
2629 GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2630 "MLP_COEFFICIENT_QUALITY_DISTANCE",
2632 mlp->pv.co_Q[RQ_QUALITY_METRIC_DISTANCE] = (double) tmp / 100;
2634 mlp->pv.co_Q[RQ_QUALITY_METRIC_DISTANCE] = MLP_DEFAULT_QUALITY;
2636 /* Get minimum bandwidth per used address from configuration */
2637 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2638 "MLP_MIN_BANDWIDTH",
2643 b_min = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
2646 /* Get minimum number of connections from configuration */
2647 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2648 "MLP_MIN_CONNECTIONS",
2652 n_min = MLP_DEFAULT_MIN_CONNECTIONS;
2654 /* Init network quotas */
2655 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
2657 mlp->pv.quota_index[c] = c;
2658 mlp->pv.quota_out[c] = env->out_quota[c];
2659 mlp->pv.quota_in[c] = env->in_quota[c];
2661 LOG (GNUNET_ERROR_TYPE_INFO,
2662 "Quota for network `%s' (in/out) %llu/%llu\n",
2663 GNUNET_ATS_print_network_type (c),
2664 mlp->pv.quota_out[c],
2665 mlp->pv.quota_in[c]);
2666 /* Check if defined quota could make problem unsolvable */
2667 if ((n_min * b_min) > mlp->pv.quota_out[c])
2669 LOG (GNUNET_ERROR_TYPE_INFO,
2670 _("Adjusting inconsistent outbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2671 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2672 mlp->pv.quota_out[c],
2674 mlp->pv.quota_out[c] = (n_min * b_min);
2676 if ((n_min * b_min) > mlp->pv.quota_in[c])
2678 LOG (GNUNET_ERROR_TYPE_INFO,
2679 _("Adjusting inconsistent inbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2680 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2681 mlp->pv.quota_in[c],
2683 mlp->pv.quota_in[c] = (n_min * b_min);
2685 /* Check if bandwidth is too big to make problem solvable */
2686 if (mlp->pv.BIG_M < mlp->pv.quota_out[c])
2688 LOG (GNUNET_ERROR_TYPE_INFO,
2689 _("Adjusting outbound quota configuration for network `%s'from %llu to %.0f\n"),
2690 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2691 mlp->pv.quota_out[c],
2693 mlp->pv.quota_out[c] = mlp->pv.BIG_M ;
2695 if (mlp->pv.BIG_M < mlp->pv.quota_in[c])
2697 LOG (GNUNET_ERROR_TYPE_INFO,
2698 _("Adjusting inbound quota configuration for network `%s' from %llu to %.0f\n"),
2699 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2700 mlp->pv.quota_in[c],
2702 mlp->pv.quota_in[c] = mlp->pv.BIG_M ;
2707 sf.s_add = &GAS_mlp_address_add;
2708 sf.s_address_update_property = &GAS_mlp_address_property_changed;
2709 sf.s_get = &GAS_mlp_get_preferred_address;
2710 sf.s_get_stop = &GAS_mlp_stop_get_preferred_address;
2711 sf.s_pref = &GAS_mlp_address_change_preference;
2712 sf.s_feedback = &GAS_mlp_address_preference_feedback;
2713 sf.s_del = &GAS_mlp_address_delete;
2714 sf.s_bulk_start = &GAS_mlp_bulk_start;
2715 sf.s_bulk_stop = &GAS_mlp_bulk_stop;
2717 /* Setting MLP Input variables */
2718 mlp->pv.b_min = b_min;
2719 mlp->pv.n_min = n_min;
2720 mlp->pv.m_q = RQ_QUALITY_METRIC_COUNT;
2721 mlp->stat_mlp_prob_changed = GNUNET_NO;
2722 mlp->stat_mlp_prob_updated = GNUNET_NO;
2723 mlp->opt_mlp_auto_solve = GNUNET_YES;
2724 mlp->requested_peers = GNUNET_CONTAINER_multipeermap_create (10, GNUNET_NO);
2725 mlp->stat_bulk_requests = 0;
2726 mlp->stat_bulk_lock = 0;
2729 /* Redirect GLPK output to GNUnet logging */
2730 glp_term_hook (&mlp_term_hook, (void *) mlp);
2732 /* Init LP solving parameters */
2733 glp_init_smcp(&mlp->control_param_lp);
2734 mlp->control_param_lp.msg_lev = GLP_MSG_OFF;
2735 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2736 mlp->control_param_lp.msg_lev = GLP_MSG_ALL;
2738 mlp->control_param_lp.it_lim = max_iterations;
2739 mlp->control_param_lp.tm_lim = max_duration.rel_value_us / 1000LL;
2741 /* Init MLP solving parameters */
2742 glp_init_iocp(&mlp->control_param_mlp);
2743 /* Setting callback function */
2744 mlp->control_param_mlp.cb_func = &mlp_branch_and_cut_cb;
2745 mlp->control_param_mlp.cb_info = mlp;
2746 mlp->control_param_mlp.msg_lev = GLP_MSG_OFF;
2747 mlp->control_param_mlp.mip_gap = mlp->pv.mip_gap;
2748 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2749 mlp->control_param_mlp.msg_lev = GLP_MSG_ALL;
2750 mlp->control_param_mlp.tm_lim = max_duration.rel_value_us / 1000LL;
2752 LOG (GNUNET_ERROR_TYPE_DEBUG, "solver ready\n");
2757 /* end of plugin_ats_mlp.c */