2 This file is part of GNUnet.
3 (C) 2011-2014 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/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
72 double lp_objective_value;
73 double mlp_objective_value;
88 struct GNUNET_PeerIdentity id;
90 /* Was this peer already added to the current problem? */
93 /* constraint 2: 1 address per peer*/
96 /* constraint 9: relativity */
99 /* Legacy preference value */
106 * GLPK (MLP) problem object
110 /* Number of addresses in problem */
111 unsigned int num_addresses;
112 /* Number of peers in problem */
113 unsigned int num_peers;
114 /* Number of elements in problem matrix */
115 unsigned int num_elements;
117 /* Row index constraint 2: */
119 /* Row index constraint 4: minimum connections */
121 /* Row index constraint 6: maximize diversity */
123 /* Row index constraint 8: utilization*/
125 /* Row index constraint 9: relativity*/
127 /* Row indices quality metrics */
128 int r_q[GNUNET_ATS_QualityPropertiesCount];
129 /* Row indices ATS network quotas */
130 int r_quota[GNUNET_ATS_NetworkTypeCount];
132 /* Column index Diversity (D) column */
134 /* Column index Utilization (U) column */
136 /* Column index Proportionality (R) column */
138 /* Column index quality metrics */
139 int c_q[GNUNET_ATS_QualityPropertiesCount];
144 /* Row index array */
146 /* Column index array */
148 /* Column index value */
155 /* Big M value for bandwidth capping */
164 /* ATS Quality metrics
166 * Array with GNUNET_ATS_QualityPropertiesCount elements
167 * contains mapping to GNUNET_ATS_Property*/
168 int q[GNUNET_ATS_QualityPropertiesCount];
170 /* Number of quality metrics */
173 /* Number of quality metrics */
176 /* Quality metric coefficients*/
177 double co_Q[GNUNET_ATS_QualityPropertiesCount];
179 /* Ressource costs coefficients*/
180 double co_RC[GNUNET_ATS_QualityPropertiesCount];
182 /* Diversity coefficient */
185 /* Utility coefficient */
188 /* Relativity coefficient */
191 /* Minimum bandwidth assigned to an address */
194 /* Minimum number of addresses with bandwidth assigned */
198 /* Array mapping array index to ATS network */
199 int quota_index[GNUNET_ATS_NetworkTypeCount];
200 /* Outbound quotas */
201 unsigned long long quota_out[GNUNET_ATS_NetworkTypeCount];
204 unsigned long long quota_in[GNUNET_ATS_NetworkTypeCount];
206 /* ATS ressource costs
207 * array with GNUNET_ATS_QualityPropertiesCount elements
208 * contains mapping to GNUNET_ATS_Property
210 int rc[GNUNET_ATS_QualityPropertiesCount];
217 struct GAS_MLP_Handle
219 struct GNUNET_ATS_PluginEnvironment *env;
222 * Exclude peer from next result propagation
224 const struct GNUNET_PeerIdentity *exclude_peer;
227 * Encapsulation for the MLP problem
229 struct MLP_Problem p;
232 * Encapsulation for the MLP problem variables
234 struct MLP_Variables pv;
237 * Encapsulation for the MLP solution
239 struct MLP_Solution ps;
247 * Number of changes while solver was locked
249 int stat_bulk_requests;
252 * GLPK LP control parameter
254 glp_smcp control_param_lp;
257 * GLPK LP control parameter
259 glp_iocp control_param_mlp;
262 * Peers with pending address requests
264 struct GNUNET_CONTAINER_MultiPeerMap *requested_peers;
267 * Was the problem updated since last solution
269 int stat_mlp_prob_updated;
272 * Has the problem size changed since last solution
274 int stat_mlp_prob_changed;
277 * Solve the problem automatically when updates occur?
278 * Default: GNUNET_YES
279 * Can be disabled for test and measurements
281 int opt_mlp_auto_solve;
284 * Write all MILP problems to a MPS file
286 int opt_dump_problem_all;
289 * Write all MILP problem solutions to a file
291 int opt_dump_solution_all;
294 * Write MILP problems to a MPS file when solver fails
296 int opt_dump_problem_on_fail;
299 * Write MILP problem solutions to a file when solver fails
301 int opt_dump_solution_on_fail;
304 * solve feasibility only
306 int opt_dbg_feasibility_only;
309 * solve autoscale the problem
311 int opt_dbg_autoscale_problem;
314 * use the intopt presolver instead of simplex
316 int opt_dbg_intopt_presolver;
321 int opt_dbg_glpk_verbose;
324 * solve autoscale the problem
326 int opt_dbg_optimize_relativity;
329 * solve autoscale the problem
331 int opt_dbg_optimize_diversity;
334 * solve autoscale the problem
336 int opt_dbg_optimize_quality;
339 * solve autoscale the problem
341 int opt_dbg_optimize_utility;
347 enum MLP_Output_Format opt_log_format;
351 * Address specific MLP information
353 struct MLP_information
357 * Bandwidth assigned outbound
362 * Bandwidth assigned inbound
372 * bandwidth column index
377 * address usage column
384 * constraint 1: bandwidth capping
389 * constraint 3: minimum bandwidth
398 * NOTE: Do not modify this documentation. This documentation is based on
399 * gnunet.org:/vcs/fsnsg/ats-paper.git/tech-doku/ats-tech-guide.tex
400 * use build_txt.sh to generate plaintext output
402 * The MLP solver (mlp) tries to finds an optimal bandwidth assignmentby
403 * optimizing an mixed integer programming problem. The MLP solver uses a
404 * number of constraints to find the best adddress for a peer and an optimal
405 * bandwidth assignment. mlp uses the GNU Linear Programming Kit to solve the
408 * We defined a constraint system to find an optimal bandwidth assignment.
409 * This constraint system uses as an input data addresses, bandwidth quotas,
410 * preferences and quality values. This constraint system is stored in an
411 * matrix based equotation system.
415 * A (M)LP problem consists of a target function to optimizes, constraints
416 * and rows and columns. FIXME GLP uses three arrays to index the matrix: two
417 * integer arrays storing the row and column indices in the matrix and an
418 * float array to store the coeeficient.
420 * To solve the problem we first find an initial solution for the LP problem
421 * using the LP solver and then find an MLP solution based on this solution
422 * using the MLP solver.
424 * Solving (M)LP problems has the property that finding an initial solution
425 * for the LP problem is computationally expensive and finding the MLP
426 * solution is cheaper. This is especially interesting an existing LP
427 * solution can be reused if only coefficients in the matrix have changed
428 * (addresses updated). Only when the problem size changes (addresses added
429 * or deleted) a new LP solution has to be found.
432 * The mlp solver solves the bandwidth assignment problem only on demand when
433 * an address suggestion is requested. When an address is requested mlp the
434 * solves the mlp problem and if the active address or the bandwidth assigned
435 * changes it calls the callback to addresses. The mlp solver gets notified
436 * about new addresses (adding sessions), removed addresses (address
437 * deletions) and address updates. To benefit from the mlp properties
438 * mentioned in section 5 the solver rembers if since the last solution
439 * addresses were added or deleted (problem size changed, problem has to be
440 * rebuild and solved from sratch) or if addresses were updated and the
441 * existing solution can be reused.
445 * The quotas for each network segment are passed by addresses. MLP can be
446 * adapted using configuration settings and uses the following parameters:
447 * * MLP_MAX_DURATION:
448 * Maximum duration for a MLP solution procees (default: 3 sec.)
449 * * MLP_MAX_ITERATIONS:
450 * Maximum number of iterations for a MLP solution process (default:
452 * * MLP_MIN_CONNECTIONS:
453 * Minimum number of desired connections (default: 4)
454 * * MLP_MIN_BANDWIDTH:
455 * Minimum amount of bandwidth assigned to an address (default: 1024)
456 * * MLP_COEFFICIENT_D:
457 * Diversity coefficient (default: 1.0)
458 * * MLP_COEFFICIENT_R:
459 * Relativity coefficient (default: 1.0)
460 * * MLP_COEFFICIENT_U:
461 * Utilization coefficient (default: 1.0)
462 * * MLP_COEFFICIENT_D:
463 * Diversity coefficient (default: 1.0)
464 * * MLP_COEFFICIENT_QUALITY_DELAY:
465 * Quality delay coefficient (default: 1.0)
466 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
467 * Quality distance coefficient (default: 1.0)
468 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
469 * Quality distance coefficient (default: 1.0)
470 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
471 * Quality distance coefficient (default: 1.0)
472 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
473 * Quality distance coefficient (default: 1.0)
475 * 5.2 Data structures used
477 * mlp has for each known peer a struct ATS_Peer containing information about
478 * a specific peer. The address field solver_information contains information
479 * about the mlp properties of this address.
483 * During initialization mlp initializes the GLPK libray used to solve the
484 * MLP problem: it initializes the glpk environment and creates an initial LP
485 * problem. Next it loads the configuration values from the configuration or
486 * uses the default values configured in -addresses_mlp.h. The quotas used
487 * are given by addresses but may have to be adjusted. mlp uses a upper limit
488 * for the bandwidth assigned called BIG M and a minimum amount of bandwidth
489 * an address gets assigned as well as a minium desired number of
490 * connections. If the configured quota is bigger than BIG M, it is reduced
491 * to BIG M. If the configured quota is smaller than MLP_MIN_CONNECTIONS
492 * *MLP_MIN_BANDWIDTH it is increased to this value.
498 #define LOG(kind,...) GNUNET_log_from (kind, "ats-mlp",__VA_ARGS__)
501 * Print debug output for mlp problem creation
503 #define DEBUG_MLP_PROBLEM_CREATION GNUNET_NO
507 * Intercept GLPK terminal output
508 * @param info the mlp handle
509 * @param s the string to print
510 * @return 0: glpk prints output on terminal, 0 != surpress output
513 mlp_term_hook (void *info, const char *s)
515 struct GAS_MLP_Handle *mlp = info;
517 if (mlp->opt_dbg_glpk_verbose)
518 LOG (GNUNET_ERROR_TYPE_ERROR, "%s", s);
524 * Reset peers for next problem creation
526 * @param cls not used
528 * @param value ATS_Peer
532 reset_peers (void *cls,
533 const struct GNUNET_PeerIdentity *key,
536 struct ATS_Peer *peer = value;
537 peer->processed = GNUNET_NO;
542 * Delete the MLP problem and free the constrain matrix
544 * @param mlp the MLP handle
547 mlp_delete_problem (struct GAS_MLP_Handle *mlp)
552 if (mlp->p.prob != NULL)
554 glp_delete_prob(mlp->p.prob);
558 /* delete row index */
559 if (mlp->p.ia != NULL)
561 GNUNET_free (mlp->p.ia);
565 /* delete column index */
566 if (mlp->p.ja != NULL)
568 GNUNET_free (mlp->p.ja);
572 /* delete coefficients */
573 if (mlp->p.ar != NULL)
575 GNUNET_free (mlp->p.ar);
581 mlp->p.c_d = MLP_UNDEFINED;
582 mlp->p.c_r = MLP_UNDEFINED;
583 mlp->p.r_c2 = MLP_UNDEFINED;
584 mlp->p.r_c4 = MLP_UNDEFINED;
585 mlp->p.r_c6 = MLP_UNDEFINED;
586 mlp->p.r_c9 = MLP_UNDEFINED;
587 for (c = 0; c < mlp->pv.m_q ; c ++)
588 mlp->p.r_q[c] = MLP_UNDEFINED;
589 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c ++)
590 mlp->p.r_quota[c] = MLP_UNDEFINED;
591 mlp->p.ci = MLP_UNDEFINED;
594 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
600 * Translate ATS properties to text
601 * Just intended for debugging
603 * @param ats_index the ATS index
604 * @return string with result
607 mlp_ats_to_string (int ats_index)
610 case GNUNET_ATS_ARRAY_TERMINATOR:
611 return "GNUNET_ATS_ARRAY_TERMINATOR";
612 case GNUNET_ATS_UTILIZATION_OUT:
613 return "GNUNET_ATS_UTILIZATION_OUT";
614 case GNUNET_ATS_UTILIZATION_IN:
615 return "GNUNET_ATS_UTILIZATION_IN";
616 case GNUNET_ATS_UTILIZATION_PAYLOAD_OUT:
617 return "GNUNET_ATS_UTILIZATION_PAYLOAD_OUT";
618 case GNUNET_ATS_UTILIZATION_PAYLOAD_IN:
619 return "GNUNET_ATS_UTILIZATION_PAYLOAD_IN";
620 case GNUNET_ATS_COST_LAN:
621 return "GNUNET_ATS_COST_LAN";
622 case GNUNET_ATS_COST_WAN:
623 return "GNUNET_ATS_COST_LAN";
624 case GNUNET_ATS_COST_WLAN:
625 return "GNUNET_ATS_COST_WLAN";
626 case GNUNET_ATS_NETWORK_TYPE:
627 return "GNUNET_ATS_NETWORK_TYPE";
628 case GNUNET_ATS_QUALITY_NET_DELAY:
629 return "GNUNET_ATS_QUALITY_NET_DELAY";
630 case GNUNET_ATS_QUALITY_NET_DISTANCE:
631 return "GNUNET_ATS_QUALITY_NET_DISTANCE";
639 * Translate glpk status error codes to text
640 * @param retcode return code
641 * @return string with result
644 mlp_status_to_string (int retcode)
648 return "solution is undefined";
650 return "solution is feasible";
652 return "solution is infeasible";
654 return "no feasible solution exists";
656 return "solution is optimal";
658 return "solution is unbounded";
661 return "unknown error";
667 * Translate glpk solver error codes to text
668 * @param retcode return code
669 * @return string with result
672 mlp_solve_to_string (int retcode)
678 return "invalid basis";
680 return "singular matrix";
682 return "ill-conditioned matrix";
684 return "invalid bounds";
686 return "solver failed";
688 return "objective lower limit reached";
690 return "objective upper limit reached";
692 return "iteration limit exceeded";
694 return "time limit exceeded";
696 return "no primal feasible solution";
698 return "no dual feasible solution";
700 return "root LP optimum not provided";
702 return "search terminated by application";
704 return "relative mip gap tolerance reached";
706 return "no dual feasible solution";
708 return "no convergence";
710 return "numerical instability";
712 return "invalid data";
714 return "result out of range";
717 return "unknown error";
722 * Extract an ATS performance info from an address
724 * @param address the address
725 * @param type the type to extract in HBO
726 * @return the value in HBO or GNUNET_ATS_VALUE_UNDEFINED in HBO if value does not exist
729 get_performance_info (struct ATS_Address *address, uint32_t type)
732 GNUNET_assert (NULL != address);
734 if ((NULL == address->atsi) || (0 == address->atsi_count))
735 return GNUNET_ATS_VALUE_UNDEFINED;
737 for (c1 = 0; c1 < address->atsi_count; c1++)
739 if (ntohl (address->atsi[c1].type) == type)
740 return ntohl (address->atsi[c1].value);
742 return GNUNET_ATS_VALUE_UNDEFINED;
748 const struct GNUNET_CONTAINER_MultiPeerMap *map;
753 mlp_create_problem_count_addresses_it (void *cls,
754 const struct GNUNET_PeerIdentity *key,
757 struct CountContext *cctx = cls;
759 /* Check if we have to add this peer due to a pending request */
760 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
767 mlp_create_problem_count_addresses (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
768 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
770 struct CountContext cctx;
772 cctx.map = requested_peers;
774 GNUNET_CONTAINER_multipeermap_iterate (addresses,
775 &mlp_create_problem_count_addresses_it, &cctx);
781 mlp_create_problem_count_peers_it (void *cls,
782 const struct GNUNET_PeerIdentity *key,
785 struct CountContext *cctx = cls;
787 /* Check if we have to addresses for the requested peer */
788 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
795 mlp_create_problem_count_peers (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
796 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
798 struct CountContext cctx;
800 cctx.map = addresses;
802 GNUNET_CONTAINER_multipeermap_iterate (requested_peers,
803 &mlp_create_problem_count_peers_it, &cctx);
809 * Updates an existing value in the matrix
811 * Extract the row, updates the value and updates the row in the problem
813 * @param p the mlp problem
814 * @param row the row to create the value in
815 * @param col the column to create the value in
816 * @param val the value to set
817 * @param line calling line for debbuging
818 * @return GNUNET_YES value changed, GNUNET_NO value did not change, GNUNET_SYSERR
822 mlp_create_problem_update_value (struct MLP_Problem *p,
823 int row, int col, double val,
834 GNUNET_assert (NULL != p);
835 GNUNET_assert (NULL != p->prob);
837 /* Get number of columns and prepare data structure */
838 c_cols = glp_get_num_cols(p->prob);
840 return GNUNET_SYSERR;
842 val_array = GNUNET_malloc ((c_cols +1)* sizeof (double));
843 GNUNET_assert (NULL != val_array);
844 ind_array = GNUNET_malloc ((c_cols+1) * sizeof (int));
845 GNUNET_assert (NULL != ind_array);
846 /* Extract the row */
848 /* Update the value */
849 c_elems = glp_get_mat_row (p->prob, row, ind_array, val_array);
851 for (c1 = 1; c1 < (c_elems+1); c1++)
853 if (ind_array[c1] == col)
859 if (GNUNET_NO == found)
861 ind_array[c_elems+1] = col;
862 val_array[c_elems+1] = val;
863 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Setting value in [%s : %s] to `%.2f'\n",
864 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
866 glp_set_mat_row (p->prob, row, c_elems+1, ind_array, val_array);
867 GNUNET_free (ind_array);
868 GNUNET_free (val_array);
874 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Updating value in [%s : %s] from `%.2f' to `%.2f'\n",
875 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
877 if (val != val_array[c1])
882 /* Update the row in the matrix */
883 glp_set_mat_row (p->prob, row, c_elems, ind_array, val_array);
886 GNUNET_free (ind_array);
887 GNUNET_free (val_array);
892 * Creates a new value in the matrix
894 * Sets the row and column index in the problem array and increments the
897 * @param p the mlp problem
898 * @param row the row to create the value in
899 * @param col the column to create the value in
900 * @param val the value to set
901 * @param line calling line for debbuging
904 mlp_create_problem_set_value (struct MLP_Problem *p,
905 int row, int col, double val,
908 if ((p->ci) >= p->num_elements)
910 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Request for index %u bigger than array size of %u\n",
911 line, p->ci + 1, p->num_elements);
915 if ((0 == row) || (0 == col))
918 LOG (GNUNET_ERROR_TYPE_ERROR, "[P]: Invalid call from line %u: row = %u, col = %u\n",
924 #if DEBUG_MLP_PROBLEM_CREATION
925 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Set value [%u,%u] in index %u == %.2f\n",
926 line, p->ia[p->ci], p->ja[p->ci], p->ci, p->ar[p->ci]);
932 mlp_create_problem_create_column (struct MLP_Problem *p, char *name,
933 unsigned int type, unsigned int bound, double lb, double ub,
936 int col = glp_add_cols (p->prob, 1);
937 glp_set_col_name (p->prob, col, name);
938 glp_set_col_bnds (p->prob, col, bound, lb, ub);
939 glp_set_col_kind (p->prob, col, type);
940 glp_set_obj_coef (p->prob, col, coef);
941 #if DEBUG_MLP_PROBLEM_CREATION
942 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added column [%u] `%s': %.2f\n",
949 mlp_create_problem_create_constraint (struct MLP_Problem *p, char *name,
950 unsigned int bound, double lb, double ub)
953 int row = glp_add_rows (p->prob, 1);
955 glp_set_row_name (p->prob, row, name);
956 /* set row bounds: <= 0 */
957 glp_set_row_bnds (p->prob, row, bound, lb, ub);
961 GNUNET_asprintf(&op, "-inf <= x <= %.2f", ub);
964 GNUNET_asprintf(&op, "%.2f <= x <= %.2f", lb, ub);
967 GNUNET_asprintf(&op, "%.2f == x == %.2f", lb, ub);
970 GNUNET_asprintf(&op, "%.2f <= x <= inf", lb);
973 GNUNET_asprintf(&op, "ERROR");
976 #if DEBUG_MLP_PROBLEM_CREATION
977 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added row [%u] `%s': %s\n",
986 * - address columns b and n
987 * - address dependent constraint rows c1, c3
988 * - peer dependent rows c2 and c9
989 * - Set address dependent entries in problem matrix as well
992 mlp_create_problem_add_address_information (void *cls,
993 const struct GNUNET_PeerIdentity *key,
996 struct GAS_MLP_Handle *mlp = cls;
997 struct MLP_Problem *p = &mlp->p;
998 struct ATS_Address *address = value;
999 struct ATS_Peer *peer;
1000 struct MLP_information *mlpi;
1002 const double *props;
1006 uint32_t addr_net_index;
1007 unsigned long long max_quota;
1010 /* Check if we have to add this peer due to a pending request */
1011 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains(mlp->requested_peers, key))
1014 mlpi = address->solver_information;
1017 fprintf (stderr, "%s %p\n",GNUNET_i2s (&address->peer), address);
1022 addr_net = get_performance_info (address, GNUNET_ATS_NETWORK_TYPE);
1023 for (addr_net_index = 0; addr_net_index < GNUNET_ATS_NetworkTypeCount; addr_net_index++)
1025 if (mlp->pv.quota_index[addr_net_index] == addr_net)
1029 if (addr_net_index >= GNUNET_ATS_NetworkTypeCount)
1036 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1038 if (mlp->pv.quota_out[c] > max_quota)
1039 max_quota = mlp->pv.quota_out[c];
1040 if (mlp->pv.quota_in[c] > max_quota)
1041 max_quota = mlp->pv.quota_in[c];
1043 if (max_quota > mlp->pv.BIG_M)
1044 cur_bigm = (double) mlp->pv.BIG_M;
1046 cur_bigm = max_quota;
1050 peer = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, key);
1051 GNUNET_assert (NULL != peer);
1052 if (peer->processed == GNUNET_NO)
1054 /* Add peer dependent constraints */
1055 /* Add c2) One address active per peer */
1056 GNUNET_asprintf(&name, "c2_%s", GNUNET_i2s(&address->peer));
1057 peer->r_c2 = mlp_create_problem_create_constraint (p, name, GLP_FX, 1.0, 1.0);
1059 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1061 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1063 /* Add c9) Relativity */
1064 GNUNET_asprintf(&name, "c9_%s", GNUNET_i2s(&address->peer));
1065 peer->r_c9 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1067 /* c9) set coefficient */
1068 mlp_create_problem_set_value (p, peer->r_c9, p->c_r, -peer->f , __LINE__);
1071 peer->processed = GNUNET_YES;
1074 /* Reset addresses' solver information */
1081 /* Add bandwidth column */
1082 GNUNET_asprintf (&name, "b_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1083 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1085 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 0.0);
1089 /* Maximize for bandwidth assignment in feasibility testing */
1090 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 1.0);
1094 /* Add address active column */
1095 GNUNET_asprintf (&name, "n_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1096 mlpi->c_n = mlp_create_problem_create_column (p, name, GLP_IV, GLP_DB, 0.0, 1.0, 0.0);
1099 /* Add address dependent constraints */
1100 /* Add c1) bandwidth capping: b_t + (-M) * n_t <= 0 */
1101 GNUNET_asprintf(&name, "c1_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1102 mlpi->r_c1 = mlp_create_problem_create_constraint (p, name, GLP_UP, 0.0, 0.0);
1104 /* c1) set b = 1 coefficient */
1105 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_b, 1, __LINE__);
1106 /* c1) set n = - min (M, quota) coefficient */
1107 cur_bigm = (double) mlp->pv.quota_out[addr_net_index];
1108 if (cur_bigm > mlp->pv.BIG_M)
1109 cur_bigm = (double) mlp->pv.BIG_M;
1110 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_n, -cur_bigm, __LINE__);
1112 /* Add constraint c 3) minimum bandwidth
1113 * b_t + (-n_t * b_min) >= 0
1115 GNUNET_asprintf(&name, "c3_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1116 mlpi->r_c3 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1119 /* c3) set b = 1 coefficient */
1120 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_b, 1, __LINE__);
1121 /* c3) set n = -b_min coefficient */
1122 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_n, - ((double )mlp->pv.b_min), __LINE__);
1125 /* Set coefficient entries in invariant rows */
1129 /* c 4) minimum connections */
1130 mlp_create_problem_set_value (p, p->r_c4, mlpi->c_n, 1, __LINE__);
1131 /* c 2) 1 address peer peer */
1132 mlp_create_problem_set_value (p, peer->r_c2, mlpi->c_n, 1, __LINE__);
1133 /* c 10) obey network specific quotas
1134 * (1)*b_1 + ... + (1)*b_m <= quota_n
1136 mlp_create_problem_set_value (p, p->r_quota[addr_net_index], mlpi->c_b, 1, __LINE__);
1139 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1141 /* c 6) maximize diversity */
1142 mlp_create_problem_set_value (p, p->r_c6, mlpi->c_n, 1, __LINE__);
1143 /* c 9) relativity */
1144 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1145 mlp_create_problem_set_value (p, peer->r_c9, mlpi->c_b, 1, __LINE__);
1147 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1148 mlp_create_problem_set_value (p, p->r_c8, mlpi->c_b, 1, __LINE__);
1149 /* c 7) Optimize quality */
1150 /* For all quality metrics, set quality of this address */
1151 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1153 props = mlp->env->get_property (mlp->env->cls, address);
1154 for (c = 0; c < mlp->pv.m_q; c++)
1156 if ((props[c] < 1.0) && (props[c] > 2.0))
1158 fprintf (stderr, "PROP == %.3f \t ", props[c]);
1161 mlp_create_problem_set_value (p, p->r_q[c], mlpi->c_b, props[c], __LINE__);
1171 * Create the invariant columns c4, c6, c10, c8, c7
1174 mlp_create_problem_add_invariant_rows (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1180 /* Row for c4) minimum connection */
1181 /* Number of minimum connections is min(|Peers|, n_min) */
1182 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);
1184 /* Rows for c 10) Enforce network quotas */
1185 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1188 GNUNET_asprintf(&text, "c10_quota_ats_%s",
1189 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]));
1190 p->r_quota[c] = mlp_create_problem_create_constraint (p, text, GLP_DB, 0.0, mlp->pv.quota_out[c]);
1195 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1198 /* Add row for c6) Maximize for diversity */
1199 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1201 p->r_c6 = mlp_create_problem_create_constraint (p, "c6", GLP_FX, 0.0, 0.0);
1202 /* Set c6 ) Setting -D */
1203 mlp_create_problem_set_value (p, p->r_c6, p->c_d, -1, __LINE__);
1206 /* Adding rows for c 8) Maximize utility */
1207 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1209 p->r_c8 = mlp_create_problem_create_constraint (p, "c8", GLP_FX, 0.0, 0.0);
1211 mlp_create_problem_set_value (p, p->r_c8, p->c_u, -1, __LINE__);
1214 /* For all quality metrics:
1215 * c 7) Maximize quality, austerity */
1216 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1218 for (c = 0; c < mlp->pv.m_q; c++)
1220 GNUNET_asprintf(&name, "c7_q%i_%s", c, mlp_ats_to_string(mlp->pv.q[c]));
1221 p->r_q[c] = mlp_create_problem_create_constraint (p, name, GLP_FX, 0.0, 0.0);
1223 mlp_create_problem_set_value (p, p->r_q[c], p->c_q[c], -1, __LINE__);
1231 * Create the invariant columns d, u, r, q0 ... qm
1234 mlp_create_problem_add_invariant_columns (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1236 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1241 /* Diversity d column */
1242 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1243 p->c_d = mlp_create_problem_create_column (p, "d", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_D);
1245 /* Utilization u column */
1246 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1247 p->c_u = mlp_create_problem_create_column (p, "u", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_U);
1249 /* Relativity r column */
1250 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1251 p->c_r = mlp_create_problem_create_column (p, "r", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_R);
1253 /* Quality metric columns */
1254 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1256 for (c = 0; c < mlp->pv.m_q; c++)
1258 GNUNET_asprintf (&name, "q_%u", mlp->pv.q[c]);
1259 p->c_q[c] = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_Q[c]);
1268 * Create the MLP problem
1270 * @param mlp the MLP handle
1271 * @return #GNUNET_OK or #GNUNET_SYSERR
1274 mlp_create_problem (struct GAS_MLP_Handle *mlp)
1276 struct MLP_Problem *p = &mlp->p;
1277 int res = GNUNET_OK;
1279 GNUNET_assert (p->prob == NULL);
1280 GNUNET_assert (p->ia == NULL);
1281 GNUNET_assert (p->ja == NULL);
1282 GNUNET_assert (p->ar == NULL);
1283 /* Reset MLP problem struct */
1285 /* create the glpk problem */
1286 p->prob = glp_create_prob ();
1287 GNUNET_assert (NULL != p->prob);
1288 p->num_peers = mlp_create_problem_count_peers (mlp->requested_peers, mlp->env->addresses);
1289 p->num_addresses = mlp_create_problem_count_addresses (mlp->requested_peers,
1290 mlp->env->addresses);
1292 /* Create problem matrix: 10 * #addresses + #q * #addresses + #q, + #peer + 2 + 1 */
1293 p->num_elements = (10 * p->num_addresses + mlp->pv.m_q * p->num_addresses +
1294 mlp->pv.m_q + p->num_peers + 2 + 1);
1295 LOG (GNUNET_ERROR_TYPE_DEBUG,
1296 "Rebuilding problem for %u peer(s) and %u addresse(s) and %u quality metrics == %u elements\n",
1302 /* Set a problem name */
1303 glp_set_prob_name (p->prob, "GNUnet ATS bandwidth distribution");
1304 /* Set optimization direction to maximize */
1305 glp_set_obj_dir (p->prob, GLP_MAX);
1307 /* Create problem matrix */
1308 /* last +1 caused by glpk index starting with one: [1..elements]*/
1311 p->ia = GNUNET_malloc (p->num_elements * sizeof (int));
1313 p->ja = GNUNET_malloc (p->num_elements * sizeof (int));
1315 p->ar = GNUNET_malloc (p->num_elements * sizeof (double));
1317 if ((NULL == p->ia) || (NULL == p->ja) || (NULL == p->ar))
1319 LOG (GNUNET_ERROR_TYPE_ERROR, _("Problem size too large, cannot allocate memory!\n"));
1320 return GNUNET_SYSERR;
1323 /* Adding invariant columns */
1324 mlp_create_problem_add_invariant_columns (mlp, p);
1326 /* Adding address independent constraint rows */
1327 mlp_create_problem_add_invariant_rows (mlp, p);
1329 /* Adding address dependent columns constraint rows */
1330 GNUNET_CONTAINER_multipeermap_iterate (mlp->env->addresses,
1331 &mlp_create_problem_add_address_information,
1334 /* Load the matrix */
1335 LOG (GNUNET_ERROR_TYPE_DEBUG, "Loading matrix\n");
1336 glp_load_matrix(p->prob, (p->ci)-1, p->ia, p->ja, p->ar);
1337 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
1339 glp_scale_prob (p->prob, GLP_SF_AUTO);
1347 * Solves the LP problem
1349 * @param mlp the MLP Handle
1350 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1353 mlp_solve_lp_problem (struct GAS_MLP_Handle *mlp)
1357 res = glp_simplex(mlp->p.prob, &mlp->control_param_lp);
1359 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem: %s\n",
1360 mlp_solve_to_string (res));
1362 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem failed: %s\n",
1363 mlp_solve_to_string (res));
1365 /* Analyze problem status */
1366 res_status = glp_get_status (mlp->p.prob);
1367 switch (res_status) {
1368 case GLP_OPT: /* solution is optimal */
1369 LOG (GNUNET_ERROR_TYPE_INFO,
1370 "Solving LP problem: %s, %s\n",
1371 mlp_solve_to_string(res),
1372 mlp_status_to_string(res_status));
1375 LOG (GNUNET_ERROR_TYPE_ERROR,
1376 "Solving LP problem failed: %s %s\n",
1377 mlp_solve_to_string(res),
1378 mlp_status_to_string(res_status));
1379 return GNUNET_SYSERR;
1385 * Propagates the results when MLP problem was solved
1387 * @param cls the MLP handle
1388 * @param key the peer identity
1389 * @param value the address
1390 * @return #GNUNET_OK to continue
1393 mlp_propagate_results (void *cls,
1394 const struct GNUNET_PeerIdentity *key,
1397 struct GAS_MLP_Handle *mlp = cls;
1398 struct ATS_Address *address;
1399 struct MLP_information *mlpi;
1400 double mlp_bw_in = MLP_NaN;
1401 double mlp_bw_out = MLP_NaN;
1402 double mlp_use = MLP_NaN;
1404 /* Check if we have to add this peer due to a pending request */
1405 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains (mlp->requested_peers,
1411 GNUNET_assert (address->solver_information != NULL);
1412 mlpi = address->solver_information;
1414 mlp_bw_in = glp_mip_col_val(mlp->p.prob, mlpi->c_b);/* FIXME */
1415 if (mlp_bw_in > (double) UINT32_MAX)
1417 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1418 mlp_bw_in = (double) UINT32_MAX;
1420 mlp_bw_out = glp_mip_col_val(mlp->p.prob, mlpi->c_b);
1421 if (mlp_bw_out > (double) UINT32_MAX)
1423 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1424 mlp_bw_out = (double) UINT32_MAX;
1426 mlp_use = glp_mip_col_val(mlp->p.prob, mlpi->c_n);
1430 * LOG (GNUNET_ERROR_TYPE_INFO, "MLP result address: `%s' `%s' length %u session %u, mlp use %.3f\n",
1431 * GNUNET_i2s(&address->peer), address->plugin,
1432 * address->addr_len, address->session_id);
1435 if (GLP_YES == mlp_use)
1437 /* This address was selected by the solver to be used */
1438 mlpi->n = GNUNET_YES;
1439 if (GNUNET_NO == address->active)
1441 /* Address was not used before, enabling address */
1442 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : enabling address\n",
1443 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1444 address->active = GNUNET_YES;
1445 address->assigned_bw_in = mlp_bw_in;
1446 mlpi->b_in = mlp_bw_in;
1447 address->assigned_bw_out = mlp_bw_out;
1448 mlpi->b_out = mlp_bw_out;
1449 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1450 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1453 else if (GNUNET_YES == address->active)
1455 /* Address was used before, check for bandwidth change */
1456 if ((mlp_bw_out != address->assigned_bw_out) ||
1457 (mlp_bw_in != address->assigned_bw_in))
1459 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : bandwidth changed\n",
1460 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1461 address->assigned_bw_in = mlp_bw_in;
1462 mlpi->b_in = mlp_bw_in;
1463 address->assigned_bw_out = mlp_bw_out;
1464 mlpi->b_out = mlp_bw_out;
1465 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1466 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1473 else if (GLP_NO == mlp_use)
1475 /* This address was selected by the solver to be not used */
1476 mlpi->n = GNUNET_NO;
1477 if (GNUNET_NO == address->active)
1479 /* Address was not used before, nothing to do */
1480 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : no change\n",
1481 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1484 else if (GNUNET_YES == address->active)
1486 /* Address was used before, disabling address */
1487 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : disabling address\n",
1488 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1489 address->active = GNUNET_NO;
1490 /* Set bandwidth to 0 */
1491 address->assigned_bw_in = 0;
1493 address->assigned_bw_out = 0;
1508 notify (struct GAS_MLP_Handle *mlp,
1509 enum GAS_Solver_Operation op,
1510 enum GAS_Solver_Status stat,
1511 enum GAS_Solver_Additional_Information add)
1513 if (NULL != mlp->env->info_cb)
1514 mlp->env->info_cb (mlp->env->cls, op, stat, add);
1519 mlp_branch_and_cut_cb (glp_tree *tree, void *info)
1521 struct GAS_MLP_Handle *mlp = info;
1524 switch (glp_ios_reason (tree))
1527 /* Do nothing here */
1530 /* Do nothing here */
1533 /* Do nothing here */
1536 /* Do nothing here */
1539 /* Do nothing here */
1542 /* Do nothing here */
1545 /* A better solution was found */
1546 mlp->ps.mlp_gap = glp_ios_mip_gap (tree);
1547 mlp_obj = glp_mip_obj_val (mlp->p.prob);
1548 mlp->ps.lp_mlp_gap = (abs(mlp_obj - mlp->ps.lp_objective_value)) / (abs(mlp_obj) + DBL_EPSILON);
1550 LOG (GNUNET_ERROR_TYPE_INFO,
1551 "Found better integer solution, current gaps: %.3f <= %.3f, %.3f <= %.3f\n",
1552 mlp->ps.mlp_gap, mlp->pv.mip_gap,
1553 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1555 if (mlp->ps.mlp_gap <= mlp->pv.mip_gap)
1557 LOG (GNUNET_ERROR_TYPE_INFO,
1558 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1559 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1560 glp_ios_terminate (tree);
1563 if (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap)
1565 LOG (GNUNET_ERROR_TYPE_INFO,
1566 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1567 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1568 glp_ios_terminate (tree);
1580 * Solves the MLP problem
1582 * @param solver the MLP Handle
1583 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1586 GAS_mlp_solve_problem (void *solver)
1588 struct GAS_MLP_Handle *mlp = solver;
1594 struct GNUNET_TIME_Absolute start_total;
1595 struct GNUNET_TIME_Absolute start_cur_op;
1596 struct GNUNET_TIME_Relative dur_total;
1597 struct GNUNET_TIME_Relative dur_setup;
1598 struct GNUNET_TIME_Relative dur_lp;
1599 struct GNUNET_TIME_Relative dur_mlp;
1601 GNUNET_assert(NULL != solver);
1603 if (GNUNET_YES == mlp->stat_bulk_lock)
1605 mlp->stat_bulk_requests++;
1608 notify(mlp, GAS_OP_SOLVE_START, GAS_STAT_SUCCESS,
1609 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1610 start_total = GNUNET_TIME_absolute_get();
1612 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->requested_peers))
1614 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1615 return GNUNET_OK; /* No pending requests */
1617 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->env->addresses))
1619 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1620 return GNUNET_OK; /* No addresses available */
1623 if ((GNUNET_NO == mlp->stat_mlp_prob_changed)
1624 && (GNUNET_NO == mlp->stat_mlp_prob_updated))
1626 LOG(GNUNET_ERROR_TYPE_DEBUG, "No changes to problem\n");
1627 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1630 if (GNUNET_YES == mlp->stat_mlp_prob_changed)
1632 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem size changed, rebuilding\n");
1633 notify(mlp, GAS_OP_SOLVE_SETUP_START, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1634 mlp_delete_problem(mlp);
1635 if (GNUNET_SYSERR == mlp_create_problem(mlp))
1637 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_FAIL, GAS_INFO_FULL);
1638 return GNUNET_SYSERR;
1640 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1641 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1643 mlp->control_param_lp.presolve = GLP_YES; /* LP presolver, we need lp solution */
1644 mlp->control_param_mlp.presolve = GNUNET_NO; /* No presolver, we have LP solution */
1648 mlp->control_param_lp.presolve = GNUNET_NO; /* LP presolver, we need lp solution */
1649 mlp->control_param_mlp.presolve = GLP_YES; /* No presolver, we have LP solution */
1650 dur_lp = GNUNET_TIME_UNIT_ZERO;
1655 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem was updated, resolving\n");
1658 /* Reset solution info */
1659 mlp->ps.lp_objective_value = 0.0;
1660 mlp->ps.mlp_gap = 1.0;
1661 mlp->ps.mlp_objective_value = 0.0;
1662 mlp->ps.lp_mlp_gap = 0.0;
1664 dur_setup = GNUNET_TIME_absolute_get_duration (start_total);
1667 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1669 notify(mlp, GAS_OP_SOLVE_MLP_LP_START, GAS_STAT_SUCCESS,
1670 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1671 LOG(GNUNET_ERROR_TYPE_DEBUG,
1672 "Running LP solver %s\n",
1673 (GLP_YES == mlp->control_param_lp.presolve)? "with presolver": "without presolver");
1674 start_cur_op = GNUNET_TIME_absolute_get();
1677 /* Only for debugging:
1678 * Always use LP presolver:
1679 * mlp->control_param_lp.presolve = GLP_YES; */
1680 res_lp = mlp_solve_lp_problem(mlp);
1681 if (GNUNET_OK == res_lp)
1683 mlp->ps.lp_objective_value = glp_get_obj_val (mlp->p.prob);
1684 LOG (GNUNET_ERROR_TYPE_DEBUG,
1685 "LP solution was: %.3f\n",
1686 mlp->ps.lp_objective_value);
1689 dur_lp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1690 notify(mlp, GAS_OP_SOLVE_MLP_LP_STOP,
1691 (GNUNET_OK == res_lp) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1692 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1695 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1698 /* Run MLP solver */
1699 if ((GNUNET_OK == res_lp) || (GNUNET_YES == mlp->opt_dbg_intopt_presolver))
1701 LOG(GNUNET_ERROR_TYPE_DEBUG, "Running MLP solver \n");
1702 notify(mlp, GAS_OP_SOLVE_MLP_MLP_START, GAS_STAT_SUCCESS,
1703 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1704 start_cur_op = GNUNET_TIME_absolute_get();
1708 /* Only for debugging, always use LP presolver */
1709 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1710 mlp->control_param_mlp.presolve = GNUNET_YES;
1712 mip_res = glp_intopt (mlp->p.prob, &mlp->control_param_mlp);
1717 LOG (GNUNET_ERROR_TYPE_INFO,
1718 "Solving MLP problem: %s\n",
1719 mlp_solve_to_string (mip_res));
1721 case GLP_ETMLIM: /* Time limit reached */
1722 case GLP_EMIPGAP: /* MIP gap tolerance limit reached */
1723 case GLP_ESTOP: /* Solver was instructed to stop*/
1724 /* Semi-successful */
1725 LOG (GNUNET_ERROR_TYPE_INFO,
1726 "Solving MLP problem solution was interupted: %s\n",
1727 mlp_solve_to_string (mip_res));
1736 LOG (GNUNET_ERROR_TYPE_INFO,
1737 "Solving MLP problem failed: %s\n",
1738 mlp_solve_to_string (mip_res));
1742 /* Analyze problem status */
1743 mip_status = glp_mip_status(mlp->p.prob);
1746 case GLP_OPT: /* solution is optimal */
1747 LOG (GNUNET_ERROR_TYPE_WARNING,
1748 "Solution of MLP problem is optimal: %s, %s\n",
1749 mlp_solve_to_string (mip_res),
1750 mlp_status_to_string (mip_status));
1751 mip_res = GNUNET_OK;
1753 case GLP_FEAS: /* solution is feasible but not proven optimal */
1755 if ( (mlp->ps.mlp_gap <= mlp->pv.mip_gap) ||
1756 (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap) )
1758 LOG (GNUNET_ERROR_TYPE_INFO,
1759 "Solution of MLP problem is feasible and solution within gap constraints: %s, %s\n",
1760 mlp_solve_to_string (mip_res),
1761 mlp_status_to_string (mip_status));
1762 mip_res = GNUNET_OK;
1766 LOG (GNUNET_ERROR_TYPE_WARNING,
1767 "Solution of MLP problem is feasible but solution not within gap constraints: %s, %s\n",
1768 mlp_solve_to_string (mip_res),
1769 mlp_status_to_string (mip_status));
1770 mip_res = GNUNET_SYSERR;
1773 case GLP_UNDEF: /* Solution undefined */
1774 case GLP_NOFEAS: /* No feasible solution */
1776 LOG (GNUNET_ERROR_TYPE_ERROR,
1777 "Solving MLP problem failed: %s %s\n",
1778 mlp_solve_to_string (mip_res),
1779 mlp_status_to_string (mip_status));
1780 mip_res = GNUNET_SYSERR;
1784 dur_mlp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1785 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1787 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP,
1788 (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1789 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1793 /* Do not execute mip solver since lp solution is invalid */
1794 dur_mlp = GNUNET_TIME_UNIT_ZERO;
1795 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1797 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP, GAS_STAT_FAIL,
1798 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1799 mip_res = GNUNET_SYSERR;
1802 /* Notify about end */
1803 notify(mlp, GAS_OP_SOLVE_STOP,
1804 ((GNUNET_OK == mip_res) && (GNUNET_OK == mip_res)) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1805 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1807 LOG (GNUNET_ERROR_TYPE_DEBUG,
1808 "Execution time for %s solve: (total/setup/lp/mlp) : %llu %llu %llu %llu\n",
1809 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? "full" : "updated",
1810 (unsigned long long) dur_total.rel_value_us,
1811 (unsigned long long) dur_setup.rel_value_us,
1812 (unsigned long long) dur_lp.rel_value_us,
1813 (unsigned long long) dur_mlp.rel_value_us);
1816 mlp->ps.lp_res = res_lp;
1817 mlp->ps.mip_res = mip_res;
1818 mlp->ps.lp_presolv = mlp->control_param_lp.presolve;
1819 mlp->ps.mip_presolv = mlp->control_param_mlp.presolve;
1820 mlp->ps.p_cols = glp_get_num_cols(mlp->p.prob);
1821 mlp->ps.p_rows = glp_get_num_rows(mlp->p.prob);
1822 mlp->ps.p_elements = mlp->p.num_elements;
1824 /* Propagate result*/
1825 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
1826 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1828 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1830 GNUNET_CONTAINER_multipeermap_iterate(mlp->env->addresses,
1831 &mlp_propagate_results, mlp);
1833 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
1834 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1837 struct GNUNET_TIME_Absolute time = GNUNET_TIME_absolute_get();
1838 if ( (GNUNET_YES == mlp->opt_dump_problem_all) ||
1839 (mlp->opt_dump_problem_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1841 /* Write problem to disk */
1842 switch (mlp->opt_log_format) {
1844 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.cplex", mlp->p.num_peers,
1845 mlp->p.num_addresses, time.abs_value_us);
1846 glp_write_lp (mlp->p.prob, NULL, filename);
1849 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.glpk", mlp->p.num_peers,
1850 mlp->p.num_addresses, time.abs_value_us);
1851 glp_write_prob (mlp->p.prob, 0, filename);
1854 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.mps", mlp->p.num_peers,
1855 mlp->p.num_addresses, time.abs_value_us);
1856 glp_write_mps (mlp->p.prob, GLP_MPS_FILE, NULL, filename);
1861 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped problem to file: `%s' \n", filename);
1862 GNUNET_free(filename);
1864 if ( (mlp->opt_dump_solution_all) ||
1865 (mlp->opt_dump_solution_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1867 /* Write solution to disk */
1868 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.sol", mlp->p.num_peers,
1869 mlp->p.num_addresses, time.abs_value_us);
1870 glp_print_mip(mlp->p.prob, filename);
1871 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped solution to file: `%s' \n", filename);
1872 GNUNET_free(filename);
1875 /* Reset change and update marker */
1876 mlp->control_param_lp.presolve = GLP_NO;
1877 mlp->stat_mlp_prob_updated = GNUNET_NO;
1878 mlp->stat_mlp_prob_changed = GNUNET_NO;
1880 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1883 return GNUNET_SYSERR;
1887 * Add a single address to the solve
1889 * @param solver the solver Handle
1890 * @param address the address to add
1891 * @param network network type of this address
1894 GAS_mlp_address_add (void *solver,
1895 struct ATS_Address *address,
1898 struct GAS_MLP_Handle *mlp = solver;
1900 GNUNET_assert (NULL != solver);
1901 GNUNET_assert (NULL != address);
1903 if (GNUNET_ATS_NetworkTypeCount <= network)
1909 if (NULL == address->solver_information)
1911 address->solver_information = GNUNET_new (struct MLP_information);
1914 LOG (GNUNET_ERROR_TYPE_ERROR,
1915 _("Adding address for peer `%s' multiple times\n"),
1916 GNUNET_i2s(&address->peer));
1918 /* Is this peer included in the problem? */
1920 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1923 /* FIXME: should this be an error? */
1924 LOG (GNUNET_ERROR_TYPE_DEBUG,
1925 "Adding address for peer `%s' without address request\n",
1926 GNUNET_i2s(&address->peer));
1930 LOG (GNUNET_ERROR_TYPE_DEBUG,
1931 "Adding address for peer `%s' with address request \n",
1932 GNUNET_i2s(&address->peer));
1933 /* Problem size changed: new address for peer with pending request */
1934 mlp->stat_mlp_prob_changed = GNUNET_YES;
1935 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
1936 GAS_mlp_solve_problem (solver);
1941 * Transport properties for this address have changed
1943 * @param solver solver handle
1944 * @param address the address
1945 * @param type the ATSI type in HBO
1946 * @param abs_value the absolute value of the property
1947 * @param rel_value the normalized value
1950 GAS_mlp_address_property_changed (void *solver,
1951 struct ATS_Address *address,
1956 struct MLP_information *mlpi = address->solver_information;
1957 struct GAS_MLP_Handle *mlp = solver;
1961 GNUNET_assert (NULL != solver);
1962 GNUNET_assert (NULL != address);
1966 LOG (GNUNET_ERROR_TYPE_INFO,
1967 _("Updating address property `%s' for peer `%s' %p not added before\n"),
1968 GNUNET_ATS_print_property_type (type),
1969 GNUNET_i2s(&address->peer),
1976 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1979 /* Peer is not requested, so no need to update problem */
1982 LOG (GNUNET_ERROR_TYPE_INFO, "Updating property `%s' address for peer `%s' to abs %llu rel %.3f\n",
1983 GNUNET_ATS_print_property_type (type),
1984 GNUNET_i2s(&address->peer),
1988 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
1991 /* Find row index */
1993 for (c1 = 0; c1 < mlp->pv.m_q; c1++)
1995 if (type == mlp->pv.q[c1])
2001 if (-1 == type_index)
2004 return; /* quality index not found */
2007 /* Update c7) [r_q[index]][c_b] = f_q * q_averaged[type_index] */
2008 if (GNUNET_YES == mlp_create_problem_update_value (&mlp->p,
2009 mlp->p.r_q[type_index], mlpi->c_b, rel_value, __LINE__))
2011 mlp->stat_mlp_prob_updated = GNUNET_YES;
2012 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2013 GAS_mlp_solve_problem (solver);
2020 * Find the active address in the set of addresses of a peer
2021 * @param cls destination
2022 * @param key peer id
2023 * @param value address
2024 * @return #GNUNET_OK
2027 mlp_get_preferred_address_it (void *cls,
2028 const struct GNUNET_PeerIdentity *key,
2031 static int counter = 0;
2032 struct ATS_Address **aa = cls;
2033 struct ATS_Address *addr = value;
2034 struct MLP_information *mlpi = addr->solver_information;
2041 * GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2042 * "MLP [%u] Peer `%s' %s length %u session %u active %s mlp active %s\n",
2043 * counter, GNUNET_i2s (&addr->peer), addr->plugin, addr->addr_len, addr->session_id,
2044 * (GNUNET_YES == addr->active) ? "active" : "inactive",
2045 * (GNUNET_YES == mlpi->n) ? "active" : "inactive");
2048 if (GNUNET_YES == mlpi->n)
2052 (*aa)->assigned_bw_in = mlpi->b_in;
2053 (*aa)->assigned_bw_out = mlpi->b_out;
2062 get_peer_pref_value (struct GAS_MLP_Handle *mlp,
2063 const struct GNUNET_PeerIdentity *peer)
2066 const double *preferences = NULL;
2069 preferences = mlp->env->get_preferences (mlp->env->cls, peer);
2071 for (c = 0; c < GNUNET_ATS_PreferenceCount; c++)
2073 if (c != GNUNET_ATS_PREFERENCE_END)
2075 /* fprintf (stderr, "VALUE[%u] %s %.3f \n",
2076 * c, GNUNET_i2s (&cur->addr->peer), t[c]); */
2077 res += preferences[c];
2081 res /= (GNUNET_ATS_PreferenceCount -1);
2084 LOG (GNUNET_ERROR_TYPE_DEBUG,
2085 "Peer preference for peer `%s' == %.2f\n",
2086 GNUNET_i2s(peer), res);
2093 * Get the preferred address for a specific peer
2095 * @param solver the MLP Handle
2096 * @param peer the peer
2097 * @return suggested address
2099 static const struct ATS_Address *
2100 GAS_mlp_get_preferred_address (void *solver,
2101 const struct GNUNET_PeerIdentity *peer)
2103 struct GAS_MLP_Handle *mlp = solver;
2105 struct ATS_Address *res;
2107 GNUNET_assert (NULL != solver);
2108 GNUNET_assert (NULL != peer);
2110 LOG (GNUNET_ERROR_TYPE_DEBUG, "Getting preferred address for `%s'\n",
2113 /* Is this peer included in the problem? */
2115 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2118 LOG (GNUNET_ERROR_TYPE_INFO, "Adding peer `%s' to list of requested_peers with requests\n",
2121 p = GNUNET_new (struct ATS_Peer);
2123 p->f = get_peer_pref_value (mlp, peer);
2124 GNUNET_CONTAINER_multipeermap_put (mlp->requested_peers,
2126 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
2128 /* Added new peer, we have to rebuild problem before solving */
2129 mlp->stat_mlp_prob_changed = GNUNET_YES;
2131 if ((GNUNET_YES == mlp->opt_mlp_auto_solve)&&
2132 (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains(mlp->env->addresses,
2135 mlp->exclude_peer = peer;
2136 GAS_mlp_solve_problem (mlp);
2137 mlp->exclude_peer = NULL;
2140 /* Get prefered address */
2142 GNUNET_CONTAINER_multipeermap_get_multiple (mlp->env->addresses, peer,
2143 &mlp_get_preferred_address_it, &res);
2149 * Deletes a single address in the MLP problem
2151 * The MLP problem has to be recreated and the problem has to be resolved
2153 * @param solver the MLP Handle
2154 * @param address the address to delete
2155 * @param session_only delete only session not whole address
2158 GAS_mlp_address_delete (void *solver,
2159 struct ATS_Address *address,
2162 struct GAS_MLP_Handle *mlp = solver;
2163 struct MLP_information *mlpi;
2166 GNUNET_assert (NULL != solver);
2167 GNUNET_assert (NULL != address);
2169 mlpi = address->solver_information;
2170 if ((GNUNET_NO == session_only) && (NULL != mlpi))
2172 /* Remove full address */
2174 address->solver_information = NULL;
2176 was_active = address->active;
2177 address->active = GNUNET_NO;
2178 address->assigned_bw_in = 0;
2179 address->assigned_bw_out = 0;
2181 /* Is this peer included in the problem? */
2183 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2186 LOG (GNUNET_ERROR_TYPE_INFO,
2187 "Deleting %s for peer `%s' without address request \n",
2188 (session_only == GNUNET_YES) ? "session" : "address",
2189 GNUNET_i2s(&address->peer));
2192 LOG (GNUNET_ERROR_TYPE_INFO, "Deleting %s for peer `%s' with address request \n",
2193 (session_only == GNUNET_YES) ? "session" : "address",
2194 GNUNET_i2s(&address->peer));
2196 /* Problem size changed: new address for peer with pending request */
2197 mlp->stat_mlp_prob_changed = GNUNET_YES;
2198 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2200 GAS_mlp_solve_problem (solver);
2202 if (GNUNET_YES == was_active)
2204 if (NULL == GAS_mlp_get_preferred_address (solver, &address->peer))
2206 /* No alternative address, disconnecting peer */
2207 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
2216 * Start a bulk operation
2218 * @param solver the solver
2221 GAS_mlp_bulk_start (void *solver)
2223 struct GAS_MLP_Handle *s = solver;
2225 LOG (GNUNET_ERROR_TYPE_DEBUG,
2226 "Locking solver for bulk operation ...\n");
2227 GNUNET_assert (NULL != solver);
2228 s->stat_bulk_lock ++;
2233 GAS_mlp_bulk_stop (void *solver)
2235 struct GAS_MLP_Handle *s = solver;
2237 LOG (GNUNET_ERROR_TYPE_DEBUG,
2238 "Unlocking solver from bulk operation ...\n");
2239 GNUNET_assert (NULL != solver);
2241 if (s->stat_bulk_lock < 1)
2246 s->stat_bulk_lock --;
2248 if (0 < s->stat_bulk_requests)
2250 GAS_mlp_solve_problem (solver);
2251 s->stat_bulk_requests= 0;
2258 * Stop notifying about address and bandwidth changes for this peer
2260 * @param solver the MLP handle
2261 * @param peer the peer
2264 GAS_mlp_stop_get_preferred_address (void *solver,
2265 const struct GNUNET_PeerIdentity *peer)
2267 struct GAS_MLP_Handle *mlp = solver;
2268 struct ATS_Peer *p = NULL;
2270 GNUNET_assert (NULL != solver);
2271 GNUNET_assert (NULL != peer);
2272 if (NULL != (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2274 GNUNET_assert (GNUNET_YES ==
2275 GNUNET_CONTAINER_multipeermap_remove (mlp->requested_peers, peer, p));
2278 mlp->stat_mlp_prob_changed = GNUNET_YES;
2279 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2281 GAS_mlp_solve_problem (solver);
2288 * Changes the preferences for a peer in the MLP problem
2290 * @param solver the MLP Handle
2291 * @param peer the peer
2292 * @param kind the kind to change the preference
2293 * @param pref_rel the relative score
2296 GAS_mlp_address_change_preference (void *solver,
2297 const struct GNUNET_PeerIdentity *peer,
2298 enum GNUNET_ATS_PreferenceKind kind,
2301 struct GAS_MLP_Handle *mlp = solver;
2304 LOG (GNUNET_ERROR_TYPE_DEBUG,
2305 "Changing preference for address for peer `%s' to %.2f\n",
2309 GNUNET_STATISTICS_update (mlp->env->stats,
2310 "# LP address preference changes", 1, GNUNET_NO);
2311 /* Update the constraints with changed preferences */
2315 /* Update relativity constraint c9 */
2316 if (NULL == (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2318 LOG (GNUNET_ERROR_TYPE_INFO,
2319 "Updating preference for unknown peer `%s'\n",
2324 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
2326 p->f = get_peer_pref_value (mlp, peer);
2327 mlp_create_problem_update_value (&mlp->p,
2333 /* Problem size changed: new address for peer with pending request */
2334 mlp->stat_mlp_prob_updated = GNUNET_YES;
2335 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2336 GAS_mlp_solve_problem (solver);
2342 * Get application feedback for a peer
2344 * @param solver the solver handle
2345 * @param application the application
2346 * @param peer the peer to change the preference for
2347 * @param scope the time interval for this feedback: [now - scope .. now]
2348 * @param kind the kind to change the preference
2349 * @param score the score
2352 GAS_mlp_address_preference_feedback (void *solver,
2353 struct GNUNET_SERVER_Client *application,
2354 const struct GNUNET_PeerIdentity *peer,
2355 const struct GNUNET_TIME_Relative scope,
2356 enum GNUNET_ATS_PreferenceKind kind,
2359 struct GAS_PROPORTIONAL_Handle *s = solver;
2361 GNUNET_assert (NULL != solver);
2362 GNUNET_assert (NULL != peer);
2363 GNUNET_assert (NULL != s);
2368 mlp_free_peers (void *cls,
2369 const struct GNUNET_PeerIdentity *key, void *value)
2371 struct GNUNET_CONTAINER_MultiPeerMap *map = cls;
2372 struct ATS_Peer *p = value;
2374 GNUNET_assert (GNUNET_YES ==
2375 GNUNET_CONTAINER_multipeermap_remove (map, key, value));
2383 * Shutdown the MLP problem solving component
2385 * @param cls the solver handle
2389 libgnunet_plugin_ats_mlp_done (void *cls)
2391 struct GNUNET_ATS_SolverFunctions *sf = cls;
2392 struct GAS_MLP_Handle *mlp = sf->cls;
2394 LOG (GNUNET_ERROR_TYPE_DEBUG,
2395 "Shutting down mlp solver\n");
2396 mlp_delete_problem (mlp);
2397 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
2399 mlp->requested_peers);
2400 GNUNET_CONTAINER_multipeermap_destroy (mlp->requested_peers);
2401 mlp->requested_peers = NULL;
2403 /* Clean up GLPK environment */
2407 LOG (GNUNET_ERROR_TYPE_DEBUG,
2408 "Shutdown down of mlp solver complete\n");
2414 libgnunet_plugin_ats_mlp_init (void *cls)
2416 static struct GNUNET_ATS_SolverFunctions sf;
2417 struct GNUNET_ATS_PluginEnvironment *env = cls;
2418 struct GAS_MLP_Handle * mlp = GNUNET_new (struct GAS_MLP_Handle);
2420 unsigned long long tmp;
2426 struct GNUNET_TIME_Relative max_duration;
2427 long long unsigned int max_iterations;
2429 /* Init GLPK environment */
2430 int res = glp_init_env();
2433 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2434 "initialization successful");
2437 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2438 "environment is already initialized");
2441 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2442 "initialization failed (insufficient memory)");
2447 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2448 "initialization failed (unsupported programming model)");
2456 mlp->opt_dump_problem_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2457 "ats", "MLP_DUMP_PROBLEM_ALL");
2458 if (GNUNET_SYSERR == mlp->opt_dump_problem_all)
2459 mlp->opt_dump_problem_all = GNUNET_NO;
2461 mlp->opt_dump_solution_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2462 "ats", "MLP_DUMP_SOLUTION_ALL");
2463 if (GNUNET_SYSERR == mlp->opt_dump_solution_all)
2464 mlp->opt_dump_solution_all = GNUNET_NO;
2466 mlp->opt_dump_problem_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2467 "ats", "MLP_DUMP_PROBLEM_ON_FAIL");
2468 if (GNUNET_SYSERR == mlp->opt_dump_problem_on_fail)
2469 mlp->opt_dump_problem_on_fail = GNUNET_NO;
2471 mlp->opt_dump_solution_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2472 "ats", "MLP_DUMP_SOLUTION_ON_FAIL");
2473 if (GNUNET_SYSERR == mlp->opt_dump_solution_on_fail)
2474 mlp->opt_dump_solution_on_fail = GNUNET_NO;
2476 mlp->opt_dbg_glpk_verbose = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2477 "ats", "MLP_DBG_GLPK_VERBOSE");
2478 if (GNUNET_SYSERR == mlp->opt_dbg_glpk_verbose)
2479 mlp->opt_dbg_glpk_verbose = GNUNET_NO;
2481 mlp->opt_dbg_feasibility_only = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2482 "ats", "MLP_DBG_FEASIBILITY_ONLY");
2483 if (GNUNET_SYSERR == mlp->opt_dbg_feasibility_only)
2484 mlp->opt_dbg_feasibility_only = GNUNET_NO;
2485 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
2486 LOG (GNUNET_ERROR_TYPE_WARNING,
2487 "MLP solver is configured to check feasibility only!\n");
2489 mlp->opt_dbg_autoscale_problem = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2490 "ats", "MLP_DBG_AUTOSCALE_PROBLEM");
2491 if (GNUNET_SYSERR == mlp->opt_dbg_autoscale_problem)
2492 mlp->opt_dbg_autoscale_problem = GNUNET_NO;
2493 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
2494 LOG (GNUNET_ERROR_TYPE_WARNING,
2495 "MLP solver is configured automatically scale the problem!\n");
2497 mlp->opt_dbg_intopt_presolver = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2498 "ats", "MLP_DBG_INTOPT_PRESOLVE");
2499 if (GNUNET_SYSERR == mlp->opt_dbg_intopt_presolver)
2500 mlp->opt_dbg_intopt_presolver = GNUNET_NO;
2501 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
2502 LOG (GNUNET_ERROR_TYPE_WARNING,
2503 "MLP solver is configured use the mlp presolver\n");
2505 mlp->opt_dbg_optimize_diversity = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2506 "ats", "MLP_DBG_OPTIMIZE_DIVERSITY");
2507 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_diversity)
2508 mlp->opt_dbg_optimize_diversity = GNUNET_YES;
2509 if (GNUNET_NO == mlp->opt_dbg_optimize_diversity)
2510 LOG (GNUNET_ERROR_TYPE_WARNING,
2511 "MLP solver is not optimizing for diversity\n");
2513 mlp->opt_dbg_optimize_relativity= GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2514 "ats", "MLP_DBG_OPTIMIZE_RELATIVITY");
2515 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_relativity)
2516 mlp->opt_dbg_optimize_relativity = GNUNET_YES;
2517 if (GNUNET_NO == mlp->opt_dbg_optimize_relativity)
2518 LOG (GNUNET_ERROR_TYPE_WARNING,
2519 "MLP solver is not optimizing for relativity\n");
2521 mlp->opt_dbg_optimize_quality = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2522 "ats", "MLP_DBG_OPTIMIZE_QUALITY");
2523 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_quality)
2524 mlp->opt_dbg_optimize_quality = GNUNET_YES;
2525 if (GNUNET_NO == mlp->opt_dbg_optimize_quality)
2526 LOG (GNUNET_ERROR_TYPE_WARNING,
2527 "MLP solver is not optimizing for quality\n");
2529 mlp->opt_dbg_optimize_utility = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2530 "ats", "MLP_DBG_OPTIMIZE_UTILITY");
2531 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_utility)
2532 mlp->opt_dbg_optimize_utility = GNUNET_YES;
2533 if (GNUNET_NO == mlp->opt_dbg_optimize_utility)
2534 LOG (GNUNET_ERROR_TYPE_WARNING,
2535 "MLP solver is not optimizing for utility\n");
2537 if ( (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2538 (GNUNET_NO == mlp->opt_dbg_optimize_quality) &&
2539 (GNUNET_NO == mlp->opt_dbg_optimize_relativity) &&
2540 (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2541 (GNUNET_NO == mlp->opt_dbg_feasibility_only))
2543 LOG (GNUNET_ERROR_TYPE_ERROR,
2544 _("MLP solver is not optimizing for anything, changing to feasibility check\n"));
2545 mlp->opt_dbg_feasibility_only = GNUNET_YES;
2548 if (GNUNET_SYSERR == GNUNET_CONFIGURATION_get_value_string (env->cfg,
2549 "ats", "MLP_LOG_FORMAT", &outputformat))
2550 mlp->opt_log_format = MLP_CPLEX;
2553 GNUNET_STRINGS_utf8_toupper(outputformat, outputformat);
2554 if (0 == strcmp (outputformat, "MPS"))
2556 mlp->opt_log_format = MLP_MPS;
2558 else if (0 == strcmp (outputformat, "CPLEX"))
2560 mlp->opt_log_format = MLP_CPLEX;
2562 else if (0 == strcmp (outputformat, "GLPK"))
2564 mlp->opt_log_format = MLP_GLPK;
2568 LOG (GNUNET_ERROR_TYPE_WARNING,
2569 "Invalid log format `%s' in configuration, using CPLEX!\n",
2571 mlp->opt_log_format = MLP_CPLEX;
2573 GNUNET_free (outputformat);
2576 mlp->pv.BIG_M = (double) BIG_M_VALUE;
2578 mlp->pv.mip_gap = (double) 0.0;
2579 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2580 "MLP_MAX_MIP_GAP", &f_tmp))
2582 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2584 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2589 mlp->pv.mip_gap = f_tmp;
2590 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s of %.3f\n",
2595 mlp->pv.lp_mip_gap = (double) 0.0;
2596 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2597 "MLP_MAX_LP_MIP_GAP", &f_tmp))
2599 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2601 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2606 mlp->pv.lp_mip_gap = f_tmp;
2607 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2612 /* Get timeout for iterations */
2613 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_time(env->cfg, "ats",
2614 "MLP_MAX_DURATION", &max_duration))
2616 max_duration = MLP_MAX_EXEC_DURATION;
2619 /* Get maximum number of iterations */
2620 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_size(env->cfg, "ats",
2621 "MLP_MAX_ITERATIONS", &max_iterations))
2623 max_iterations = MLP_MAX_ITERATIONS;
2626 /* Get diversity coefficient from configuration */
2627 mlp->pv.co_D = MLP_DEFAULT_D;
2628 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2629 "MLP_COEFFICIENT_D", &f_tmp))
2633 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2634 "MLP_COEFFICIENT_D", f_tmp);
2638 mlp->pv.co_D = f_tmp;
2639 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2640 "MLP_COEFFICIENT_D", f_tmp);
2644 /* Get relativity coefficient from configuration */
2645 mlp->pv.co_R = MLP_DEFAULT_R;
2646 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2647 "MLP_COEFFICIENT_R", &f_tmp))
2651 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2652 "MLP_COEFFICIENT_R", f_tmp);
2656 mlp->pv.co_R = f_tmp;
2657 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2658 "MLP_COEFFICIENT_R", f_tmp);
2663 /* Get utilization coefficient from configuration */
2664 mlp->pv.co_U = MLP_DEFAULT_U;
2665 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2666 "MLP_COEFFICIENT_U", &f_tmp))
2670 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2671 "MLP_COEFFICIENT_U", f_tmp);
2675 mlp->pv.co_U = f_tmp;
2676 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2677 "MLP_COEFFICIENT_U", f_tmp);
2681 /* Get quality metric coefficients from configuration */
2682 int i_delay = MLP_NaN;
2683 int i_distance = MLP_NaN;
2684 int q[GNUNET_ATS_QualityPropertiesCount] = GNUNET_ATS_QualityProperties;
2685 for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
2687 /* initialize quality coefficients with default value 1.0 */
2688 mlp->pv.co_Q[c] = MLP_DEFAULT_QUALITY;
2690 mlp->pv.q[c] = q[c];
2691 if (q[c] == GNUNET_ATS_QUALITY_NET_DELAY)
2693 if (q[c] == GNUNET_ATS_QUALITY_NET_DISTANCE)
2697 if ( (i_delay != MLP_NaN) &&
2698 (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2699 "MLP_COEFFICIENT_QUALITY_DELAY", &tmp)) )
2700 mlp->pv.co_Q[i_delay] = (double) tmp / 100;
2702 mlp->pv.co_Q[i_delay] = MLP_DEFAULT_QUALITY;
2704 if ( (i_distance != MLP_NaN) &&
2705 (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2706 "MLP_COEFFICIENT_QUALITY_DISTANCE", &tmp)) )
2707 mlp->pv.co_Q[i_distance] = (double) tmp / 100;
2709 mlp->pv.co_Q[i_distance] = MLP_DEFAULT_QUALITY;
2711 /* Get minimum bandwidth per used address from configuration */
2712 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2713 "MLP_MIN_BANDWIDTH",
2718 b_min = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
2721 /* Get minimum number of connections from configuration */
2722 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2723 "MLP_MIN_CONNECTIONS",
2727 n_min = MLP_DEFAULT_MIN_CONNECTIONS;
2729 /* Init network quotas */
2730 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
2732 mlp->pv.quota_index[c] = c;
2733 mlp->pv.quota_out[c] = env->out_quota[c];
2734 mlp->pv.quota_in[c] = env->in_quota[c];
2736 LOG (GNUNET_ERROR_TYPE_INFO,
2737 "Quota for network `%s' (in/out) %llu/%llu\n",
2738 GNUNET_ATS_print_network_type (c),
2739 mlp->pv.quota_out[c],
2740 mlp->pv.quota_in[c]);
2741 /* Check if defined quota could make problem unsolvable */
2742 if ((n_min * b_min) > mlp->pv.quota_out[c])
2744 LOG (GNUNET_ERROR_TYPE_INFO,
2745 _("Adjusting inconsistent outbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2746 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2747 mlp->pv.quota_out[c],
2749 mlp->pv.quota_out[c] = (n_min * b_min);
2751 if ((n_min * b_min) > mlp->pv.quota_in[c])
2753 LOG (GNUNET_ERROR_TYPE_INFO,
2754 _("Adjusting inconsistent inbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2755 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2756 mlp->pv.quota_in[c],
2758 mlp->pv.quota_in[c] = (n_min * b_min);
2760 /* Check if bandwidth is too big to make problem solvable */
2761 if (mlp->pv.BIG_M < mlp->pv.quota_out[c])
2763 LOG (GNUNET_ERROR_TYPE_INFO,
2764 _("Adjusting outbound quota configuration for network `%s'from %llu to %.0f\n"),
2765 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2766 mlp->pv.quota_out[c],
2768 mlp->pv.quota_out[c] = mlp->pv.BIG_M ;
2770 if (mlp->pv.BIG_M < mlp->pv.quota_in[c])
2772 LOG (GNUNET_ERROR_TYPE_INFO,
2773 _("Adjusting inbound quota configuration for network `%s' from %llu to %.0f\n"),
2774 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2775 mlp->pv.quota_in[c],
2777 mlp->pv.quota_in[c] = mlp->pv.BIG_M ;
2782 sf.s_add = &GAS_mlp_address_add;
2783 sf.s_address_update_property = &GAS_mlp_address_property_changed;
2784 sf.s_get = &GAS_mlp_get_preferred_address;
2785 sf.s_get_stop = &GAS_mlp_stop_get_preferred_address;
2786 sf.s_pref = &GAS_mlp_address_change_preference;
2787 sf.s_feedback = &GAS_mlp_address_preference_feedback;
2788 sf.s_del = &GAS_mlp_address_delete;
2789 sf.s_bulk_start = &GAS_mlp_bulk_start;
2790 sf.s_bulk_stop = &GAS_mlp_bulk_stop;
2792 /* Setting MLP Input variables */
2793 mlp->pv.b_min = b_min;
2794 mlp->pv.n_min = n_min;
2795 mlp->pv.m_q = GNUNET_ATS_QualityPropertiesCount;
2796 mlp->stat_mlp_prob_changed = GNUNET_NO;
2797 mlp->stat_mlp_prob_updated = GNUNET_NO;
2798 mlp->opt_mlp_auto_solve = GNUNET_YES;
2799 mlp->requested_peers = GNUNET_CONTAINER_multipeermap_create (10, GNUNET_NO);
2800 mlp->stat_bulk_requests = 0;
2801 mlp->stat_bulk_lock = 0;
2804 /* Redirect GLPK output to GNUnet logging */
2805 glp_term_hook (&mlp_term_hook, (void *) mlp);
2807 /* Init LP solving parameters */
2808 glp_init_smcp(&mlp->control_param_lp);
2809 mlp->control_param_lp.msg_lev = GLP_MSG_OFF;
2810 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2811 mlp->control_param_lp.msg_lev = GLP_MSG_ALL;
2813 mlp->control_param_lp.it_lim = max_iterations;
2814 mlp->control_param_lp.tm_lim = max_duration.rel_value_us / 1000LL;
2816 /* Init MLP solving parameters */
2817 glp_init_iocp(&mlp->control_param_mlp);
2818 /* Setting callback function */
2819 mlp->control_param_mlp.cb_func = &mlp_branch_and_cut_cb;
2820 mlp->control_param_mlp.cb_info = mlp;
2821 mlp->control_param_mlp.msg_lev = GLP_MSG_OFF;
2822 mlp->control_param_mlp.mip_gap = mlp->pv.mip_gap;
2823 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2824 mlp->control_param_mlp.msg_lev = GLP_MSG_ALL;
2825 mlp->control_param_mlp.tm_lim = max_duration.rel_value_us / 1000LL;
2827 LOG (GNUNET_ERROR_TYPE_DEBUG, "solver ready\n");
2832 /* end of plugin_ats_mlp.c */