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 * Address hashmap for lookups
224 const struct GNUNET_CONTAINER_MultiPeerMap *addresses;
227 * Exclude peer from next result propagation
229 const struct GNUNET_PeerIdentity *exclude_peer;
232 * Encapsulation for the MLP problem
234 struct MLP_Problem p;
237 * Encapsulation for the MLP problem variables
239 struct MLP_Variables pv;
242 * Encapsulation for the MLP solution
244 struct MLP_Solution ps;
252 * Number of changes while solver was locked
254 int stat_bulk_requests;
257 * GLPK LP control parameter
259 glp_smcp control_param_lp;
262 * GLPK LP control parameter
264 glp_iocp control_param_mlp;
267 * Peers with pending address requests
269 struct GNUNET_CONTAINER_MultiPeerMap *requested_peers;
272 * Was the problem updated since last solution
274 int stat_mlp_prob_updated;
277 * Has the problem size changed since last solution
279 int stat_mlp_prob_changed;
282 * Solve the problem automatically when updates occur?
283 * Default: GNUNET_YES
284 * Can be disabled for test and measurements
286 int opt_mlp_auto_solve;
289 * Write all MILP problems to a MPS file
291 int opt_dump_problem_all;
294 * Write all MILP problem solutions to a file
296 int opt_dump_solution_all;
299 * Write MILP problems to a MPS file when solver fails
301 int opt_dump_problem_on_fail;
304 * Write MILP problem solutions to a file when solver fails
306 int opt_dump_solution_on_fail;
309 * solve feasibility only
311 int opt_dbg_feasibility_only;
314 * solve autoscale the problem
316 int opt_dbg_autoscale_problem;
319 * use the intopt presolver instead of simplex
321 int opt_dbg_intopt_presolver;
326 int opt_dbg_glpk_verbose;
329 * solve autoscale the problem
331 int opt_dbg_optimize_relativity;
334 * solve autoscale the problem
336 int opt_dbg_optimize_diversity;
339 * solve autoscale the problem
341 int opt_dbg_optimize_quality;
344 * solve autoscale the problem
346 int opt_dbg_optimize_utility;
352 enum MLP_Output_Format opt_log_format;
356 * Address specific MLP information
358 struct MLP_information
362 * Bandwidth assigned outbound
367 * Bandwidth assigned inbound
377 * bandwidth column index
382 * address usage column
389 * constraint 1: bandwidth capping
394 * constraint 3: minimum bandwidth
403 * NOTE: Do not modify this documentation. This documentation is based on
404 * gnunet.org:/vcs/fsnsg/ats-paper.git/tech-doku/ats-tech-guide.tex
405 * use build_txt.sh to generate plaintext output
407 * The MLP solver (mlp) tries to finds an optimal bandwidth assignmentby
408 * optimizing an mixed integer programming problem. The MLP solver uses a
409 * number of constraints to find the best adddress for a peer and an optimal
410 * bandwidth assignment. mlp uses the GNU Linear Programming Kit to solve the
413 * We defined a constraint system to find an optimal bandwidth assignment.
414 * This constraint system uses as an input data addresses, bandwidth quotas,
415 * preferences and quality values. This constraint system is stored in an
416 * matrix based equotation system.
420 * A (M)LP problem consists of a target function to optimizes, constraints
421 * and rows and columns. FIXME GLP uses three arrays to index the matrix: two
422 * integer arrays storing the row and column indices in the matrix and an
423 * float array to store the coeeficient.
425 * To solve the problem we first find an initial solution for the LP problem
426 * using the LP solver and then find an MLP solution based on this solution
427 * using the MLP solver.
429 * Solving (M)LP problems has the property that finding an initial solution
430 * for the LP problem is computationally expensive and finding the MLP
431 * solution is cheaper. This is especially interesting an existing LP
432 * solution can be reused if only coefficients in the matrix have changed
433 * (addresses updated). Only when the problem size changes (addresses added
434 * or deleted) a new LP solution has to be found.
437 * The mlp solver solves the bandwidth assignment problem only on demand when
438 * an address suggestion is requested. When an address is requested mlp the
439 * solves the mlp problem and if the active address or the bandwidth assigned
440 * changes it calls the callback to addresses. The mlp solver gets notified
441 * about new addresses (adding sessions), removed addresses (address
442 * deletions) and address updates. To benefit from the mlp properties
443 * mentioned in section 5 the solver rembers if since the last solution
444 * addresses were added or deleted (problem size changed, problem has to be
445 * rebuild and solved from sratch) or if addresses were updated and the
446 * existing solution can be reused.
450 * The quotas for each network segment are passed by addresses. MLP can be
451 * adapted using configuration settings and uses the following parameters:
452 * * MLP_MAX_DURATION:
453 * Maximum duration for a MLP solution procees (default: 3 sec.)
454 * * MLP_MAX_ITERATIONS:
455 * Maximum number of iterations for a MLP solution process (default:
457 * * MLP_MIN_CONNECTIONS:
458 * Minimum number of desired connections (default: 4)
459 * * MLP_MIN_BANDWIDTH:
460 * Minimum amount of bandwidth assigned to an address (default: 1024)
461 * * MLP_COEFFICIENT_D:
462 * Diversity coefficient (default: 1.0)
463 * * MLP_COEFFICIENT_R:
464 * Relativity coefficient (default: 1.0)
465 * * MLP_COEFFICIENT_U:
466 * Utilization coefficient (default: 1.0)
467 * * MLP_COEFFICIENT_D:
468 * Diversity coefficient (default: 1.0)
469 * * MLP_COEFFICIENT_QUALITY_DELAY:
470 * Quality delay coefficient (default: 1.0)
471 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
472 * Quality distance coefficient (default: 1.0)
473 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
474 * Quality distance coefficient (default: 1.0)
475 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
476 * Quality distance coefficient (default: 1.0)
477 * * MLP_COEFFICIENT_QUALITY_DISTANCE:
478 * Quality distance coefficient (default: 1.0)
480 * 5.2 Data structures used
482 * mlp has for each known peer a struct ATS_Peer containing information about
483 * a specific peer. The address field solver_information contains information
484 * about the mlp properties of this address.
488 * During initialization mlp initializes the GLPK libray used to solve the
489 * MLP problem: it initializes the glpk environment and creates an initial LP
490 * problem. Next it loads the configuration values from the configuration or
491 * uses the default values configured in -addresses_mlp.h. The quotas used
492 * are given by addresses but may have to be adjusted. mlp uses a upper limit
493 * for the bandwidth assigned called BIG M and a minimum amount of bandwidth
494 * an address gets assigned as well as a minium desired number of
495 * connections. If the configured quota is bigger than BIG M, it is reduced
496 * to BIG M. If the configured quota is smaller than MLP_MIN_CONNECTIONS
497 * *MLP_MIN_BANDWIDTH it is increased to this value.
503 #define LOG(kind,...) GNUNET_log_from (kind, "ats-mlp",__VA_ARGS__)
506 * Print debug output for mlp problem creation
508 #define DEBUG_MLP_PROBLEM_CREATION GNUNET_NO
512 * Intercept GLPK terminal output
513 * @param info the mlp handle
514 * @param s the string to print
515 * @return 0: glpk prints output on terminal, 0 != surpress output
518 mlp_term_hook (void *info, const char *s)
520 struct GAS_MLP_Handle *mlp = info;
522 if (mlp->opt_dbg_glpk_verbose)
523 LOG (GNUNET_ERROR_TYPE_ERROR, "%s", s);
529 * Reset peers for next problem creation
531 * @param cls not used
533 * @param value ATS_Peer
537 reset_peers (void *cls,
538 const struct GNUNET_PeerIdentity *key,
541 struct ATS_Peer *peer = value;
542 peer->processed = GNUNET_NO;
547 * Delete the MLP problem and free the constrain matrix
549 * @param mlp the MLP handle
552 mlp_delete_problem (struct GAS_MLP_Handle *mlp)
557 if (mlp->p.prob != NULL)
559 glp_delete_prob(mlp->p.prob);
563 /* delete row index */
564 if (mlp->p.ia != NULL)
566 GNUNET_free (mlp->p.ia);
570 /* delete column index */
571 if (mlp->p.ja != NULL)
573 GNUNET_free (mlp->p.ja);
577 /* delete coefficients */
578 if (mlp->p.ar != NULL)
580 GNUNET_free (mlp->p.ar);
586 mlp->p.c_d = MLP_UNDEFINED;
587 mlp->p.c_r = MLP_UNDEFINED;
588 mlp->p.r_c2 = MLP_UNDEFINED;
589 mlp->p.r_c4 = MLP_UNDEFINED;
590 mlp->p.r_c6 = MLP_UNDEFINED;
591 mlp->p.r_c9 = MLP_UNDEFINED;
592 for (c = 0; c < mlp->pv.m_q ; c ++)
593 mlp->p.r_q[c] = MLP_UNDEFINED;
594 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c ++)
595 mlp->p.r_quota[c] = MLP_UNDEFINED;
596 mlp->p.ci = MLP_UNDEFINED;
599 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
605 * Translate ATS properties to text
606 * Just intended for debugging
608 * @param ats_index the ATS index
609 * @return string with result
612 mlp_ats_to_string (int ats_index)
615 case GNUNET_ATS_ARRAY_TERMINATOR:
616 return "GNUNET_ATS_ARRAY_TERMINATOR";
617 case GNUNET_ATS_UTILIZATION_OUT:
618 return "GNUNET_ATS_UTILIZATION_OUT";
619 case GNUNET_ATS_UTILIZATION_IN:
620 return "GNUNET_ATS_UTILIZATION_IN";
621 case GNUNET_ATS_UTILIZATION_PAYLOAD_OUT:
622 return "GNUNET_ATS_UTILIZATION_PAYLOAD_OUT";
623 case GNUNET_ATS_UTILIZATION_PAYLOAD_IN:
624 return "GNUNET_ATS_UTILIZATION_PAYLOAD_IN";
625 case GNUNET_ATS_COST_LAN:
626 return "GNUNET_ATS_COST_LAN";
627 case GNUNET_ATS_COST_WAN:
628 return "GNUNET_ATS_COST_LAN";
629 case GNUNET_ATS_COST_WLAN:
630 return "GNUNET_ATS_COST_WLAN";
631 case GNUNET_ATS_NETWORK_TYPE:
632 return "GNUNET_ATS_NETWORK_TYPE";
633 case GNUNET_ATS_QUALITY_NET_DELAY:
634 return "GNUNET_ATS_QUALITY_NET_DELAY";
635 case GNUNET_ATS_QUALITY_NET_DISTANCE:
636 return "GNUNET_ATS_QUALITY_NET_DISTANCE";
644 * Translate glpk status error codes to text
645 * @param retcode return code
646 * @return string with result
649 mlp_status_to_string (int retcode)
653 return "solution is undefined";
655 return "solution is feasible";
657 return "solution is infeasible";
659 return "no feasible solution exists";
661 return "solution is optimal";
663 return "solution is unbounded";
666 return "unknown error";
672 * Translate glpk solver error codes to text
673 * @param retcode return code
674 * @return string with result
677 mlp_solve_to_string (int retcode)
683 return "invalid basis";
685 return "singular matrix";
687 return "ill-conditioned matrix";
689 return "invalid bounds";
691 return "solver failed";
693 return "objective lower limit reached";
695 return "objective upper limit reached";
697 return "iteration limit exceeded";
699 return "time limit exceeded";
701 return "no primal feasible solution";
703 return "no dual feasible solution";
705 return "root LP optimum not provided";
707 return "search terminated by application";
709 return "relative mip gap tolerance reached";
711 return "no dual feasible solution";
713 return "no convergence";
715 return "numerical instability";
717 return "invalid data";
719 return "result out of range";
722 return "unknown error";
727 * Extract an ATS performance info from an address
729 * @param address the address
730 * @param type the type to extract in HBO
731 * @return the value in HBO or GNUNET_ATS_VALUE_UNDEFINED in HBO if value does not exist
734 get_performance_info (struct ATS_Address *address, uint32_t type)
737 GNUNET_assert (NULL != address);
739 if ((NULL == address->atsi) || (0 == address->atsi_count))
740 return GNUNET_ATS_VALUE_UNDEFINED;
742 for (c1 = 0; c1 < address->atsi_count; c1++)
744 if (ntohl (address->atsi[c1].type) == type)
745 return ntohl (address->atsi[c1].value);
747 return GNUNET_ATS_VALUE_UNDEFINED;
753 const struct GNUNET_CONTAINER_MultiPeerMap *map;
758 mlp_create_problem_count_addresses_it (void *cls,
759 const struct GNUNET_PeerIdentity *key,
762 struct CountContext *cctx = cls;
764 /* Check if we have to add this peer due to a pending request */
765 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
772 mlp_create_problem_count_addresses (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
773 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
775 struct CountContext cctx;
777 cctx.map = requested_peers;
779 GNUNET_CONTAINER_multipeermap_iterate (addresses,
780 &mlp_create_problem_count_addresses_it, &cctx);
786 mlp_create_problem_count_peers_it (void *cls,
787 const struct GNUNET_PeerIdentity *key,
790 struct CountContext *cctx = cls;
792 /* Check if we have to addresses for the requested peer */
793 if (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains (cctx->map, key))
800 mlp_create_problem_count_peers (const struct GNUNET_CONTAINER_MultiPeerMap *requested_peers,
801 const struct GNUNET_CONTAINER_MultiPeerMap *addresses)
803 struct CountContext cctx;
805 cctx.map = addresses;
807 GNUNET_CONTAINER_multipeermap_iterate (requested_peers,
808 &mlp_create_problem_count_peers_it, &cctx);
814 * Updates an existing value in the matrix
816 * Extract the row, updates the value and updates the row in the problem
818 * @param p the mlp problem
819 * @param row the row to create the value in
820 * @param col the column to create the value in
821 * @param val the value to set
822 * @param line calling line for debbuging
823 * @return GNUNET_YES value changed, GNUNET_NO value did not change, GNUNET_SYSERR
827 mlp_create_problem_update_value (struct MLP_Problem *p,
828 int row, int col, double val,
839 GNUNET_assert (NULL != p);
840 GNUNET_assert (NULL != p->prob);
842 /* Get number of columns and prepare data structure */
843 c_cols = glp_get_num_cols(p->prob);
845 return GNUNET_SYSERR;
847 val_array = GNUNET_malloc ((c_cols +1)* sizeof (double));
848 GNUNET_assert (NULL != val_array);
849 ind_array = GNUNET_malloc ((c_cols+1) * sizeof (int));
850 GNUNET_assert (NULL != ind_array);
851 /* Extract the row */
853 /* Update the value */
854 c_elems = glp_get_mat_row (p->prob, row, ind_array, val_array);
856 for (c1 = 1; c1 < (c_elems+1); c1++)
858 if (ind_array[c1] == col)
864 if (GNUNET_NO == found)
866 ind_array[c_elems+1] = col;
867 val_array[c_elems+1] = val;
868 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Setting value in [%s : %s] to `%.2f'\n",
869 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
871 glp_set_mat_row (p->prob, row, c_elems+1, ind_array, val_array);
872 GNUNET_free (ind_array);
873 GNUNET_free (val_array);
879 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P] Updating value in [%s : %s] from `%.2f' to `%.2f'\n",
880 glp_get_row_name (p->prob, row), glp_get_col_name (p->prob, col),
882 if (val != val_array[c1])
887 /* Update the row in the matrix */
888 glp_set_mat_row (p->prob, row, c_elems, ind_array, val_array);
891 GNUNET_free (ind_array);
892 GNUNET_free (val_array);
897 * Creates a new value in the matrix
899 * Sets the row and column index in the problem array and increments the
902 * @param p the mlp problem
903 * @param row the row to create the value in
904 * @param col the column to create the value in
905 * @param val the value to set
906 * @param line calling line for debbuging
909 mlp_create_problem_set_value (struct MLP_Problem *p,
910 int row, int col, double val,
913 if ((p->ci) >= p->num_elements)
915 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Request for index %u bigger than array size of %u\n",
916 line, p->ci + 1, p->num_elements);
920 if ((0 == row) || (0 == col))
923 LOG (GNUNET_ERROR_TYPE_ERROR, "[P]: Invalid call from line %u: row = %u, col = %u\n",
929 #if DEBUG_MLP_PROBLEM_CREATION
930 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: line %u: Set value [%u,%u] in index %u == %.2f\n",
931 line, p->ia[p->ci], p->ja[p->ci], p->ci, p->ar[p->ci]);
937 mlp_create_problem_create_column (struct MLP_Problem *p, char *name,
938 unsigned int type, unsigned int bound, double lb, double ub,
941 int col = glp_add_cols (p->prob, 1);
942 glp_set_col_name (p->prob, col, name);
943 glp_set_col_bnds (p->prob, col, bound, lb, ub);
944 glp_set_col_kind (p->prob, col, type);
945 glp_set_obj_coef (p->prob, col, coef);
946 #if DEBUG_MLP_PROBLEM_CREATION
947 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added column [%u] `%s': %.2f\n",
954 mlp_create_problem_create_constraint (struct MLP_Problem *p, char *name,
955 unsigned int bound, double lb, double ub)
958 int row = glp_add_rows (p->prob, 1);
960 glp_set_row_name (p->prob, row, name);
961 /* set row bounds: <= 0 */
962 glp_set_row_bnds (p->prob, row, bound, lb, ub);
966 GNUNET_asprintf(&op, "-inf <= x <= %.2f", ub);
969 GNUNET_asprintf(&op, "%.2f <= x <= %.2f", lb, ub);
972 GNUNET_asprintf(&op, "%.2f == x == %.2f", lb, ub);
975 GNUNET_asprintf(&op, "%.2f <= x <= inf", lb);
978 GNUNET_asprintf(&op, "ERROR");
981 #if DEBUG_MLP_PROBLEM_CREATION
982 LOG (GNUNET_ERROR_TYPE_DEBUG, "[P]: Added row [%u] `%s': %s\n",
991 * - address columns b and n
992 * - address dependent constraint rows c1, c3
993 * - peer dependent rows c2 and c9
994 * - Set address dependent entries in problem matrix as well
997 mlp_create_problem_add_address_information (void *cls,
998 const struct GNUNET_PeerIdentity *key,
1001 struct GAS_MLP_Handle *mlp = cls;
1002 struct MLP_Problem *p = &mlp->p;
1003 struct ATS_Address *address = value;
1004 struct ATS_Peer *peer;
1005 struct MLP_information *mlpi;
1007 const double *props;
1011 uint32_t addr_net_index;
1012 unsigned long long max_quota;
1015 /* Check if we have to add this peer due to a pending request */
1016 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains(mlp->requested_peers, key))
1019 mlpi = address->solver_information;
1022 fprintf (stderr, "%s %p\n",GNUNET_i2s (&address->peer), address);
1027 addr_net = get_performance_info (address, GNUNET_ATS_NETWORK_TYPE);
1028 for (addr_net_index = 0; addr_net_index < GNUNET_ATS_NetworkTypeCount; addr_net_index++)
1030 if (mlp->pv.quota_index[addr_net_index] == addr_net)
1034 if (addr_net_index >= GNUNET_ATS_NetworkTypeCount)
1041 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1043 if (mlp->pv.quota_out[c] > max_quota)
1044 max_quota = mlp->pv.quota_out[c];
1045 if (mlp->pv.quota_in[c] > max_quota)
1046 max_quota = mlp->pv.quota_in[c];
1048 if (max_quota > mlp->pv.BIG_M)
1049 cur_bigm = (double) mlp->pv.BIG_M;
1051 cur_bigm = max_quota;
1055 peer = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, key);
1056 GNUNET_assert (NULL != peer);
1057 if (peer->processed == GNUNET_NO)
1059 /* Add peer dependent constraints */
1060 /* Add c2) One address active per peer */
1061 GNUNET_asprintf(&name, "c2_%s", GNUNET_i2s(&address->peer));
1062 peer->r_c2 = mlp_create_problem_create_constraint (p, name, GLP_FX, 1.0, 1.0);
1064 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1066 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1068 /* Add c9) Relativity */
1069 GNUNET_asprintf(&name, "c9_%s", GNUNET_i2s(&address->peer));
1070 peer->r_c9 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1072 /* c9) set coefficient */
1073 mlp_create_problem_set_value (p, peer->r_c9, p->c_r, -peer->f , __LINE__);
1076 peer->processed = GNUNET_YES;
1079 /* Reset addresses' solver information */
1086 /* Add bandwidth column */
1087 GNUNET_asprintf (&name, "b_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1088 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1090 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 0.0);
1094 /* Maximize for bandwidth assignment in feasibility testing */
1095 mlpi->c_b = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, 1.0);
1099 /* Add address active column */
1100 GNUNET_asprintf (&name, "n_%s_%s_%p", GNUNET_i2s (&address->peer), address->plugin, address);
1101 mlpi->c_n = mlp_create_problem_create_column (p, name, GLP_IV, GLP_DB, 0.0, 1.0, 0.0);
1104 /* Add address dependent constraints */
1105 /* Add c1) bandwidth capping: b_t + (-M) * n_t <= 0 */
1106 GNUNET_asprintf(&name, "c1_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1107 mlpi->r_c1 = mlp_create_problem_create_constraint (p, name, GLP_UP, 0.0, 0.0);
1109 /* c1) set b = 1 coefficient */
1110 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_b, 1, __LINE__);
1111 /* c1) set n = - min (M, quota) coefficient */
1112 cur_bigm = (double) mlp->pv.quota_out[addr_net_index];
1113 if (cur_bigm > mlp->pv.BIG_M)
1114 cur_bigm = (double) mlp->pv.BIG_M;
1115 mlp_create_problem_set_value (p, mlpi->r_c1, mlpi->c_n, -cur_bigm, __LINE__);
1117 /* Add constraint c 3) minimum bandwidth
1118 * b_t + (-n_t * b_min) >= 0
1120 GNUNET_asprintf(&name, "c3_%s_%s_%p", GNUNET_i2s(&address->peer), address->plugin, address);
1121 mlpi->r_c3 = mlp_create_problem_create_constraint (p, name, GLP_LO, 0.0, 0.0);
1124 /* c3) set b = 1 coefficient */
1125 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_b, 1, __LINE__);
1126 /* c3) set n = -b_min coefficient */
1127 mlp_create_problem_set_value (p, mlpi->r_c3, mlpi->c_n, - ((double )mlp->pv.b_min), __LINE__);
1130 /* Set coefficient entries in invariant rows */
1134 /* c 4) minimum connections */
1135 mlp_create_problem_set_value (p, p->r_c4, mlpi->c_n, 1, __LINE__);
1136 /* c 2) 1 address peer peer */
1137 mlp_create_problem_set_value (p, peer->r_c2, mlpi->c_n, 1, __LINE__);
1138 /* c 10) obey network specific quotas
1139 * (1)*b_1 + ... + (1)*b_m <= quota_n
1141 mlp_create_problem_set_value (p, p->r_quota[addr_net_index], mlpi->c_b, 1, __LINE__);
1144 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1146 /* c 6) maximize diversity */
1147 mlp_create_problem_set_value (p, p->r_c6, mlpi->c_n, 1, __LINE__);
1148 /* c 9) relativity */
1149 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1150 mlp_create_problem_set_value (p, peer->r_c9, mlpi->c_b, 1, __LINE__);
1152 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1153 mlp_create_problem_set_value (p, p->r_c8, mlpi->c_b, 1, __LINE__);
1154 /* c 7) Optimize quality */
1155 /* For all quality metrics, set quality of this address */
1156 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1158 props = mlp->env->get_property (mlp->env->cls, address);
1159 for (c = 0; c < mlp->pv.m_q; c++)
1161 if ((props[c] < 1.0) && (props[c] > 2.0))
1163 fprintf (stderr, "PROP == %.3f \t ", props[c]);
1166 mlp_create_problem_set_value (p, p->r_q[c], mlpi->c_b, props[c], __LINE__);
1176 * Create the invariant columns c4, c6, c10, c8, c7
1179 mlp_create_problem_add_invariant_rows (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1185 /* Row for c4) minimum connection */
1186 /* Number of minimum connections is min(|Peers|, n_min) */
1187 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);
1189 /* Rows for c 10) Enforce network quotas */
1190 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
1193 GNUNET_asprintf(&text, "c10_quota_ats_%s",
1194 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]));
1195 p->r_quota[c] = mlp_create_problem_create_constraint (p, text, GLP_DB, 0.0, mlp->pv.quota_out[c]);
1200 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1203 /* Add row for c6) Maximize for diversity */
1204 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1206 p->r_c6 = mlp_create_problem_create_constraint (p, "c6", GLP_FX, 0.0, 0.0);
1207 /* Set c6 ) Setting -D */
1208 mlp_create_problem_set_value (p, p->r_c6, p->c_d, -1, __LINE__);
1211 /* Adding rows for c 8) Maximize utility */
1212 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1214 p->r_c8 = mlp_create_problem_create_constraint (p, "c8", GLP_FX, 0.0, 0.0);
1216 mlp_create_problem_set_value (p, p->r_c8, p->c_u, -1, __LINE__);
1219 /* For all quality metrics:
1220 * c 7) Maximize quality, austerity */
1221 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1223 for (c = 0; c < mlp->pv.m_q; c++)
1225 GNUNET_asprintf(&name, "c7_q%i_%s", c, mlp_ats_to_string(mlp->pv.q[c]));
1226 p->r_q[c] = mlp_create_problem_create_constraint (p, name, GLP_FX, 0.0, 0.0);
1228 mlp_create_problem_set_value (p, p->r_q[c], p->c_q[c], -1, __LINE__);
1236 * Create the invariant columns d, u, r, q0 ... qm
1239 mlp_create_problem_add_invariant_columns (struct GAS_MLP_Handle *mlp, struct MLP_Problem *p)
1241 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
1246 /* Diversity d column */
1247 if (GNUNET_YES == mlp->opt_dbg_optimize_diversity)
1248 p->c_d = mlp_create_problem_create_column (p, "d", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_D);
1250 /* Utilization u column */
1251 if (GNUNET_YES == mlp->opt_dbg_optimize_utility)
1252 p->c_u = mlp_create_problem_create_column (p, "u", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_U);
1254 /* Relativity r column */
1255 if (GNUNET_YES == mlp->opt_dbg_optimize_relativity)
1256 p->c_r = mlp_create_problem_create_column (p, "r", GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_R);
1258 /* Quality metric columns */
1259 if (GNUNET_YES == mlp->opt_dbg_optimize_quality)
1261 for (c = 0; c < mlp->pv.m_q; c++)
1263 GNUNET_asprintf (&name, "q_%u", mlp->pv.q[c]);
1264 p->c_q[c] = mlp_create_problem_create_column (p, name, GLP_CV, GLP_LO, 0.0, 0.0, mlp->pv.co_Q[c]);
1273 * Create the MLP problem
1275 * @param mlp the MLP handle
1276 * @return #GNUNET_OK or #GNUNET_SYSERR
1279 mlp_create_problem (struct GAS_MLP_Handle *mlp)
1281 struct MLP_Problem *p = &mlp->p;
1282 int res = GNUNET_OK;
1284 GNUNET_assert (p->prob == NULL);
1285 GNUNET_assert (p->ia == NULL);
1286 GNUNET_assert (p->ja == NULL);
1287 GNUNET_assert (p->ar == NULL);
1288 /* Reset MLP problem struct */
1290 /* create the glpk problem */
1291 p->prob = glp_create_prob ();
1292 GNUNET_assert (NULL != p->prob);
1293 p->num_peers = mlp_create_problem_count_peers (mlp->requested_peers, mlp->addresses);
1294 p->num_addresses = mlp_create_problem_count_addresses (mlp->requested_peers, mlp->addresses);
1296 /* Create problem matrix: 10 * #addresses + #q * #addresses + #q, + #peer + 2 + 1 */
1297 p->num_elements = (10 * p->num_addresses + mlp->pv.m_q * p->num_addresses +
1298 mlp->pv.m_q + p->num_peers + 2 + 1);
1299 LOG (GNUNET_ERROR_TYPE_DEBUG,
1300 "Rebuilding problem for %u peer(s) and %u addresse(s) and %u quality metrics == %u elements\n",
1306 /* Set a problem name */
1307 glp_set_prob_name (p->prob, "GNUnet ATS bandwidth distribution");
1308 /* Set optimization direction to maximize */
1309 glp_set_obj_dir (p->prob, GLP_MAX);
1311 /* Create problem matrix */
1312 /* last +1 caused by glpk index starting with one: [1..elements]*/
1315 p->ia = GNUNET_malloc (p->num_elements * sizeof (int));
1317 p->ja = GNUNET_malloc (p->num_elements * sizeof (int));
1319 p->ar = GNUNET_malloc (p->num_elements * sizeof (double));
1321 if ((NULL == p->ia) || (NULL == p->ja) || (NULL == p->ar))
1323 LOG (GNUNET_ERROR_TYPE_ERROR, _("Problem size too large, cannot allocate memory!\n"));
1324 return GNUNET_SYSERR;
1327 /* Adding invariant columns */
1328 mlp_create_problem_add_invariant_columns (mlp, p);
1330 /* Adding address independent constraint rows */
1331 mlp_create_problem_add_invariant_rows (mlp, p);
1333 /* Adding address dependent columns constraint rows */
1334 GNUNET_CONTAINER_multipeermap_iterate (mlp->addresses,
1335 &mlp_create_problem_add_address_information,
1338 /* Load the matrix */
1339 LOG (GNUNET_ERROR_TYPE_DEBUG, "Loading matrix\n");
1340 glp_load_matrix(p->prob, (p->ci)-1, p->ia, p->ja, p->ar);
1341 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
1343 glp_scale_prob (p->prob, GLP_SF_AUTO);
1351 * Solves the LP problem
1353 * @param mlp the MLP Handle
1354 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1357 mlp_solve_lp_problem (struct GAS_MLP_Handle *mlp)
1361 res = glp_simplex(mlp->p.prob, &mlp->control_param_lp);
1363 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem: %s\n",
1364 mlp_solve_to_string (res));
1366 LOG(GNUNET_ERROR_TYPE_DEBUG, "Solving LP problem failed: %s\n",
1367 mlp_solve_to_string (res));
1369 /* Analyze problem status */
1370 res_status = glp_get_status (mlp->p.prob);
1371 switch (res_status) {
1372 case GLP_OPT: /* solution is optimal */
1373 LOG (GNUNET_ERROR_TYPE_INFO,
1374 "Solving LP problem: %s, %s\n",
1375 mlp_solve_to_string(res),
1376 mlp_status_to_string(res_status));
1379 LOG (GNUNET_ERROR_TYPE_ERROR,
1380 "Solving LP problem failed: %s %s\n",
1381 mlp_solve_to_string(res),
1382 mlp_status_to_string(res_status));
1383 return GNUNET_SYSERR;
1389 * Propagates the results when MLP problem was solved
1391 * @param cls the MLP handle
1392 * @param key the peer identity
1393 * @param value the address
1394 * @return #GNUNET_OK to continue
1397 mlp_propagate_results (void *cls,
1398 const struct GNUNET_PeerIdentity *key,
1401 struct GAS_MLP_Handle *mlp = cls;
1402 struct ATS_Address *address;
1403 struct MLP_information *mlpi;
1404 double mlp_bw_in = MLP_NaN;
1405 double mlp_bw_out = MLP_NaN;
1406 double mlp_use = MLP_NaN;
1408 /* Check if we have to add this peer due to a pending request */
1409 if (GNUNET_NO == GNUNET_CONTAINER_multipeermap_contains (mlp->requested_peers,
1415 GNUNET_assert (address->solver_information != NULL);
1416 mlpi = address->solver_information;
1418 mlp_bw_in = glp_mip_col_val(mlp->p.prob, mlpi->c_b);/* FIXME */
1419 if (mlp_bw_in > (double) UINT32_MAX)
1421 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1422 mlp_bw_in = (double) UINT32_MAX;
1424 mlp_bw_out = glp_mip_col_val(mlp->p.prob, mlpi->c_b);
1425 if (mlp_bw_out > (double) UINT32_MAX)
1427 LOG (GNUNET_ERROR_TYPE_DEBUG, "Overflow in assigned bandwidth, reducing ...\n" );
1428 mlp_bw_out = (double) UINT32_MAX;
1430 mlp_use = glp_mip_col_val(mlp->p.prob, mlpi->c_n);
1434 * LOG (GNUNET_ERROR_TYPE_INFO, "MLP result address: `%s' `%s' length %u session %u, mlp use %.3f\n",
1435 * GNUNET_i2s(&address->peer), address->plugin,
1436 * address->addr_len, address->session_id);
1439 if (GLP_YES == mlp_use)
1441 /* This address was selected by the solver to be used */
1442 mlpi->n = GNUNET_YES;
1443 if (GNUNET_NO == address->active)
1445 /* Address was not used before, enabling address */
1446 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : enabling address\n",
1447 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1448 address->active = GNUNET_YES;
1449 address->assigned_bw_in = mlp_bw_in;
1450 mlpi->b_in = mlp_bw_in;
1451 address->assigned_bw_out = mlp_bw_out;
1452 mlpi->b_out = mlp_bw_out;
1453 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1454 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1457 else if (GNUNET_YES == address->active)
1459 /* Address was used before, check for bandwidth change */
1460 if ((mlp_bw_out != address->assigned_bw_out) ||
1461 (mlp_bw_in != address->assigned_bw_in))
1463 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : bandwidth changed\n",
1464 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1465 address->assigned_bw_in = mlp_bw_in;
1466 mlpi->b_in = mlp_bw_in;
1467 address->assigned_bw_out = mlp_bw_out;
1468 mlpi->b_out = mlp_bw_out;
1469 if ((NULL == mlp->exclude_peer) || (0 != memcmp (&address->peer, mlp->exclude_peer, sizeof (address->peer))))
1470 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
1477 else if (GLP_NO == mlp_use)
1479 /* This address was selected by the solver to be not used */
1480 mlpi->n = GNUNET_NO;
1481 if (GNUNET_NO == address->active)
1483 /* Address was not used before, nothing to do */
1484 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : no change\n",
1485 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1488 else if (GNUNET_YES == address->active)
1490 /* Address was used before, disabling address */
1491 LOG (GNUNET_ERROR_TYPE_DEBUG, "%s %.2f : disabling address\n",
1492 (1 == mlp_use) ? "[x]": "[ ]", mlp_bw_out);
1493 address->active = GNUNET_NO;
1494 /* Set bandwidth to 0 */
1495 address->assigned_bw_in = 0;
1497 address->assigned_bw_out = 0;
1512 notify (struct GAS_MLP_Handle *mlp,
1513 enum GAS_Solver_Operation op,
1514 enum GAS_Solver_Status stat,
1515 enum GAS_Solver_Additional_Information add)
1517 if (NULL != mlp->env->info_cb)
1518 mlp->env->info_cb (mlp->env->cls, op, stat, add);
1523 mlp_branch_and_cut_cb (glp_tree *tree, void *info)
1525 struct GAS_MLP_Handle *mlp = info;
1528 switch (glp_ios_reason (tree))
1531 /* Do nothing here */
1534 /* Do nothing here */
1537 /* Do nothing here */
1540 /* Do nothing here */
1543 /* Do nothing here */
1546 /* Do nothing here */
1549 /* A better solution was found */
1550 mlp->ps.mlp_gap = glp_ios_mip_gap (tree);
1551 mlp_obj = glp_mip_obj_val (mlp->p.prob);
1552 mlp->ps.lp_mlp_gap = (abs(mlp_obj - mlp->ps.lp_objective_value)) / (abs(mlp_obj) + DBL_EPSILON);
1554 LOG (GNUNET_ERROR_TYPE_INFO,
1555 "Found better integer solution, current gaps: %.3f <= %.3f, %.3f <= %.3f\n",
1556 mlp->ps.mlp_gap, mlp->pv.mip_gap,
1557 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1559 if (mlp->ps.mlp_gap <= mlp->pv.mip_gap)
1561 LOG (GNUNET_ERROR_TYPE_INFO,
1562 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1563 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1564 glp_ios_terminate (tree);
1567 if (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap)
1569 LOG (GNUNET_ERROR_TYPE_INFO,
1570 "Current LP/MLP gap of %.3f smaller than tolerated gap of %.3f, terminating search\n",
1571 mlp->ps.lp_mlp_gap, mlp->pv.lp_mip_gap);
1572 glp_ios_terminate (tree);
1584 * Solves the MLP problem
1586 * @param solver the MLP Handle
1587 * @return #GNUNET_OK if could be solved, #GNUNET_SYSERR on failure
1590 GAS_mlp_solve_problem (void *solver)
1592 struct GAS_MLP_Handle *mlp = solver;
1598 struct GNUNET_TIME_Absolute start_total;
1599 struct GNUNET_TIME_Absolute start_cur_op;
1600 struct GNUNET_TIME_Relative dur_total;
1601 struct GNUNET_TIME_Relative dur_setup;
1602 struct GNUNET_TIME_Relative dur_lp;
1603 struct GNUNET_TIME_Relative dur_mlp;
1605 GNUNET_assert(NULL != solver);
1607 if (GNUNET_YES == mlp->stat_bulk_lock)
1609 mlp->stat_bulk_requests++;
1612 notify(mlp, GAS_OP_SOLVE_START, GAS_STAT_SUCCESS,
1613 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1614 start_total = GNUNET_TIME_absolute_get();
1616 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->requested_peers))
1618 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1619 return GNUNET_OK; /* No pending requests */
1621 if (0 == GNUNET_CONTAINER_multipeermap_size(mlp->addresses))
1623 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1624 return GNUNET_OK; /* No addresses available */
1627 if ((GNUNET_NO == mlp->stat_mlp_prob_changed)
1628 && (GNUNET_NO == mlp->stat_mlp_prob_updated))
1630 LOG(GNUNET_ERROR_TYPE_DEBUG, "No changes to problem\n");
1631 notify(mlp, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS, GAS_INFO_NONE);
1634 if (GNUNET_YES == mlp->stat_mlp_prob_changed)
1636 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem size changed, rebuilding\n");
1637 notify(mlp, GAS_OP_SOLVE_SETUP_START, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1638 mlp_delete_problem(mlp);
1639 if (GNUNET_SYSERR == mlp_create_problem(mlp))
1641 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_FAIL, GAS_INFO_FULL);
1642 return GNUNET_SYSERR;
1644 notify(mlp, GAS_OP_SOLVE_SETUP_STOP, GAS_STAT_SUCCESS, GAS_INFO_FULL);
1645 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1647 mlp->control_param_lp.presolve = GLP_YES; /* LP presolver, we need lp solution */
1648 mlp->control_param_mlp.presolve = GNUNET_NO; /* No presolver, we have LP solution */
1652 mlp->control_param_lp.presolve = GNUNET_NO; /* LP presolver, we need lp solution */
1653 mlp->control_param_mlp.presolve = GLP_YES; /* No presolver, we have LP solution */
1654 dur_lp = GNUNET_TIME_UNIT_ZERO;
1659 LOG(GNUNET_ERROR_TYPE_DEBUG, "Problem was updated, resolving\n");
1662 /* Reset solution info */
1663 mlp->ps.lp_objective_value = 0.0;
1664 mlp->ps.mlp_gap = 1.0;
1665 mlp->ps.mlp_objective_value = 0.0;
1666 mlp->ps.lp_mlp_gap = 0.0;
1668 dur_setup = GNUNET_TIME_absolute_get_duration (start_total);
1671 if (GNUNET_NO == mlp->opt_dbg_intopt_presolver)
1673 notify(mlp, GAS_OP_SOLVE_MLP_LP_START, GAS_STAT_SUCCESS,
1674 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1675 LOG(GNUNET_ERROR_TYPE_DEBUG,
1676 "Running LP solver %s\n",
1677 (GLP_YES == mlp->control_param_lp.presolve)? "with presolver": "without presolver");
1678 start_cur_op = GNUNET_TIME_absolute_get();
1681 /* Only for debugging:
1682 * Always use LP presolver:
1683 * mlp->control_param_lp.presolve = GLP_YES; */
1684 res_lp = mlp_solve_lp_problem(mlp);
1685 if (GNUNET_OK == res_lp)
1687 mlp->ps.lp_objective_value = glp_get_obj_val (mlp->p.prob);
1688 LOG (GNUNET_ERROR_TYPE_DEBUG,
1689 "LP solution was: %.3f\n",
1690 mlp->ps.lp_objective_value);
1693 dur_lp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1694 notify(mlp, GAS_OP_SOLVE_MLP_LP_STOP,
1695 (GNUNET_OK == res_lp) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1696 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1699 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1702 /* Run MLP solver */
1703 if ((GNUNET_OK == res_lp) || (GNUNET_YES == mlp->opt_dbg_intopt_presolver))
1705 LOG(GNUNET_ERROR_TYPE_DEBUG, "Running MLP solver \n");
1706 notify(mlp, GAS_OP_SOLVE_MLP_MLP_START, GAS_STAT_SUCCESS,
1707 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1708 start_cur_op = GNUNET_TIME_absolute_get();
1712 /* Only for debugging, always use LP presolver */
1713 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
1714 mlp->control_param_mlp.presolve = GNUNET_YES;
1716 mip_res = glp_intopt (mlp->p.prob, &mlp->control_param_mlp);
1721 LOG (GNUNET_ERROR_TYPE_INFO,
1722 "Solving MLP problem: %s\n",
1723 mlp_solve_to_string (mip_res));
1725 case GLP_ETMLIM: /* Time limit reached */
1726 case GLP_EMIPGAP: /* MIP gap tolerance limit reached */
1727 case GLP_ESTOP: /* Solver was instructed to stop*/
1728 /* Semi-successful */
1729 LOG (GNUNET_ERROR_TYPE_INFO,
1730 "Solving MLP problem solution was interupted: %s\n",
1731 mlp_solve_to_string (mip_res));
1740 LOG (GNUNET_ERROR_TYPE_INFO,
1741 "Solving MLP problem failed: %s\n",
1742 mlp_solve_to_string (mip_res));
1746 /* Analyze problem status */
1747 mip_status = glp_mip_status(mlp->p.prob);
1750 case GLP_OPT: /* solution is optimal */
1751 LOG (GNUNET_ERROR_TYPE_WARNING,
1752 "Solution of MLP problem is optimal: %s, %s\n",
1753 mlp_solve_to_string (mip_res),
1754 mlp_status_to_string (mip_status));
1755 mip_res = GNUNET_OK;
1757 case GLP_FEAS: /* solution is feasible but not proven optimal */
1759 if ( (mlp->ps.mlp_gap <= mlp->pv.mip_gap) ||
1760 (mlp->ps.lp_mlp_gap <= mlp->pv.lp_mip_gap) )
1762 LOG (GNUNET_ERROR_TYPE_INFO,
1763 "Solution of MLP problem is feasible and solution within gap constraints: %s, %s\n",
1764 mlp_solve_to_string (mip_res),
1765 mlp_status_to_string (mip_status));
1766 mip_res = GNUNET_OK;
1770 LOG (GNUNET_ERROR_TYPE_WARNING,
1771 "Solution of MLP problem is feasible but solution not within gap constraints: %s, %s\n",
1772 mlp_solve_to_string (mip_res),
1773 mlp_status_to_string (mip_status));
1774 mip_res = GNUNET_SYSERR;
1777 case GLP_UNDEF: /* Solution undefined */
1778 case GLP_NOFEAS: /* No feasible solution */
1780 LOG (GNUNET_ERROR_TYPE_ERROR,
1781 "Solving MLP problem failed: %s %s\n",
1782 mlp_solve_to_string (mip_res),
1783 mlp_status_to_string (mip_status));
1784 mip_res = GNUNET_SYSERR;
1788 dur_mlp = GNUNET_TIME_absolute_get_duration (start_cur_op);
1789 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1791 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP,
1792 (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1793 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1797 /* Do not execute mip solver since lp solution is invalid */
1798 dur_mlp = GNUNET_TIME_UNIT_ZERO;
1799 dur_total = GNUNET_TIME_absolute_get_duration (start_total);
1801 notify(mlp, GAS_OP_SOLVE_MLP_MLP_STOP, GAS_STAT_FAIL,
1802 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1803 mip_res = GNUNET_SYSERR;
1806 /* Notify about end */
1807 notify(mlp, GAS_OP_SOLVE_STOP,
1808 ((GNUNET_OK == mip_res) && (GNUNET_OK == mip_res)) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1809 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? GAS_INFO_FULL : GAS_INFO_UPDATED);
1811 LOG (GNUNET_ERROR_TYPE_DEBUG,
1812 "Execution time for %s solve: (total/setup/lp/mlp) : %llu %llu %llu %llu\n",
1813 (GNUNET_YES == mlp->stat_mlp_prob_changed) ? "full" : "updated",
1814 (unsigned long long) dur_total.rel_value_us,
1815 (unsigned long long) dur_setup.rel_value_us,
1816 (unsigned long long) dur_lp.rel_value_us,
1817 (unsigned long long) dur_mlp.rel_value_us);
1820 mlp->ps.lp_res = res_lp;
1821 mlp->ps.mip_res = mip_res;
1822 mlp->ps.lp_presolv = mlp->control_param_lp.presolve;
1823 mlp->ps.mip_presolv = mlp->control_param_mlp.presolve;
1824 mlp->ps.p_cols = glp_get_num_cols(mlp->p.prob);
1825 mlp->ps.p_rows = glp_get_num_rows(mlp->p.prob);
1826 mlp->ps.p_elements = mlp->p.num_elements;
1828 /* Propagate result*/
1829 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
1830 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1832 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1834 GNUNET_CONTAINER_multipeermap_iterate(mlp->addresses,
1835 &mlp_propagate_results, mlp);
1837 notify (mlp, GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
1838 (GNUNET_OK == res_lp) && (GNUNET_OK == mip_res) ? GAS_STAT_SUCCESS : GAS_STAT_FAIL,
1841 struct GNUNET_TIME_Absolute time = GNUNET_TIME_absolute_get();
1842 if ( (GNUNET_YES == mlp->opt_dump_problem_all) ||
1843 (mlp->opt_dump_problem_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1845 /* Write problem to disk */
1846 switch (mlp->opt_log_format) {
1848 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.cplex", mlp->p.num_peers,
1849 mlp->p.num_addresses, time.abs_value_us);
1850 glp_write_lp (mlp->p.prob, NULL, filename);
1853 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.glpk", mlp->p.num_peers,
1854 mlp->p.num_addresses, time.abs_value_us);
1855 glp_write_prob (mlp->p.prob, 0, filename);
1858 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.mps", mlp->p.num_peers,
1859 mlp->p.num_addresses, time.abs_value_us);
1860 glp_write_mps (mlp->p.prob, GLP_MPS_FILE, NULL, filename);
1865 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped problem to file: `%s' \n", filename);
1866 GNUNET_free(filename);
1868 if ( (mlp->opt_dump_solution_all) ||
1869 (mlp->opt_dump_solution_on_fail && ((GNUNET_OK != res_lp) || (GNUNET_OK != mip_res))) )
1871 /* Write solution to disk */
1872 GNUNET_asprintf(&filename, "problem_p_%u_a%u_%llu.sol", mlp->p.num_peers,
1873 mlp->p.num_addresses, time.abs_value_us);
1874 glp_print_mip(mlp->p.prob, filename);
1875 LOG(GNUNET_ERROR_TYPE_ERROR, "Dumped solution to file: `%s' \n", filename);
1876 GNUNET_free(filename);
1879 /* Reset change and update marker */
1880 mlp->control_param_lp.presolve = GLP_NO;
1881 mlp->stat_mlp_prob_updated = GNUNET_NO;
1882 mlp->stat_mlp_prob_changed = GNUNET_NO;
1884 if ((GNUNET_OK == res_lp) && (GNUNET_OK == mip_res))
1887 return GNUNET_SYSERR;
1891 * Add a single address to the solve
1893 * @param solver the solver Handle
1894 * @param address the address to add
1895 * @param network network type of this address
1898 GAS_mlp_address_add (void *solver,
1899 struct ATS_Address *address,
1902 struct GAS_MLP_Handle *mlp = solver;
1904 GNUNET_assert (NULL != solver);
1905 GNUNET_assert (NULL != address);
1907 if (GNUNET_ATS_NetworkTypeCount <= network)
1913 if (NULL == address->solver_information)
1915 address->solver_information = GNUNET_new (struct MLP_information);
1918 LOG (GNUNET_ERROR_TYPE_ERROR,
1919 _("Adding address for peer `%s' multiple times\n"),
1920 GNUNET_i2s(&address->peer));
1922 /* Is this peer included in the problem? */
1924 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1927 /* FIXME: should this be an error? */
1928 LOG (GNUNET_ERROR_TYPE_DEBUG,
1929 "Adding address for peer `%s' without address request\n",
1930 GNUNET_i2s(&address->peer));
1934 LOG (GNUNET_ERROR_TYPE_DEBUG,
1935 "Adding address for peer `%s' with address request \n",
1936 GNUNET_i2s(&address->peer));
1937 /* Problem size changed: new address for peer with pending request */
1938 mlp->stat_mlp_prob_changed = GNUNET_YES;
1939 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
1940 GAS_mlp_solve_problem (solver);
1945 * Transport properties for this address have changed
1947 * @param solver solver handle
1948 * @param address the address
1949 * @param type the ATSI type in HBO
1950 * @param abs_value the absolute value of the property
1951 * @param rel_value the normalized value
1954 GAS_mlp_address_property_changed (void *solver,
1955 struct ATS_Address *address,
1960 struct MLP_information *mlpi = address->solver_information;
1961 struct GAS_MLP_Handle *mlp = solver;
1965 GNUNET_assert (NULL != solver);
1966 GNUNET_assert (NULL != address);
1970 LOG (GNUNET_ERROR_TYPE_INFO,
1971 _("Updating address property `%s' for peer `%s' %p not added before\n"),
1972 GNUNET_ATS_print_property_type (type),
1973 GNUNET_i2s(&address->peer),
1980 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
1983 /* Peer is not requested, so no need to update problem */
1986 LOG (GNUNET_ERROR_TYPE_INFO, "Updating property `%s' address for peer `%s' to abs %llu rel %.3f\n",
1987 GNUNET_ATS_print_property_type (type),
1988 GNUNET_i2s(&address->peer),
1992 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
1995 /* Find row index */
1997 for (c1 = 0; c1 < mlp->pv.m_q; c1++)
1999 if (type == mlp->pv.q[c1])
2005 if (-1 == type_index)
2008 return; /* quality index not found */
2011 /* Update c7) [r_q[index]][c_b] = f_q * q_averaged[type_index] */
2012 if (GNUNET_YES == mlp_create_problem_update_value (&mlp->p,
2013 mlp->p.r_q[type_index], mlpi->c_b, rel_value, __LINE__))
2015 mlp->stat_mlp_prob_updated = GNUNET_YES;
2016 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2017 GAS_mlp_solve_problem (solver);
2024 * Find the active address in the set of addresses of a peer
2025 * @param cls destination
2026 * @param key peer id
2027 * @param value address
2028 * @return #GNUNET_OK
2031 mlp_get_preferred_address_it (void *cls,
2032 const struct GNUNET_PeerIdentity *key,
2035 static int counter = 0;
2036 struct ATS_Address **aa = cls;
2037 struct ATS_Address *addr = value;
2038 struct MLP_information *mlpi = addr->solver_information;
2045 * GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
2046 * "MLP [%u] Peer `%s' %s length %u session %u active %s mlp active %s\n",
2047 * counter, GNUNET_i2s (&addr->peer), addr->plugin, addr->addr_len, addr->session_id,
2048 * (GNUNET_YES == addr->active) ? "active" : "inactive",
2049 * (GNUNET_YES == mlpi->n) ? "active" : "inactive");
2052 if (GNUNET_YES == mlpi->n)
2056 (*aa)->assigned_bw_in = mlpi->b_in;
2057 (*aa)->assigned_bw_out = mlpi->b_out;
2066 get_peer_pref_value (struct GAS_MLP_Handle *mlp,
2067 const struct GNUNET_PeerIdentity *peer)
2070 const double *preferences = NULL;
2073 preferences = mlp->env->get_preferences (mlp->env->cls, peer);
2075 for (c = 0; c < GNUNET_ATS_PreferenceCount; c++)
2077 if (c != GNUNET_ATS_PREFERENCE_END)
2079 /* fprintf (stderr, "VALUE[%u] %s %.3f \n",
2080 * c, GNUNET_i2s (&cur->addr->peer), t[c]); */
2081 res += preferences[c];
2085 res /= (GNUNET_ATS_PreferenceCount -1);
2088 LOG (GNUNET_ERROR_TYPE_DEBUG,
2089 "Peer preference for peer `%s' == %.2f\n",
2090 GNUNET_i2s(peer), res);
2097 * Get the preferred address for a specific peer
2099 * @param solver the MLP Handle
2100 * @param peer the peer
2101 * @return suggested address
2103 static const struct ATS_Address *
2104 GAS_mlp_get_preferred_address (void *solver,
2105 const struct GNUNET_PeerIdentity *peer)
2107 struct GAS_MLP_Handle *mlp = solver;
2109 struct ATS_Address *res;
2111 GNUNET_assert (NULL != solver);
2112 GNUNET_assert (NULL != peer);
2114 LOG (GNUNET_ERROR_TYPE_DEBUG, "Getting preferred address for `%s'\n",
2117 /* Is this peer included in the problem? */
2119 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2122 LOG (GNUNET_ERROR_TYPE_INFO, "Adding peer `%s' to list of requested_peers with requests\n",
2125 p = GNUNET_new (struct ATS_Peer);
2127 p->f = get_peer_pref_value (mlp, peer);
2128 GNUNET_CONTAINER_multipeermap_put (mlp->requested_peers,
2130 GNUNET_CONTAINER_MULTIHASHMAPOPTION_UNIQUE_FAST);
2132 /* Added new peer, we have to rebuild problem before solving */
2133 mlp->stat_mlp_prob_changed = GNUNET_YES;
2135 if ((GNUNET_YES == mlp->opt_mlp_auto_solve)&&
2136 (GNUNET_YES == GNUNET_CONTAINER_multipeermap_contains(mlp->addresses,
2139 mlp->exclude_peer = peer;
2140 GAS_mlp_solve_problem (mlp);
2141 mlp->exclude_peer = NULL;
2144 /* Get prefered address */
2146 GNUNET_CONTAINER_multipeermap_get_multiple (mlp->addresses, peer,
2147 &mlp_get_preferred_address_it, &res);
2153 * Deletes a single address in the MLP problem
2155 * The MLP problem has to be recreated and the problem has to be resolved
2157 * @param solver the MLP Handle
2158 * @param address the address to delete
2159 * @param session_only delete only session not whole address
2162 GAS_mlp_address_delete (void *solver,
2163 struct ATS_Address *address,
2166 struct GAS_MLP_Handle *mlp = solver;
2167 struct MLP_information *mlpi;
2170 GNUNET_assert (NULL != solver);
2171 GNUNET_assert (NULL != address);
2173 mlpi = address->solver_information;
2174 if ((GNUNET_NO == session_only) && (NULL != mlpi))
2176 /* Remove full address */
2178 address->solver_information = NULL;
2180 was_active = address->active;
2181 address->active = GNUNET_NO;
2182 address->assigned_bw_in = 0;
2183 address->assigned_bw_out = 0;
2185 /* Is this peer included in the problem? */
2187 GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers,
2190 LOG (GNUNET_ERROR_TYPE_INFO,
2191 "Deleting %s for peer `%s' without address request \n",
2192 (session_only == GNUNET_YES) ? "session" : "address",
2193 GNUNET_i2s(&address->peer));
2196 LOG (GNUNET_ERROR_TYPE_INFO, "Deleting %s for peer `%s' with address request \n",
2197 (session_only == GNUNET_YES) ? "session" : "address",
2198 GNUNET_i2s(&address->peer));
2200 /* Problem size changed: new address for peer with pending request */
2201 mlp->stat_mlp_prob_changed = GNUNET_YES;
2202 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2204 GAS_mlp_solve_problem (solver);
2206 if (GNUNET_YES == was_active)
2208 if (NULL == GAS_mlp_get_preferred_address (solver, &address->peer))
2210 /* No alternative address, disconnecting peer */
2211 mlp->env->bandwidth_changed_cb (mlp->env->cls, address);
2220 * Start a bulk operation
2222 * @param solver the solver
2225 GAS_mlp_bulk_start (void *solver)
2227 struct GAS_MLP_Handle *s = solver;
2229 LOG (GNUNET_ERROR_TYPE_DEBUG,
2230 "Locking solver for bulk operation ...\n");
2231 GNUNET_assert (NULL != solver);
2232 s->stat_bulk_lock ++;
2237 GAS_mlp_bulk_stop (void *solver)
2239 struct GAS_MLP_Handle *s = solver;
2241 LOG (GNUNET_ERROR_TYPE_DEBUG,
2242 "Unlocking solver from bulk operation ...\n");
2243 GNUNET_assert (NULL != solver);
2245 if (s->stat_bulk_lock < 1)
2250 s->stat_bulk_lock --;
2252 if (0 < s->stat_bulk_requests)
2254 GAS_mlp_solve_problem (solver);
2255 s->stat_bulk_requests= 0;
2262 * Stop notifying about address and bandwidth changes for this peer
2264 * @param solver the MLP handle
2265 * @param peer the peer
2268 GAS_mlp_stop_get_preferred_address (void *solver,
2269 const struct GNUNET_PeerIdentity *peer)
2271 struct GAS_MLP_Handle *mlp = solver;
2272 struct ATS_Peer *p = NULL;
2274 GNUNET_assert (NULL != solver);
2275 GNUNET_assert (NULL != peer);
2276 if (NULL != (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2278 GNUNET_assert (GNUNET_YES ==
2279 GNUNET_CONTAINER_multipeermap_remove (mlp->requested_peers, peer, p));
2282 mlp->stat_mlp_prob_changed = GNUNET_YES;
2283 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2285 GAS_mlp_solve_problem (solver);
2292 * Changes the preferences for a peer in the MLP problem
2294 * @param solver the MLP Handle
2295 * @param peer the peer
2296 * @param kind the kind to change the preference
2297 * @param pref_rel the relative score
2300 GAS_mlp_address_change_preference (void *solver,
2301 const struct GNUNET_PeerIdentity *peer,
2302 enum GNUNET_ATS_PreferenceKind kind,
2305 struct GAS_MLP_Handle *mlp = solver;
2308 LOG (GNUNET_ERROR_TYPE_DEBUG,
2309 "Changing preference for address for peer `%s' to %.2f\n",
2313 GNUNET_STATISTICS_update (mlp->env->stats,
2314 "# LP address preference changes", 1, GNUNET_NO);
2315 /* Update the constraints with changed preferences */
2319 /* Update relativity constraint c9 */
2320 if (NULL == (p = GNUNET_CONTAINER_multipeermap_get (mlp->requested_peers, peer)))
2322 LOG (GNUNET_ERROR_TYPE_INFO,
2323 "Updating preference for unknown peer `%s'\n",
2328 if (GNUNET_NO == mlp->opt_dbg_feasibility_only)
2330 p->f = get_peer_pref_value (mlp, peer);
2331 mlp_create_problem_update_value (&mlp->p,
2337 /* Problem size changed: new address for peer with pending request */
2338 mlp->stat_mlp_prob_updated = GNUNET_YES;
2339 if (GNUNET_YES == mlp->opt_mlp_auto_solve)
2340 GAS_mlp_solve_problem (solver);
2346 * Get application feedback for a peer
2348 * @param solver the solver handle
2349 * @param application the application
2350 * @param peer the peer to change the preference for
2351 * @param scope the time interval for this feedback: [now - scope .. now]
2352 * @param kind the kind to change the preference
2353 * @param score the score
2356 GAS_mlp_address_preference_feedback (void *solver,
2357 struct GNUNET_SERVER_Client *application,
2358 const struct GNUNET_PeerIdentity *peer,
2359 const struct GNUNET_TIME_Relative scope,
2360 enum GNUNET_ATS_PreferenceKind kind,
2363 struct GAS_PROPORTIONAL_Handle *s = solver;
2365 GNUNET_assert (NULL != solver);
2366 GNUNET_assert (NULL != peer);
2367 GNUNET_assert (NULL != s);
2372 mlp_free_peers (void *cls,
2373 const struct GNUNET_PeerIdentity *key, void *value)
2375 struct GNUNET_CONTAINER_MultiPeerMap *map = cls;
2376 struct ATS_Peer *p = value;
2378 GNUNET_assert (GNUNET_YES ==
2379 GNUNET_CONTAINER_multipeermap_remove (map, key, value));
2387 * Shutdown the MLP problem solving component
2389 * @param cls the solver handle
2393 libgnunet_plugin_ats_mlp_done (void *cls)
2395 struct GNUNET_ATS_SolverFunctions *sf = cls;
2396 struct GAS_MLP_Handle *mlp = sf->cls;
2398 LOG (GNUNET_ERROR_TYPE_DEBUG,
2399 "Shutting down mlp solver\n");
2400 mlp_delete_problem (mlp);
2401 GNUNET_CONTAINER_multipeermap_iterate (mlp->requested_peers,
2403 mlp->requested_peers);
2404 GNUNET_CONTAINER_multipeermap_destroy (mlp->requested_peers);
2405 mlp->requested_peers = NULL;
2407 /* Clean up GLPK environment */
2411 LOG (GNUNET_ERROR_TYPE_DEBUG,
2412 "Shutdown down of mlp solver complete\n");
2418 libgnunet_plugin_ats_mlp_init (void *cls)
2420 static struct GNUNET_ATS_SolverFunctions sf;
2421 struct GNUNET_ATS_PluginEnvironment *env = cls;
2422 struct GAS_MLP_Handle * mlp = GNUNET_new (struct GAS_MLP_Handle);
2425 unsigned long long tmp;
2433 struct GNUNET_TIME_Relative max_duration;
2434 long long unsigned int max_iterations;
2436 GNUNET_assert (NULL != env->cfg);
2437 GNUNET_assert (NULL != env->addresses);
2438 GNUNET_assert (NULL != env->bandwidth_changed_cb);
2439 GNUNET_assert (NULL != env->get_preferences);
2440 GNUNET_assert (NULL != env->get_property);
2442 /* Init GLPK environment */
2443 int res = glp_init_env();
2446 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2447 "initialization successful");
2450 LOG (GNUNET_ERROR_TYPE_DEBUG, "GLPK: `%s'\n",
2451 "environment is already initialized");
2454 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2455 "initialization failed (insufficient memory)");
2460 LOG (GNUNET_ERROR_TYPE_ERROR, "Could not init GLPK: `%s'\n",
2461 "initialization failed (unsupported programming model)");
2469 mlp->opt_dump_problem_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2470 "ats", "MLP_DUMP_PROBLEM_ALL");
2471 if (GNUNET_SYSERR == mlp->opt_dump_problem_all)
2472 mlp->opt_dump_problem_all = GNUNET_NO;
2474 mlp->opt_dump_solution_all = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2475 "ats", "MLP_DUMP_SOLUTION_ALL");
2476 if (GNUNET_SYSERR == mlp->opt_dump_solution_all)
2477 mlp->opt_dump_solution_all = GNUNET_NO;
2479 mlp->opt_dump_problem_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2480 "ats", "MLP_DUMP_PROBLEM_ON_FAIL");
2481 if (GNUNET_SYSERR == mlp->opt_dump_problem_on_fail)
2482 mlp->opt_dump_problem_on_fail = GNUNET_NO;
2484 mlp->opt_dump_solution_on_fail = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2485 "ats", "MLP_DUMP_SOLUTION_ON_FAIL");
2486 if (GNUNET_SYSERR == mlp->opt_dump_solution_on_fail)
2487 mlp->opt_dump_solution_on_fail = GNUNET_NO;
2489 mlp->opt_dbg_glpk_verbose = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2490 "ats", "MLP_DBG_GLPK_VERBOSE");
2491 if (GNUNET_SYSERR == mlp->opt_dbg_glpk_verbose)
2492 mlp->opt_dbg_glpk_verbose = GNUNET_NO;
2494 mlp->opt_dbg_feasibility_only = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2495 "ats", "MLP_DBG_FEASIBILITY_ONLY");
2496 if (GNUNET_SYSERR == mlp->opt_dbg_feasibility_only)
2497 mlp->opt_dbg_feasibility_only = GNUNET_NO;
2498 if (GNUNET_YES == mlp->opt_dbg_feasibility_only)
2499 LOG (GNUNET_ERROR_TYPE_WARNING,
2500 "MLP solver is configured to check feasibility only!\n");
2502 mlp->opt_dbg_autoscale_problem = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2503 "ats", "MLP_DBG_AUTOSCALE_PROBLEM");
2504 if (GNUNET_SYSERR == mlp->opt_dbg_autoscale_problem)
2505 mlp->opt_dbg_autoscale_problem = GNUNET_NO;
2506 if (GNUNET_YES == mlp->opt_dbg_autoscale_problem)
2507 LOG (GNUNET_ERROR_TYPE_WARNING,
2508 "MLP solver is configured automatically scale the problem!\n");
2510 mlp->opt_dbg_intopt_presolver = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2511 "ats", "MLP_DBG_INTOPT_PRESOLVE");
2512 if (GNUNET_SYSERR == mlp->opt_dbg_intopt_presolver)
2513 mlp->opt_dbg_intopt_presolver = GNUNET_NO;
2514 if (GNUNET_YES == mlp->opt_dbg_intopt_presolver)
2515 LOG (GNUNET_ERROR_TYPE_WARNING,
2516 "MLP solver is configured use the mlp presolver\n");
2518 mlp->opt_dbg_optimize_diversity = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2519 "ats", "MLP_DBG_OPTIMIZE_DIVERSITY");
2520 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_diversity)
2521 mlp->opt_dbg_optimize_diversity = GNUNET_YES;
2522 if (GNUNET_NO == mlp->opt_dbg_optimize_diversity)
2523 LOG (GNUNET_ERROR_TYPE_WARNING,
2524 "MLP solver is not optimizing for diversity\n");
2526 mlp->opt_dbg_optimize_relativity= GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2527 "ats", "MLP_DBG_OPTIMIZE_RELATIVITY");
2528 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_relativity)
2529 mlp->opt_dbg_optimize_relativity = GNUNET_YES;
2530 if (GNUNET_NO == mlp->opt_dbg_optimize_relativity)
2531 LOG (GNUNET_ERROR_TYPE_WARNING,
2532 "MLP solver is not optimizing for relativity\n");
2534 mlp->opt_dbg_optimize_quality = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2535 "ats", "MLP_DBG_OPTIMIZE_QUALITY");
2536 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_quality)
2537 mlp->opt_dbg_optimize_quality = GNUNET_YES;
2538 if (GNUNET_NO == mlp->opt_dbg_optimize_quality)
2539 LOG (GNUNET_ERROR_TYPE_WARNING,
2540 "MLP solver is not optimizing for quality\n");
2542 mlp->opt_dbg_optimize_utility = GNUNET_CONFIGURATION_get_value_yesno (env->cfg,
2543 "ats", "MLP_DBG_OPTIMIZE_UTILITY");
2544 if (GNUNET_SYSERR == mlp->opt_dbg_optimize_utility)
2545 mlp->opt_dbg_optimize_utility = GNUNET_YES;
2546 if (GNUNET_NO == mlp->opt_dbg_optimize_utility)
2547 LOG (GNUNET_ERROR_TYPE_WARNING,
2548 "MLP solver is not optimizing for utility\n");
2550 if ( (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2551 (GNUNET_NO == mlp->opt_dbg_optimize_quality) &&
2552 (GNUNET_NO == mlp->opt_dbg_optimize_relativity) &&
2553 (GNUNET_NO == mlp->opt_dbg_optimize_utility) &&
2554 (GNUNET_NO == mlp->opt_dbg_feasibility_only))
2556 LOG (GNUNET_ERROR_TYPE_ERROR,
2557 _("MLP solver is not optimizing for anything, changing to feasibility check\n"));
2558 mlp->opt_dbg_feasibility_only = GNUNET_YES;
2561 if (GNUNET_SYSERR == GNUNET_CONFIGURATION_get_value_string (env->cfg,
2562 "ats", "MLP_LOG_FORMAT", &outputformat))
2563 mlp->opt_log_format = MLP_CPLEX;
2566 GNUNET_STRINGS_utf8_toupper(outputformat, outputformat);
2567 if (0 == strcmp (outputformat, "MPS"))
2569 mlp->opt_log_format = MLP_MPS;
2571 else if (0 == strcmp (outputformat, "CPLEX"))
2573 mlp->opt_log_format = MLP_CPLEX;
2575 else if (0 == strcmp (outputformat, "GLPK"))
2577 mlp->opt_log_format = MLP_GLPK;
2581 LOG (GNUNET_ERROR_TYPE_WARNING,
2582 "Invalid log format `%s' in configuration, using CPLEX!\n",
2584 mlp->opt_log_format = MLP_CPLEX;
2586 GNUNET_free (outputformat);
2589 mlp->pv.BIG_M = (double) BIG_M_VALUE;
2591 mlp->pv.mip_gap = (double) 0.0;
2592 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2593 "MLP_MAX_MIP_GAP", &f_tmp))
2595 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2597 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2602 mlp->pv.mip_gap = f_tmp;
2603 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s of %.3f\n",
2608 mlp->pv.lp_mip_gap = (double) 0.0;
2609 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2610 "MLP_MAX_LP_MIP_GAP", &f_tmp))
2612 if ((f_tmp < 0.0) || (f_tmp > 1.0))
2614 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2619 mlp->pv.lp_mip_gap = f_tmp;
2620 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2625 /* Get timeout for iterations */
2626 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_time(env->cfg, "ats",
2627 "MLP_MAX_DURATION", &max_duration))
2629 max_duration = MLP_MAX_EXEC_DURATION;
2632 /* Get maximum number of iterations */
2633 if (GNUNET_OK != GNUNET_CONFIGURATION_get_value_size(env->cfg, "ats",
2634 "MLP_MAX_ITERATIONS", &max_iterations))
2636 max_iterations = MLP_MAX_ITERATIONS;
2639 /* Get diversity coefficient from configuration */
2640 mlp->pv.co_D = MLP_DEFAULT_D;
2641 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2642 "MLP_COEFFICIENT_D", &f_tmp))
2646 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2647 "MLP_COEFFICIENT_D", f_tmp);
2651 mlp->pv.co_D = f_tmp;
2652 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2653 "MLP_COEFFICIENT_D", f_tmp);
2657 /* Get relativity coefficient from configuration */
2658 mlp->pv.co_R = MLP_DEFAULT_R;
2659 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2660 "MLP_COEFFICIENT_R", &f_tmp))
2664 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2665 "MLP_COEFFICIENT_R", f_tmp);
2669 mlp->pv.co_R = f_tmp;
2670 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2671 "MLP_COEFFICIENT_R", f_tmp);
2676 /* Get utilization coefficient from configuration */
2677 mlp->pv.co_U = MLP_DEFAULT_U;
2678 if (GNUNET_SYSERR != GNUNET_CONFIGURATION_get_value_float (env->cfg, "ats",
2679 "MLP_COEFFICIENT_U", &f_tmp))
2683 LOG (GNUNET_ERROR_TYPE_ERROR, _("Invalid %s configuration %f \n"),
2684 "MLP_COEFFICIENT_U", f_tmp);
2688 mlp->pv.co_U = f_tmp;
2689 LOG (GNUNET_ERROR_TYPE_INFO, "Using %s gap of %.3f\n",
2690 "MLP_COEFFICIENT_U", f_tmp);
2694 /* Get quality metric coefficients from configuration */
2695 int i_delay = MLP_NaN;
2696 int i_distance = MLP_NaN;
2697 int q[GNUNET_ATS_QualityPropertiesCount] = GNUNET_ATS_QualityProperties;
2698 for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
2700 /* initialize quality coefficients with default value 1.0 */
2701 mlp->pv.co_Q[c] = MLP_DEFAULT_QUALITY;
2703 mlp->pv.q[c] = q[c];
2704 if (q[c] == GNUNET_ATS_QUALITY_NET_DELAY)
2706 if (q[c] == GNUNET_ATS_QUALITY_NET_DISTANCE)
2710 if ( (i_delay != MLP_NaN) &&
2711 (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2712 "MLP_COEFFICIENT_QUALITY_DELAY", &tmp)) )
2713 mlp->pv.co_Q[i_delay] = (double) tmp / 100;
2715 mlp->pv.co_Q[i_delay] = MLP_DEFAULT_QUALITY;
2717 if ( (i_distance != MLP_NaN) &&
2718 (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2719 "MLP_COEFFICIENT_QUALITY_DISTANCE", &tmp)) )
2720 mlp->pv.co_Q[i_distance] = (double) tmp / 100;
2722 mlp->pv.co_Q[i_distance] = MLP_DEFAULT_QUALITY;
2724 /* Get minimum bandwidth per used address from configuration */
2725 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2726 "MLP_MIN_BANDWIDTH",
2731 b_min = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
2734 /* Get minimum number of connections from configuration */
2735 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats",
2736 "MLP_MIN_CONNECTIONS",
2740 n_min = MLP_DEFAULT_MIN_CONNECTIONS;
2742 /* Init network quotas */
2743 int quotas[GNUNET_ATS_NetworkTypeCount] = GNUNET_ATS_NetworkType;
2744 for (c = 0; c < GNUNET_ATS_NetworkTypeCount; c++)
2747 for (c2 = 0; c2 < env->network_count; c2++)
2749 if (quotas[c] == env->networks[c2])
2751 mlp->pv.quota_index[c] = env->networks[c2];
2752 mlp->pv.quota_out[c] = env->out_quota[c2];
2753 mlp->pv.quota_in[c] = env->in_quota[c2];
2756 LOG (GNUNET_ERROR_TYPE_INFO,
2757 "Quota for network `%s' (in/out) %llu/%llu\n",
2758 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2759 mlp->pv.quota_out[c],
2760 mlp->pv.quota_in[c]);
2766 /* Check if defined quota could make problem unsolvable */
2767 if ((n_min * b_min) > mlp->pv.quota_out[c])
2769 LOG (GNUNET_ERROR_TYPE_INFO,
2770 _("Adjusting inconsistent outbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2771 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2772 mlp->pv.quota_out[c],
2774 mlp->pv.quota_out[c] = (n_min * b_min);
2776 if ((n_min * b_min) > mlp->pv.quota_in[c])
2778 LOG (GNUNET_ERROR_TYPE_INFO,
2779 _("Adjusting inconsistent inbound quota configuration for network `%s', is %llu must be at least %llu\n"),
2780 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2781 mlp->pv.quota_in[c],
2783 mlp->pv.quota_in[c] = (n_min * b_min);
2786 /* Check if bandwidth is too big to make problem solvable */
2787 if (mlp->pv.BIG_M < mlp->pv.quota_out[c])
2789 LOG (GNUNET_ERROR_TYPE_INFO,
2790 _("Adjusting outbound quota configuration for network `%s'from %llu to %.0f\n"),
2791 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2792 mlp->pv.quota_out[c],
2794 mlp->pv.quota_out[c] = mlp->pv.BIG_M ;
2796 if (mlp->pv.BIG_M < mlp->pv.quota_in[c])
2798 LOG (GNUNET_ERROR_TYPE_INFO, _("Adjusting inbound quota configuration for network `%s' from %llu to %.0f\n"),
2799 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2800 mlp->pv.quota_in[c],
2802 mlp->pv.quota_in[c] = mlp->pv.BIG_M ;
2805 if (GNUNET_NO == found)
2807 mlp->pv.quota_in[c] = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
2808 mlp->pv.quota_out[c] = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
2809 LOG (GNUNET_ERROR_TYPE_INFO, _("Using default quota configuration for network `%s' (in/out) %llu/%llu\n"),
2810 GNUNET_ATS_print_network_type(mlp->pv.quota_index[c]),
2811 mlp->pv.quota_in[c],
2812 mlp->pv.quota_out[c]);
2817 sf.s_add = &GAS_mlp_address_add;
2818 sf.s_address_update_property = &GAS_mlp_address_property_changed;
2819 sf.s_get = &GAS_mlp_get_preferred_address;
2820 sf.s_get_stop = &GAS_mlp_stop_get_preferred_address;
2821 sf.s_pref = &GAS_mlp_address_change_preference;
2822 sf.s_feedback = &GAS_mlp_address_preference_feedback;
2823 sf.s_del = &GAS_mlp_address_delete;
2824 sf.s_bulk_start = &GAS_mlp_bulk_start;
2825 sf.s_bulk_stop = &GAS_mlp_bulk_stop;
2827 /* Setting MLP Input variables */
2828 mlp->pv.b_min = b_min;
2829 mlp->pv.n_min = n_min;
2830 mlp->pv.m_q = GNUNET_ATS_QualityPropertiesCount;
2831 mlp->stat_mlp_prob_changed = GNUNET_NO;
2832 mlp->stat_mlp_prob_updated = GNUNET_NO;
2833 mlp->opt_mlp_auto_solve = GNUNET_YES;
2834 mlp->requested_peers = GNUNET_CONTAINER_multipeermap_create (10, GNUNET_NO);
2835 mlp->stat_bulk_requests = 0;
2836 mlp->stat_bulk_lock = 0;
2839 /* Redirect GLPK output to GNUnet logging */
2840 glp_term_hook (&mlp_term_hook, (void *) mlp);
2842 /* Init LP solving parameters */
2843 glp_init_smcp(&mlp->control_param_lp);
2844 mlp->control_param_lp.msg_lev = GLP_MSG_OFF;
2845 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2846 mlp->control_param_lp.msg_lev = GLP_MSG_ALL;
2848 mlp->control_param_lp.it_lim = max_iterations;
2849 mlp->control_param_lp.tm_lim = max_duration.rel_value_us / 1000LL;
2851 /* Init MLP solving parameters */
2852 glp_init_iocp(&mlp->control_param_mlp);
2853 /* Setting callback function */
2854 mlp->control_param_mlp.cb_func = &mlp_branch_and_cut_cb;
2855 mlp->control_param_mlp.cb_info = mlp;
2856 mlp->control_param_mlp.msg_lev = GLP_MSG_OFF;
2857 mlp->control_param_mlp.mip_gap = mlp->pv.mip_gap;
2858 if (GNUNET_YES == mlp->opt_dbg_glpk_verbose)
2859 mlp->control_param_mlp.msg_lev = GLP_MSG_ALL;
2860 mlp->control_param_mlp.tm_lim = max_duration.rel_value_us / 1000LL;
2862 LOG (GNUNET_ERROR_TYPE_DEBUG, "solver ready\n");
2867 /* end of plugin_ats_mlp.c */