2 This file is part of GNUnet.
3 (C) 2009, 2010 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 transport/transport_ats.c
23 * @brief automatic transport selection
24 * @author Matthias Wachs
29 #include "gnunet-service-transport_ats.h"
30 #include "gnunet_transport_service.h"
31 #include "gnunet_statistics_service.h"
32 #include "gnunet_container_lib.h"
38 /* LP/MIP problem object */
42 #ifndef GLP_PROB_DEFINED
43 #define GLP_PROB_DEFINED
46 double _opaque_prob[100];
51 { /* integer optimizer control parameters */
52 int msg_lev; /* message level (see glp_smcp) */
53 int br_tech; /* branching technique: */
54 #define GLP_BR_FFV 1 /* first fractional variable */
55 #define GLP_BR_LFV 2 /* last fractional variable */
56 #define GLP_BR_MFV 3 /* most fractional variable */
57 #define GLP_BR_DTH 4 /* heuristic by Driebeck and Tomlin */
58 #define GLP_BR_PCH 5 /* hybrid pseudocost heuristic */
59 int bt_tech; /* backtracking technique: */
60 #define GLP_BT_DFS 1 /* depth first search */
61 #define GLP_BT_BFS 2 /* breadth first search */
62 #define GLP_BT_BLB 3 /* best local bound */
63 #define GLP_BT_BPH 4 /* best projection heuristic */
64 double tol_int; /* mip.tol_int */
65 double tol_obj; /* mip.tol_obj */
66 int tm_lim; /* mip.tm_lim (milliseconds) */
67 int out_frq; /* mip.out_frq (milliseconds) */
68 int out_dly; /* mip.out_dly (milliseconds) */
70 void *cb_info; /* mip.cb_info */
71 int cb_size; /* mip.cb_size */
72 int pp_tech; /* preprocessing technique: */
73 #define GLP_PP_NONE 0 /* disable preprocessing */
74 #define GLP_PP_ROOT 1 /* preprocessing only on root level */
75 #define GLP_PP_ALL 2 /* preprocessing on all levels */
76 double mip_gap; /* relative MIP gap tolerance */
77 int mir_cuts; /* MIR cuts (GLP_ON/GLP_OFF) */
78 int gmi_cuts; /* Gomory's cuts (GLP_ON/GLP_OFF) */
79 int cov_cuts; /* cover cuts (GLP_ON/GLP_OFF) */
80 int clq_cuts; /* clique cuts (GLP_ON/GLP_OFF) */
81 int presolve; /* enable/disable using MIP presolver */
82 int binarize; /* try to binarize integer variables */
83 int fp_heur; /* feasibility pump heuristic */
85 int alien; /* use alien solver */
87 double foo_bar[29]; /* (reserved) */
91 { /* simplex method control parameters */
92 int msg_lev; /* message level: */
93 #define GLP_MSG_OFF 0 /* no output */
94 #define GLP_MSG_ERR 1 /* warning and error messages only */
95 #define GLP_MSG_ON 2 /* normal output */
96 #define GLP_MSG_ALL 3 /* full output */
97 #define GLP_MSG_DBG 4 /* debug output */
98 int meth; /* simplex method option: */
99 #define GLP_PRIMAL 1 /* use primal simplex */
100 #define GLP_DUALP 2 /* use dual; if it fails, use primal */
101 #define GLP_DUAL 3 /* use dual simplex */
102 int pricing; /* pricing technique: */
103 #define GLP_PT_STD 0x11 /* standard (Dantzig rule) */
104 #define GLP_PT_PSE 0x22 /* projected steepest edge */
105 int r_test; /* ratio test technique: */
106 #define GLP_RT_STD 0x11 /* standard (textbook) */
107 #define GLP_RT_HAR 0x22 /* two-pass Harris' ratio test */
108 double tol_bnd; /* spx.tol_bnd */
109 double tol_dj; /* spx.tol_dj */
110 double tol_piv; /* spx.tol_piv */
111 double obj_ll; /* spx.obj_ll */
112 double obj_ul; /* spx.obj_ul */
113 int it_lim; /* spx.it_lim */
114 int tm_lim; /* spx.tm_lim (milliseconds) */
115 int out_frq; /* spx.out_frq */
116 int out_dly; /* spx.out_dly (milliseconds) */
117 int presolve; /* enable/disable using LP presolver */
118 double foo_bar[36]; /* (reserved) */
121 /* optimization direction flag: */
122 #define GLP_MIN 1 /* minimization */
123 #define GLP_MAX 2 /* maximization */
125 /* kind of structural variable: */
126 #define GLP_CV 1 /* continuous variable */
127 #define GLP_IV 2 /* integer variable */
128 #define GLP_BV 3 /* binary variable */
130 /* type of auxiliary/structural variable: */
131 #define GLP_FR 1 /* free variable */
132 #define GLP_LO 2 /* variable with lower bound */
133 #define GLP_UP 3 /* variable with upper bound */
134 #define GLP_DB 4 /* double-bounded variable */
135 #define GLP_FX 5 /* fixed variable */
137 /* solution indicator: */
138 #define GLP_SOL 1 /* basic solution */
139 #define GLP_IPT 2 /* interior-point solution */
140 #define GLP_MIP 3 /* mixed integer solution */
142 /* solution status: */
143 #define GLP_UNDEF 1 /* solution is undefined */
144 #define GLP_FEAS 2 /* solution is feasible */
145 #define GLP_INFEAS 3 /* solution is infeasible */
146 #define GLP_NOFEAS 4 /* no feasible solution exists */
147 #define GLP_OPT 5 /* solution is optimal */
148 #define GLP_UNBND 6 /* solution is unbounded */
151 #define GLP_EBADB 0x01 /* invalid basis */
152 #define GLP_ESING 0x02 /* singular matrix */
153 #define GLP_ECOND 0x03 /* ill-conditioned matrix */
154 #define GLP_EBOUND 0x04 /* invalid bounds */
155 #define GLP_EFAIL 0x05 /* solver failed */
156 #define GLP_EOBJLL 0x06 /* objective lower limit reached */
157 #define GLP_EOBJUL 0x07 /* objective upper limit reached */
158 #define GLP_EITLIM 0x08 /* iteration limit exceeded */
159 #define GLP_ETMLIM 0x09 /* time limit exceeded */
160 #define GLP_ENOPFS 0x0A /* no primal feasible solution */
161 #define GLP_ENODFS 0x0B /* no dual feasible solution */
162 #define GLP_EROOT 0x0C /* root LP optimum not provided */
163 #define GLP_ESTOP 0x0D /* search terminated by application */
164 #define GLP_EMIPGAP 0x0E /* relative mip gap tolerance reached */
165 #define GLP_ENOFEAS 0x0F /* no primal/dual feasible solution */
166 #define GLP_ENOCVG 0x10 /* no convergence */
167 #define GLP_EINSTAB 0x11 /* numerical instability */
168 #define GLP_EDATA 0x12 /* invalid data */
169 #define GLP_ERANGE 0x13 /* result out of range */
171 /* enable/disable flag: */
172 #define GLP_ON 1 /* enable something */
173 #define GLP_OFF 0 /* disable something */
178 * Wrappers for GLPK Functions
183 _lp_create_prob (void)
186 return glp_create_prob ();
188 // Function not implemented
195 _lp_set_obj_dir (glp_prob *P, int dir)
198 return glp_set_obj_dir (P, dir);
200 // Function not implemented
206 _lp_set_prob_name (glp_prob *P, const char *name)
209 glp_set_prob_name (P, name);
211 // Function not implemented
217 _lp_add_cols (glp_prob *P, int ncs)
220 return glp_add_cols (P, ncs);
222 // Function not implemented
229 _lp_add_rows (glp_prob *P, int nrs)
232 return glp_add_rows (P, nrs);
234 // Function not implemented
242 _lp_set_row_bnds (glp_prob *P, int i, int type, double lb, double ub)
245 glp_set_row_bnds (P, i, type, lb, ub);
247 // Function not implemented
253 _lp_init_smcp (void *parm)
256 glp_init_smcp (parm);
258 // Function not implemented
264 _lp_set_col_name (glp_prob *P, int j, const char *name)
267 glp_set_col_name (P, j, name);
269 // Function not implemented
275 _lp_set_col_bnds (glp_prob *P, int j, int type, double lb, double ub)
278 glp_set_col_bnds (P, j, type, lb, ub);
280 // Function not implemented
286 _lp_set_obj_coef (glp_prob *P, int j, double coef)
289 glp_set_obj_coef (P, j, coef);
291 // Function not implemented
297 _lp_delete_prob (void *P)
302 // Function not implemented
308 _lp_simplex (glp_prob *P, void *parm)
311 return glp_simplex (P, parm);
313 // Function not implemented
320 _lp_load_matrix (glp_prob *P, int ne, const int ia[], const int ja[],
324 glp_load_matrix (P, ne, ia, ja, ar);
326 // Function not implemented
332 _lp_set_mat_row (glp_prob *P, int i, int len, const int ind[],
336 glp_set_mat_row (P, i, len, ind, val);
338 // Function not implemented
344 _lp_write_lp (glp_prob *P, const void *parm, const char *fname)
347 return glp_write_lp (P, parm, fname);
349 // Function not implemented
356 _lp_init_iocp (void *parm)
359 glp_init_iocp (parm);
361 // Function not implemented
367 _lp_intopt (glp_prob *P, const void *parm)
370 return glp_intopt (P, parm);
372 // Function not implemented
379 _lp_get_status (glp_prob *P)
382 return glp_get_status (P);
384 // Function not implemented
391 _lp_mip_status (glp_prob *P)
394 return glp_mip_status (P);
396 // Function not implemented
403 _lp_set_col_kind (glp_prob *P, int j, int kind)
406 glp_set_col_kind (P, j, kind);
408 // Function not implemented
419 // Function not implemented
425 _lp_get_col_name (glp_prob *P, int j)
428 return glp_get_col_name (P, j);
430 // Function not implemented
437 _lp_mip_obj_val (glp_prob *P)
440 return glp_mip_obj_val (P);
442 // Function not implemented
450 _lp_get_col_prim (glp_prob *P, int j)
453 return glp_get_col_prim (P, j);
455 // Function not implemented
462 _lp_print_sol (glp_prob *P, const char *fname)
466 // Function not implemented
473 * Dummy functions for CFLAGS
476 static void _dummy2 ();
481 _lp_get_col_name (NULL, 0);
482 _lp_mip_obj_val (NULL);
483 _lp_get_col_prim (NULL, 0);
484 _lp_set_mat_row (NULL, 0, 0, NULL, NULL);
493 ats_modify_problem_state (NULL, 0);
494 qm[1].atis_index = 0;
496 int t = ATS_COST_UPDATED + ATS_MODIFIED + ATS_NEW;
508 * @param cfg configuration handle to retrieve configuration (to be removed)
513 ats_init (double D, double U, double R, int v_b_min, int v_n_min,
514 int max_iterations, struct GNUNET_TIME_Relative max_duration,
515 GNUNET_TRANSPORT_ATS_AddressNotification address_not,
516 GNUNET_TRANSPORT_ATS_ResultCallback res_cb)
518 struct ATS_Handle *ats = NULL;
520 ats = GNUNET_malloc (sizeof (struct ATS_Handle));
524 ats->addr_notification = address_not;
525 ats->result_cb = res_cb;
527 ats->max_iterations = max_iterations;
528 ats->max_exec_duration = max_duration;
533 ats->v_b_min = v_b_min;
534 ats->v_n_min = v_n_min;
535 ats->dump_min_peers = 0;
536 ats->dump_min_addr = 0;
537 ats->dump_overwrite = GNUNET_NO;
538 ats->mechanisms = NULL;
540 ats->successful_executions = 0;
541 ats->invalid_executions = 0;
547 /** solve the bandwidth distribution problem
548 * @param max_it maximum iterations
549 * @param max_dur maximum duration in ms
550 * @param D weight for diversity
551 * @param U weight for utility
552 * @param R weight for relativity
553 * @param v_b_min minimal bandwidth per peer
554 * @param v_n_min minimum number of connections
555 * @param stat result struct
556 * @return GNUNET_SYSERR if glpk is not available, number of mechanisms used
559 ats_create_problem (struct ATS_Handle *ats, struct ATS_internals *stat,
560 struct ATS_peer *peers, int c_p,
561 struct ATS_mechanism *mechanisms, int c_m)
563 if ((c_p == 0) || (c_m == 0))
564 return GNUNET_SYSERR;
566 ats->prob = _lp_create_prob ();
569 int c_c_ressources = available_ressources;
570 int c_q_metrics = available_quality_metrics;
572 double M = VERY_BIG_DOUBLE_VALUE;
573 double Q[c_q_metrics + 1];
575 for (c = 1; c <= c_q_metrics; c++)
580 if (ats->v_n_min > c_p)
583 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
584 "Creating problem with: %i peers, %i mechanisms, %i resource entries, %i quality metrics \n",
585 c_p, c_m, c_c_ressources, c_q_metrics);
589 1 + 3 + 10 * c_m + c_p + (c_q_metrics * c_m) + c_q_metrics +
590 c_c_ressources * c_m;
593 int *ia = GNUNET_malloc (size * sizeof (int));
594 int *ja = GNUNET_malloc (size * sizeof (int));
595 double *ar = GNUNET_malloc (size * sizeof (double));
597 _lp_set_prob_name (ats->prob, "gnunet ats bandwidth distribution");
598 _lp_set_obj_dir (ats->prob, GLP_MAX);
603 _lp_add_cols (ats->prob, 2 * c_m);
604 /* adding b_t cols */
605 for (c = 1; c <= c_m; c++)
607 GNUNET_asprintf (&name, "p_%s_b%i",
608 GNUNET_i2s (&(mechanisms[c].peer->peer)), c);
609 _lp_set_col_name (ats->prob, c, name);
611 _lp_set_col_bnds (ats->prob, c, GLP_LO, 0.0, 0.0);
612 _lp_set_col_kind (ats->prob, c, GLP_CV);
613 _lp_set_obj_coef (ats->prob, c, 0);
616 /* adding n_t cols */
617 for (c = c_m + 1; c <= 2 * c_m; c++)
619 GNUNET_asprintf (&name, "p_%s_n%i",
620 GNUNET_i2s (&(mechanisms[c - c_m].peer->peer)), (c - c_m));
621 _lp_set_col_name (ats->prob, c, name);
623 _lp_set_col_bnds (ats->prob, c, GLP_DB, 0.0, 1.0);
624 _lp_set_col_kind (ats->prob, c, GLP_IV);
625 _lp_set_obj_coef (ats->prob, c, 0);
628 /* feasibility constraints */
629 /* Constraint 1: one address per peer */
632 _lp_add_rows (ats->prob, c_p);
634 for (c = 1; c <= c_p; c++)
637 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
640 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 1.0, 1.0);
641 struct ATS_mechanism *m = peers[c].m_head;
645 ia[array_index] = row_index;
646 ja[array_index] = (c_m + m->col_index);
649 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
650 array_index, ia[array_index], ja[array_index],
659 /* Constraint 2: only active mechanism gets bandwidth assigned */
660 _lp_add_rows (ats->prob, c_m);
661 for (c = 1; c <= c_m; c++)
663 /* b_t - n_t * M <= 0 */
665 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
667 _lp_set_row_bnds (ats->prob, row_index, GLP_UP, 0.0, 0.0);
668 ia[array_index] = row_index;
669 ja[array_index] = mechanisms[c].col_index;
672 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
673 array_index, ia[array_index], ja[array_index], ar[array_index]);
676 ia[array_index] = row_index;
677 ja[array_index] = c_m + mechanisms[c].col_index;
678 ar[array_index] = -M;
680 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
681 array_index, ia[array_index], ja[array_index], ar[array_index]);
687 /* Constraint 3: minimum bandwidth */
688 _lp_add_rows (ats->prob, c_m);
690 for (c = 1; c <= c_m; c++)
692 /* b_t - n_t * b_min <= 0 */
694 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
697 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, 0.0, 0.0);
699 ia[array_index] = row_index;
700 ja[array_index] = mechanisms[c].col_index;
703 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
704 array_index, ia[array_index], ja[array_index], ar[array_index]);
707 ia[array_index] = row_index;
708 ja[array_index] = c_m + mechanisms[c].col_index;
709 ar[array_index] = -ats->v_b_min;
711 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
712 array_index, ia[array_index], ja[array_index], ar[array_index]);
719 /* Constraint 4: max ressource capacity */
720 /* V cr: bt * ct_r <= cr_max
723 _lp_add_rows (ats->prob, available_ressources);
725 double ct_max = VERY_BIG_DOUBLE_VALUE;
728 stat->begin_cr = array_index;
730 for (c = 0; c < available_ressources; c++)
732 ct_max = ressources[c].c_max;
733 ct_min = ressources[c].c_min;
735 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] %f..%f\n",
736 row_index, ct_min, ct_max);
739 _lp_set_row_bnds (ats->prob, row_index, GLP_DB, ct_min, ct_max);
741 for (c2 = 1; c2 <= c_m; c2++)
745 ia[array_index] = row_index;
746 ja[array_index] = c2;
747 value = mechanisms[c2].ressources[c].c;
748 ar[array_index] = value;
750 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
751 array_index, ia[array_index], ja[array_index],
758 stat->end_cr = array_index--;
760 /* Constraint 5: min number of connections */
761 _lp_add_rows (ats->prob, 1);
763 for (c = 1; c <= c_m; c++)
765 // b_t - n_t * b_min >= 0
767 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
769 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, ats->v_n_min, 0.0);
770 ia[array_index] = row_index;
771 ja[array_index] = c_m + mechanisms[c].col_index;
774 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
775 array_index, ia[array_index], ja[array_index], ar[array_index]);
781 // optimisation constraints
785 // Constraint 6: optimize for diversity
788 col_d = _lp_add_cols (ats->prob, 1);
790 _lp_set_col_name (ats->prob, col_d, "d");
791 _lp_set_obj_coef (ats->prob, col_d, ats->D);
792 _lp_set_col_bnds (ats->prob, col_d, GLP_LO, 0.0, 0.0);
793 _lp_add_rows (ats->prob, 1);
794 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
798 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
800 for (c = 1; c <= c_m; c++)
802 ia[array_index] = row_index;
803 ja[array_index] = c_m + mechanisms[c].col_index;
806 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
807 array_index, ia[array_index], ja[array_index], ar[array_index]);
811 ia[array_index] = row_index;
812 ja[array_index] = col_d;
813 ar[array_index] = -1;
815 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
816 array_index, ia[array_index], ja[array_index], ar[array_index]);
821 // Constraint 7: optimize for quality
824 col_qm = _lp_add_cols (ats->prob, c_q_metrics);
826 stat->col_qm = col_qm;
827 //GNUNET_assert (col_qm == (2*c_mechs) + 3 + 1);
828 for (c = 0; c < c_q_metrics; c++)
830 GNUNET_asprintf (&name, "Q_%s", qm[c].name);
831 _lp_set_col_name (ats->prob, col_qm + c, name);
832 _lp_set_col_bnds (ats->prob, col_qm + c, GLP_LO, 0.0, 0.0);
834 _lp_set_obj_coef (ats->prob, col_qm + c, Q[c]);
837 _lp_add_rows (ats->prob, available_quality_metrics);
839 stat->begin_qm = row_index;
840 for (c = 1; c <= c_q_metrics; c++)
843 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
847 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
848 for (c2 = 1; c2 <= c_m; c2++)
850 ia[array_index] = row_index;
851 ja[array_index] = c2;
852 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY)
854 double v0 = 0, v1 = 0, v2 = 0;
856 v0 = mechanisms[c2].quality[c - 1].values[0];
859 v1 = mechanisms[c2].quality[c - 1].values[1];
862 v2 = mechanisms[c2].quality[c - 1].values[2];
865 value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0);
868 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE)
870 double v0 = 0, v1 = 0, v2 = 0;
872 v0 = mechanisms[c2].quality[c - 1].values[0];
875 v1 = mechanisms[c2].quality[c - 1].values[1];
878 v2 = mechanisms[c2].quality[c - 1].values[2];
881 value = (v0 + 2 * v1 + 3 * v2) / 6.0;
883 value = (double) 10 / value;
887 ar[array_index] = (mechanisms[c2].peer->f) * value;
889 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n",
890 array_index, qm[c - 1].name, ia[array_index], ja[array_index],
895 ia[array_index] = row_index;
896 ja[array_index] = col_qm + c - 1;
897 ar[array_index] = -1;
899 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
900 array_index, ia[array_index], ja[array_index], ar[array_index]);
905 stat->end_qm = row_index - 1;
907 // Constraint 8: optimize bandwidth utility
910 col_u = _lp_add_cols (ats->prob, 1);
912 _lp_set_col_name (ats->prob, col_u, "u");
913 _lp_set_obj_coef (ats->prob, col_u, ats->U);
914 _lp_set_col_bnds (ats->prob, col_u, GLP_LO, 0.0, 0.0);
915 _lp_add_rows (ats->prob, 1);
918 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
920 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
921 for (c = 1; c <= c_m; c++)
923 ia[array_index] = row_index;
925 ar[array_index] = mechanisms[c].peer->f;
927 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
928 array_index, ia[array_index], ja[array_index], ar[array_index]);
932 ia[array_index] = row_index;
933 ja[array_index] = col_u;
934 ar[array_index] = -1;
936 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
937 array_index, ia[array_index], ja[array_index], ar[array_index]);
943 // Constraint 9: optimize relativity
946 col_r = _lp_add_cols (ats->prob, 1);
948 _lp_set_col_name (ats->prob, col_r, "r");
949 _lp_set_obj_coef (ats->prob, col_r, ats->R);
950 _lp_set_col_bnds (ats->prob, col_r, GLP_LO, 0.0, 0.0);
951 _lp_add_rows (ats->prob, c_p);
954 for (c = 1; c <= c_p; c++)
956 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, 0.0, 0.0);
957 struct ATS_mechanism *m = peers[c].m_head;
961 ia[array_index] = row_index;
962 ja[array_index] = m->col_index;
963 ar[array_index] = 1 / mechanisms[c].peer->f;
965 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
966 array_index, ia[array_index], ja[array_index],
972 ia[array_index] = row_index;
973 ja[array_index] = col_r;
974 ar[array_index] = -1;
976 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
977 array_index, ia[array_index], ja[array_index], ar[array_index]);
983 /* Loading the matrix */
984 _lp_load_matrix (ats->prob, array_index - 1, ia, ja, ar);
989 stat->valid = GNUNET_YES;
1001 ats_delete_problem (struct ATS_Handle *ats)
1004 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Deleting problem\n");
1008 for (c = 0; c < (ats->internal).c_mechs; c++)
1009 GNUNET_free_non_null (ats->mechanisms[c].rc);
1010 if (ats->mechanisms != NULL)
1012 GNUNET_free (ats->mechanisms);
1013 ats->mechanisms = NULL;
1016 if (ats->peers != NULL)
1018 GNUNET_free (ats->peers);
1022 if (ats->prob != NULL)
1024 _lp_delete_prob (ats->prob);
1028 ats->internal.begin_cr = GNUNET_SYSERR;
1029 ats->internal.begin_qm = GNUNET_SYSERR;
1030 ats->internal.c_mechs = 0;
1031 ats->internal.c_peers = 0;
1032 ats->internal.end_cr = GNUNET_SYSERR;
1033 ats->internal.end_qm = GNUNET_SYSERR;
1034 ats->internal.solution = GNUNET_SYSERR;
1035 ats->internal.valid = GNUNET_SYSERR;
1039 ats_modify_problem_state (struct ATS_Handle *ats, enum ATS_problem_state s)
1046 ats->internal.recreate_problem = GNUNET_NO;
1047 ats->internal.modified_quality = GNUNET_NO;
1048 ats->internal.modified_resources = GNUNET_NO;
1051 ats->internal.recreate_problem = GNUNET_YES;
1053 case ATS_QUALITY_UPDATED:
1054 ats->internal.modified_quality = GNUNET_YES;
1056 case ATS_COST_UPDATED:
1057 ats->internal.modified_resources = GNUNET_YES;
1059 case ATS_QUALITY_COST_UPDATED:
1060 ats->internal.modified_resources = GNUNET_YES;
1061 ats->internal.modified_quality = GNUNET_YES;
1072 ats_solve_problem (struct ATS_Handle *ats, unsigned int max_it,
1073 unsigned int max_dur, unsigned int c_peers,
1074 unsigned int c_mechs, struct ATS_internals *stat)
1076 int result = GNUNET_SYSERR;
1077 int lp_solution = GNUNET_SYSERR;
1078 int mlp_solution = GNUNET_SYSERR;
1084 _lp_init_smcp (&opt_lp);
1086 opt_lp.msg_lev = GLP_MSG_ALL;
1088 opt_lp.msg_lev = GLP_MSG_OFF;
1090 // setting iteration limit
1091 opt_lp.it_lim = max_it;
1093 opt_lp.tm_lim = max_dur;
1095 if (ats->internal.recreate_problem == GNUNET_YES)
1096 opt_lp.presolve = GLP_ON;
1098 result = _lp_simplex (ats->prob, &opt_lp);
1099 lp_solution = _lp_get_status (ats->prob);
1101 if ((result == GLP_ETMLIM) || (result == GLP_EITLIM))
1103 ats->internal.valid = GNUNET_NO;
1104 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1105 "ATS exceeded time or iteration limit!\n");
1109 if (ats_evaluate_results (result, lp_solution, "LP") == GNUNET_YES)
1111 stat->valid = GNUNET_YES;
1115 ats->internal.simplex_rerun_required = GNUNET_YES;
1116 opt_lp.presolve = GLP_ON;
1117 result = _lp_simplex (ats->prob, &opt_lp);
1118 lp_solution = _lp_get_status (ats->prob);
1120 // TODO: Remove if this does not appear until release
1121 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1122 "" "EXECUTED SIMPLEX WITH PRESOLVER! %i \n", lp_solution);
1124 if (ats_evaluate_results (result, lp_solution, "LP") != GNUNET_YES)
1126 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1127 "After execution simplex with presolver: STILL INVALID!\n");
1130 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%llu.mlp",
1131 ats->internal.c_peers, ats->internal.c_mechs,
1132 GNUNET_TIME_absolute_get ().abs_value);
1133 _lp_write_lp ((void *) ats->prob, NULL, filename);
1134 GNUNET_free (filename);
1135 stat->valid = GNUNET_NO;
1136 ats->internal.recreate_problem = GNUNET_YES;
1139 stat->valid = GNUNET_YES;
1145 _lp_init_iocp (&opt_mlp);
1147 opt_mlp.tm_lim = max_dur;
1150 opt_mlp.msg_lev = GLP_MSG_ALL;
1152 opt_mlp.msg_lev = GLP_MSG_OFF;
1155 result = _lp_intopt (ats->prob, &opt_mlp);
1156 mlp_solution = _lp_mip_status (ats->prob);
1157 stat->solution = mlp_solution;
1159 if (ats_evaluate_results (result, mlp_solution, "MLP") == GNUNET_YES)
1161 stat->valid = GNUNET_YES;
1165 // TODO: Remove if this does not appear until release
1166 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1167 "MLP solution for %i peers, %i mechs is invalid: %i\n",
1168 ats->internal.c_peers, ats->internal.c_mechs, mlp_solution);
1169 stat->valid = GNUNET_NO;
1173 if (_lp_get_col_prim (ats->prob, 2 * c_mechs + 1) != 1)
1177 for (c = 1; c <= available_quality_metrics; c++)
1179 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1180 _lp_get_col_name (ats->prob, 2 * c_mechs + 3 + c),
1181 _lp_get_col_prim (ats->prob, 2 * c_mechs + 3 + c));
1183 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1184 _lp_get_col_name (ats->prob, 2 * c_mechs + 1),
1185 _lp_get_col_prim (ats->prob, 2 * c_mechs + 1));
1186 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1187 _lp_get_col_name (ats->prob, 2 * c_mechs + 2),
1188 _lp_get_col_prim (ats->prob, 2 * c_mechs + 2));
1189 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1190 _lp_get_col_name (ats->prob, 2 * c_mechs + 3),
1191 _lp_get_col_prim (ats->prob, 2 * c_mechs + 3));
1192 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "objective value: %f\n",
1193 _lp_mip_obj_val (ats->prob));
1200 ats_shutdown (struct ATS_Handle *ats)
1203 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "ATS shutdown\n");
1205 ats_delete_problem (ats);
1212 ats_update_problem_qm (struct ATS_Handle *ats)
1217 int c_q_metrics = available_quality_metrics;
1220 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1221 available_quality_metrics) * sizeof (int));
1223 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1224 available_quality_metrics) * sizeof (double));
1226 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n");
1228 row_index = ats->internal.begin_qm;
1230 for (c = 1; c <= c_q_metrics; c++)
1236 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
1238 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
1239 for (c2 = 1; c2 <= ats->internal.c_mechs; c2++)
1241 ja[array_index] = c2;
1242 GNUNET_assert (ats->mechanisms[c2].addr != NULL);
1243 GNUNET_assert (ats->mechanisms[c2].peer != NULL);
1245 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY)
1247 double v0 = 0, v1 = 0, v2 = 0;
1249 v0 = ats->mechanisms[c2].quality[c - 1].values[0];
1252 v1 = ats->mechanisms[c2].quality[c - 1].values[1];
1255 v2 = ats->mechanisms[c2].quality[c - 1].values[2];
1258 value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0);
1261 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE)
1263 double v0 = 0, v1 = 0, v2 = 0;
1265 v0 = ats->mechanisms[c2].quality[c - 1].values[0];
1268 v1 = ats->mechanisms[c2].quality[c - 1].values[1];
1271 v2 = ats->mechanisms[c2].quality[c - 1].values[2];
1274 value = (v0 + 2 * v1 + 3 * v2) / 6.0;
1276 value = (double) 10 / value;
1280 ar[array_index] = (ats->mechanisms[c2].peer->f) * value;
1282 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n",
1283 array_index, qm[c - 1].name, row_index, ja[array_index],
1288 ja[array_index] = ats->internal.col_qm + c - 1;
1289 ar[array_index] = -1;
1292 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
1293 array_index, row_index, ja[array_index], ar[array_index]);
1295 _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar);
1299 GNUNET_free_non_null (ja);
1300 GNUNET_free_non_null (ar);
1306 ats_calculate_bandwidth_distribution (struct ATS_Handle *ats)
1308 struct GNUNET_TIME_Absolute start;
1309 struct GNUNET_TIME_Relative creation;
1310 struct GNUNET_TIME_Relative solving;
1313 char *text = "unmodified";
1318 if (INT_MAX < ats->max_exec_duration.rel_value)
1321 dur = (int) ats->max_exec_duration.rel_value;
1324 ats->internal.simplex_rerun_required = GNUNET_NO;
1325 start = GNUNET_TIME_absolute_get ();
1326 if ((ats->internal.recreate_problem == GNUNET_YES) || (ats->prob == NULL) ||
1327 (ats->internal.valid == GNUNET_NO))
1330 ats->internal.recreate_problem = GNUNET_YES;
1331 ats_delete_problem (ats);
1332 ats->addr_notification (&ats->peers, &c_p, &ats->mechanisms, &c_m);
1334 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1335 "Service returned: %i peer, %i mechs\n", c_p, c_m);
1337 ats_create_problem (ats, &ats->internal, ats->peers, c_p, ats->mechanisms,
1342 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1343 "Peers/Addresses were modified... new problem: %i peer, %i mechs\n",
1344 ats->internal.c_peers, ats->internal.c_mechs);
1348 else if ((ats->internal.recreate_problem == GNUNET_NO) &&
1349 (ats->internal.modified_resources == GNUNET_YES) &&
1350 (ats->internal.valid == GNUNET_YES))
1352 text = "modified resources";
1353 ats_update_problem_cr (ats);
1355 else if ((ats->internal.recreate_problem == GNUNET_NO) &&
1356 (ats->internal.modified_quality == GNUNET_YES) &&
1357 (ats->internal.valid == GNUNET_YES))
1359 text = "modified quality";
1360 ats_update_problem_qm (ats);
1361 //ats_update_problem_qm_TEST ();
1365 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Problem is %s\n", text);
1369 GNUNET_TIME_absolute_get_difference (start, GNUNET_TIME_absolute_get ());
1370 start = GNUNET_TIME_absolute_get ();
1372 ats->internal.solution = GLP_UNDEF;
1373 if (ats->internal.valid == GNUNET_YES)
1375 ats_solve_problem (ats, ats->max_iterations,
1376 ats->max_exec_duration.rel_value, ats->internal.c_peers,
1377 ats->internal.c_mechs, &ats->internal);
1380 GNUNET_TIME_absolute_get_difference (start, GNUNET_TIME_absolute_get ());
1382 if (ats->internal.valid == GNUNET_YES)
1384 /* Telling about new distribution */
1387 int msg_type = GNUNET_ERROR_TYPE_DEBUG;
1390 msg_type = GNUNET_ERROR_TYPE_ERROR;
1392 GNUNET_log (msg_type,
1393 "MLP %s: creation time: %llu, execution time: %llu, %i peers, %i mechanisms, simplex rerun: %s, solution %s\n",
1394 text, creation.rel_value, solving.rel_value,
1395 ats->internal.c_peers, ats->internal.c_mechs,
1396 (ats->internal.simplex_rerun_required ==
1397 GNUNET_NO) ? "NO" : "YES",
1398 (ats->internal.solution == 5) ? "OPTIMAL" : "INVALID");
1399 ats->successful_executions++;
1400 GNUNET_STATISTICS_set (ats->stats, "# ATS successful executions",
1401 ats->successful_executions, GNUNET_NO);
1403 if ((ats->internal.recreate_problem == GNUNET_YES) || (ats->prob == NULL))
1404 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_NEW, GNUNET_NO);
1405 else if ((ats->internal.modified_resources == GNUNET_YES) &&
1406 (ats->internal.modified_quality == GNUNET_NO))
1407 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_COST_UPDATED,
1409 else if ((ats->internal.modified_resources == GNUNET_NO) &&
1410 (ats->internal.modified_quality == GNUNET_YES) &&
1411 (ats->internal.simplex_rerun_required == GNUNET_NO))
1412 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_QUALITY_UPDATED,
1414 else if ((ats->internal.modified_resources == GNUNET_YES) &&
1415 (ats->internal.modified_quality == GNUNET_YES) &&
1416 (ats->internal.simplex_rerun_required == GNUNET_NO))
1417 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_QUALITY_COST_UPDATED,
1419 else if (ats->internal.simplex_rerun_required == GNUNET_NO)
1420 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_UNMODIFIED,
1425 if (ats->internal.c_peers != 0)
1427 ats->invalid_executions++;
1428 GNUNET_STATISTICS_set (ats->stats, "# ATS invalid executions",
1429 ats->invalid_executions, GNUNET_NO);
1433 GNUNET_STATISTICS_set (ats->stats, "# ATS successful executions",
1434 ats->successful_executions, GNUNET_NO);
1438 GNUNET_STATISTICS_set (ats->stats, "ATS duration",
1439 solving.rel_value + creation.rel_value, GNUNET_NO);
1440 GNUNET_STATISTICS_set (ats->stats, "ATS mechanisms", ats->internal.c_mechs,
1442 GNUNET_STATISTICS_set (ats->stats, "ATS peers", ats->internal.c_peers,
1444 GNUNET_STATISTICS_set (ats->stats, "ATS solution", ats->internal.solution,
1446 GNUNET_STATISTICS_set (ats->stats, "ATS timestamp", start.abs_value,
1449 if ((ats->save_mlp == GNUNET_YES) &&
1450 (ats->internal.c_mechs >= ats->dump_min_peers) &&
1451 (ats->internal.c_mechs >= ats->dump_min_addr))
1455 if (ats->dump_overwrite == GNUNET_NO)
1457 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.mlp",
1458 ats->internal.c_peers, ats->internal.c_mechs, text,
1459 GNUNET_TIME_absolute_get ().abs_value);
1460 _lp_write_lp ((void *) ats->prob, NULL, filename);
1464 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.mlp", ats->internal.c_peers,
1465 ats->internal.c_mechs);
1466 _lp_write_lp ((void *) ats->prob, NULL, filename);
1468 GNUNET_free (filename);
1470 if ((ats->save_solution == GNUNET_YES) &&
1471 (ats->internal.c_mechs >= ats->dump_min_peers) &&
1472 (ats->internal.c_mechs >= ats->dump_min_addr))
1476 if (ats->dump_overwrite == GNUNET_NO)
1478 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.sol",
1479 ats->internal.c_peers, ats->internal.c_mechs, text,
1480 GNUNET_TIME_absolute_get ().abs_value);
1481 _lp_print_sol (ats->prob, filename);
1485 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.sol", ats->internal.c_peers,
1486 ats->internal.c_mechs);
1487 _lp_print_sol (ats->prob, filename);
1489 GNUNET_free (filename);
1492 ats->internal.recreate_problem = GNUNET_NO;
1493 ats->internal.modified_resources = GNUNET_NO;
1494 ats->internal.modified_quality = GNUNET_NO;
1498 * Evaluate the result of the last simplex or mlp solving
1499 * @param result return value returned by the solver
1500 * @param solution solution state
1501 * @param problem mlp or lp
1502 * @return GNUNET_NO if solution is invalid, GNUNET_YES if solution is
1507 ats_evaluate_results (int result, int solution, char *problem)
1509 int cont = GNUNET_NO;
1511 #if DEBUG_ATS || VERBOSE_ATS
1512 int error_kind = GNUNET_ERROR_TYPE_DEBUG;
1515 error_kind = GNUNET_ERROR_TYPE_ERROR;
1519 case GNUNET_SYSERR: /* GNUNET problem, not GLPK related */
1520 #if DEBUG_ATS || VERBOSE_ATS
1521 GNUNET_log (error_kind, "%s, GLPK solving not executed\n", problem);
1524 case GLP_ESTOP: /* search terminated by application */
1525 #if DEBUG_ATS || VERBOSE_ATS
1526 GNUNET_log (error_kind, "%s , Search terminated by application\n", problem);
1529 case GLP_EITLIM: /* iteration limit exceeded */
1530 #if DEBUG_ATS || VERBOSE_ATS
1531 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%s Iteration limit exceeded\n",
1535 case GLP_ETMLIM: /* time limit exceeded */
1536 #if DEBUG_ATS || VERBOSE_ATS
1537 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%s Time limit exceeded\n", problem);
1540 case GLP_ENOPFS: /* no primal feasible solution */
1541 case GLP_ENODFS: /* no dual feasible solution */
1542 #if DEBUG_ATS || VERBOSE_ATS
1543 GNUNET_log (error_kind, "%s No feasible solution\n", problem);
1546 case GLP_EBADB: /* invalid basis */
1547 case GLP_ESING: /* singular matrix */
1548 case GLP_ECOND: /* ill-conditioned matrix */
1549 case GLP_EBOUND: /* invalid bounds */
1550 case GLP_EFAIL: /* solver failed */
1551 case GLP_EOBJLL: /* objective lower limit reached */
1552 case GLP_EOBJUL: /* objective upper limit reached */
1553 case GLP_EROOT: /* root LP optimum not provided */
1554 #if DEBUG_ATS || VERBOSE_ATS
1555 GNUNET_log (error_kind, "%s Invalid Input data: %i\n", problem, result);
1559 #if DEBUG_ATS || VERBOSE_ATS
1560 GNUNET_log (error_kind, "%s Problem has been solved\n", problem);
1568 #if DEBUG_ATS || VERBOSE_ATS
1569 GNUNET_log (error_kind, "%s solution is undefined\n", problem);
1573 #if DEBUG_ATS || VERBOSE_ATS
1574 GNUNET_log (error_kind, "%s solution is optimal\n", problem);
1579 #if DEBUG_ATS || VERBOSE_ATS
1580 GNUNET_log (error_kind,
1581 "%s solution is %s feasible, however, its optimality (or non-optimality) has not been proven\n",
1582 problem, (0 == strcmp (problem, "LP") ? "" : "integer"));
1587 #if DEBUG_ATS || VERBOSE_ATS
1588 GNUNET_log (error_kind, "%s problem has no %sfeasible solution\n", problem,
1589 (0 == strcmp (problem, "LP") ? "" : "integer "));
1593 #if DEBUG_ATS || VERBOSE_ATS
1594 GNUNET_log (error_kind, "%s problem is infeasible \n", problem);
1598 #if DEBUG_ATS || VERBOSE_ATS
1599 GNUNET_log (error_kind, "%s problem is unbounded \n", problem);
1608 ats_update_problem_cr (struct ATS_Handle *ats)
1613 double ct_max, ct_min;
1616 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1617 available_quality_metrics) * sizeof (int));
1619 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1620 available_quality_metrics) * sizeof (double));
1622 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n");
1623 row_index = ats->internal.begin_cr;
1626 for (c = 0; c < available_ressources; c++)
1628 ct_max = ressources[c].c_max;
1629 ct_min = ressources[c].c_min;
1631 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] %f..%f\n",
1632 row_index, ct_min, ct_max);
1634 _lp_set_row_bnds (ats->prob, row_index, GLP_DB, ct_min, ct_max);
1635 for (c2 = 1; c2 <= ats->internal.c_mechs; c2++)
1639 GNUNET_assert (ats->mechanisms[c2].addr != NULL);
1640 GNUNET_assert (ats->mechanisms[c2].peer != NULL);
1642 ja[array_index] = c2;
1643 value = ats->mechanisms[c2].ressources[c].c;
1644 ar[array_index] = value;
1646 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
1647 array_index, row_index, ja[array_index], ar[array_index]);
1651 _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar);
1654 GNUNET_free_non_null (ja);
1655 GNUNET_free_non_null (ar);
1660 ats_set_logging_options (struct ATS_Handle *ats,
1661 struct GNUNET_STATISTICS_Handle *stats,
1662 const struct GNUNET_CONFIGURATION_Handle *cfg)
1664 int minimum_addresses;
1669 unsigned long long value;
1674 GNUNET_CONFIGURATION_get_value_yesno (cfg, "transport", "DUMP_MLP");
1676 GNUNET_CONFIGURATION_get_value_yesno (cfg, "transport", "DUMP_SOLUTION");
1678 GNUNET_CONFIGURATION_get_value_yesno (cfg, "transport", "DUMP_OVERWRITE");
1680 GNUNET_CONFIGURATION_get_value_number (cfg, "transport", "DUMP_MIN_PEERS",
1682 minimum_peers = (int) value;
1684 GNUNET_CONFIGURATION_get_value_number (cfg, "transport", "DUMP_MIN_ADDRS",
1686 minimum_addresses = (int) value;
1690 ats->dump_min_addr = minimum_addresses;
1691 ats->dump_min_peers = minimum_peers;
1692 ats->dump_overwrite = overwrite_dump;
1693 ats->save_mlp = log_problem;
1694 ats->save_solution = log_solution;
1699 ats_update_problem_qm_TEST ()
1706 int old_ja[ats->internal.c_mechs + 2];
1707 double old_ar[ats->internal.c_mechs + 2];
1710 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1711 available_quality_metrics) * sizeof (int));
1713 GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1714 available_quality_metrics) * sizeof (double));
1716 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1717 "Updating problem quality metrics TEST\n");
1719 if (ats->internal.begin_qm > 0)
1720 row_index = ats->internal.begin_qm;
1723 for (c = 0; c < available_quality_metrics; c++)
1725 c_old = _lp_get_mat_row (ats->prob, row_index, old_ja, old_ar);
1726 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
1727 for (c2 = 1; c2 <= c_old; c2++)
1729 ja[c2] = old_ja[c2];
1730 if ((changed < 3) && (c2 > 2) && (old_ar[c2] != -1))
1732 ar[c2] = old_ar[c2] + 5 - changed;
1736 ar[c2] = old_ar[c2];
1738 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1739 "[index]=[%i]: old [%i,%i]=%f new [%i,%i]=%f\n", c2,
1740 row_index, old_ja[c2], old_ar[c2], row_index, ja[c2], ar[c2]);
1743 _lp_set_mat_row (ats->prob, row_index, c_old, ja, ar);
1746 GNUNET_free_non_null (ja);
1747 GNUNET_free_non_null (ar);
1753 /* end of transport_ats.c */