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[],
321 const int ja[], const double ar[])
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)
519 struct GNUNET_TIME_Relative max_duration,
520 GNUNET_TRANSPORT_ATS_AddressNotification address_not,
521 GNUNET_TRANSPORT_ATS_ResultCallback res_cb)
523 struct ATS_Handle *ats = NULL;
525 ats = GNUNET_malloc (sizeof (struct ATS_Handle));
529 ats->addr_notification = address_not;
530 ats->result_cb = res_cb;
532 ats->max_iterations = max_iterations;
533 ats->max_exec_duration = max_duration;
538 ats->v_b_min = v_b_min;
539 ats->v_n_min = v_n_min;
540 ats->dump_min_peers = 0;
541 ats->dump_min_addr = 0;
542 ats->dump_overwrite = GNUNET_NO;
543 ats->mechanisms = NULL;
545 ats->successful_executions = 0;
546 ats->invalid_executions = 0;
552 /** solve the bandwidth distribution problem
553 * @param max_it maximum iterations
554 * @param max_dur maximum duration in ms
555 * @param D weight for diversity
556 * @param U weight for utility
557 * @param R weight for relativity
558 * @param v_b_min minimal bandwidth per peer
559 * @param v_n_min minimum number of connections
560 * @param stat result struct
561 * @return GNUNET_SYSERR if glpk is not available, number of mechanisms used
564 ats_create_problem (struct ATS_Handle *ats,
565 struct ATS_internals *stat,
566 struct ATS_peer *peers,
567 int c_p, struct ATS_mechanism *mechanisms, int c_m)
569 if ((c_p == 0) || (c_m == 0))
570 return GNUNET_SYSERR;
572 ats->prob = _lp_create_prob ();
575 int c_c_ressources = available_ressources;
576 int c_q_metrics = available_quality_metrics;
578 double M = VERY_BIG_DOUBLE_VALUE;
579 double Q[c_q_metrics + 1];
581 for (c = 1; c <= c_q_metrics; c++)
586 if (ats->v_n_min > c_p)
589 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
590 "Creating problem with: %i peers, %i mechanisms, %i resource entries, %i quality metrics \n",
591 c_p, c_m, c_c_ressources, c_q_metrics);
594 int size = 1 + 3 + 10 * c_m + c_p +
595 (c_q_metrics * c_m) + c_q_metrics + c_c_ressources * c_m;
598 int *ia = GNUNET_malloc (size * sizeof (int));
599 int *ja = GNUNET_malloc (size * sizeof (int));
600 double *ar = GNUNET_malloc (size * sizeof (double));
602 _lp_set_prob_name (ats->prob, "gnunet ats bandwidth distribution");
603 _lp_set_obj_dir (ats->prob, GLP_MAX);
608 _lp_add_cols (ats->prob, 2 * c_m);
609 /* adding b_t cols */
610 for (c = 1; c <= c_m; c++)
612 GNUNET_asprintf (&name,
613 "p_%s_b%i", GNUNET_i2s (&(mechanisms[c].peer->peer)), c);
614 _lp_set_col_name (ats->prob, c, name);
616 _lp_set_col_bnds (ats->prob, c, GLP_LO, 0.0, 0.0);
617 _lp_set_col_kind (ats->prob, c, GLP_CV);
618 _lp_set_obj_coef (ats->prob, c, 0);
621 /* adding n_t cols */
622 for (c = c_m + 1; c <= 2 * c_m; c++)
624 GNUNET_asprintf (&name,
625 "p_%s_n%i", GNUNET_i2s (&(mechanisms[c - c_m].peer->peer)),
627 _lp_set_col_name (ats->prob, c, name);
629 _lp_set_col_bnds (ats->prob, c, GLP_DB, 0.0, 1.0);
630 _lp_set_col_kind (ats->prob, c, GLP_IV);
631 _lp_set_obj_coef (ats->prob, c, 0);
634 /* feasibility constraints */
635 /* Constraint 1: one address per peer */
638 _lp_add_rows (ats->prob, c_p);
640 for (c = 1; c <= c_p; c++)
643 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
646 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 1.0, 1.0);
647 struct ATS_mechanism *m = peers[c].m_head;
651 ia[array_index] = row_index;
652 ja[array_index] = (c_m + m->col_index);
655 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
657 ia[array_index], ja[array_index], ar[array_index]);
665 /* Constraint 2: only active mechanism gets bandwidth assigned */
666 _lp_add_rows (ats->prob, c_m);
667 for (c = 1; c <= c_m; c++)
669 /* b_t - n_t * M <= 0 */
671 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
673 _lp_set_row_bnds (ats->prob, row_index, GLP_UP, 0.0, 0.0);
674 ia[array_index] = row_index;
675 ja[array_index] = mechanisms[c].col_index;
678 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
679 array_index, ia[array_index], ja[array_index], ar[array_index]);
682 ia[array_index] = row_index;
683 ja[array_index] = c_m + mechanisms[c].col_index;
684 ar[array_index] = -M;
686 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
687 array_index, ia[array_index], ja[array_index], ar[array_index]);
693 /* Constraint 3: minimum bandwidth */
694 _lp_add_rows (ats->prob, c_m);
696 for (c = 1; c <= c_m; c++)
698 /* b_t - n_t * b_min <= 0 */
700 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
703 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, 0.0, 0.0);
705 ia[array_index] = row_index;
706 ja[array_index] = mechanisms[c].col_index;
709 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
710 array_index, ia[array_index], ja[array_index], ar[array_index]);
713 ia[array_index] = row_index;
714 ja[array_index] = c_m + mechanisms[c].col_index;
715 ar[array_index] = -ats->v_b_min;
717 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
718 array_index, ia[array_index], ja[array_index], ar[array_index]);
725 /* Constraint 4: max ressource capacity */
726 /* V cr: bt * ct_r <= cr_max
729 _lp_add_rows (ats->prob, available_ressources);
731 double ct_max = VERY_BIG_DOUBLE_VALUE;
734 stat->begin_cr = array_index;
736 for (c = 0; c < available_ressources; c++)
738 ct_max = ressources[c].c_max;
739 ct_min = ressources[c].c_min;
741 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] %f..%f\n",
742 row_index, ct_min, ct_max);
745 _lp_set_row_bnds (ats->prob, row_index, GLP_DB, ct_min, ct_max);
747 for (c2 = 1; c2 <= c_m; c2++)
751 ia[array_index] = row_index;
752 ja[array_index] = c2;
753 value = mechanisms[c2].ressources[c].c;
754 ar[array_index] = value;
756 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
757 array_index, ia[array_index],
758 ja[array_index], ar[array_index]);
764 stat->end_cr = array_index--;
766 /* Constraint 5: min number of connections */
767 _lp_add_rows (ats->prob, 1);
769 for (c = 1; c <= c_m; c++)
771 // b_t - n_t * b_min >= 0
773 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
775 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, ats->v_n_min, 0.0);
776 ia[array_index] = row_index;
777 ja[array_index] = c_m + mechanisms[c].col_index;
780 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
781 array_index, ia[array_index], ja[array_index], ar[array_index]);
787 // optimisation constraints
791 // Constraint 6: optimize for diversity
794 col_d = _lp_add_cols (ats->prob, 1);
796 _lp_set_col_name (ats->prob, col_d, "d");
797 _lp_set_obj_coef (ats->prob, col_d, ats->D);
798 _lp_set_col_bnds (ats->prob, col_d, GLP_LO, 0.0, 0.0);
799 _lp_add_rows (ats->prob, 1);
800 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
804 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
806 for (c = 1; c <= c_m; c++)
808 ia[array_index] = row_index;
809 ja[array_index] = c_m + mechanisms[c].col_index;
812 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
813 array_index, ia[array_index], ja[array_index], ar[array_index]);
817 ia[array_index] = row_index;
818 ja[array_index] = col_d;
819 ar[array_index] = -1;
821 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
822 array_index, ia[array_index], ja[array_index], ar[array_index]);
827 // Constraint 7: optimize for quality
830 col_qm = _lp_add_cols (ats->prob, c_q_metrics);
832 stat->col_qm = col_qm;
833 //GNUNET_assert (col_qm == (2*c_mechs) + 3 + 1);
834 for (c = 0; c < c_q_metrics; c++)
836 GNUNET_asprintf (&name, "Q_%s", qm[c].name);
837 _lp_set_col_name (ats->prob, col_qm + c, name);
838 _lp_set_col_bnds (ats->prob, col_qm + c, GLP_LO, 0.0, 0.0);
840 _lp_set_obj_coef (ats->prob, col_qm + c, Q[c]);
843 _lp_add_rows (ats->prob, available_quality_metrics);
845 stat->begin_qm = row_index;
846 for (c = 1; c <= c_q_metrics; c++)
849 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
853 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
854 for (c2 = 1; c2 <= c_m; c2++)
856 ia[array_index] = row_index;
857 ja[array_index] = c2;
858 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY)
860 double v0 = 0, v1 = 0, v2 = 0;
862 v0 = mechanisms[c2].quality[c - 1].values[0];
865 v1 = mechanisms[c2].quality[c - 1].values[1];
868 v2 = mechanisms[c2].quality[c - 1].values[2];
871 value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0);
874 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE)
876 double v0 = 0, v1 = 0, v2 = 0;
878 v0 = mechanisms[c2].quality[c - 1].values[0];
881 v1 = mechanisms[c2].quality[c - 1].values[1];
884 v2 = mechanisms[c2].quality[c - 1].values[2];
887 value = (v0 + 2 * v1 + 3 * v2) / 6.0;
889 value = (double) 10 / value;
893 ar[array_index] = (mechanisms[c2].peer->f) * value;
895 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n",
898 ia[array_index], ja[array_index], ar[array_index]);
902 ia[array_index] = row_index;
903 ja[array_index] = col_qm + c - 1;
904 ar[array_index] = -1;
906 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
907 array_index, ia[array_index], ja[array_index], ar[array_index]);
912 stat->end_qm = row_index - 1;
914 // Constraint 8: optimize bandwidth utility
917 col_u = _lp_add_cols (ats->prob, 1);
919 _lp_set_col_name (ats->prob, col_u, "u");
920 _lp_set_obj_coef (ats->prob, col_u, ats->U);
921 _lp_set_col_bnds (ats->prob, col_u, GLP_LO, 0.0, 0.0);
922 _lp_add_rows (ats->prob, 1);
925 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
927 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
928 for (c = 1; c <= c_m; c++)
930 ia[array_index] = row_index;
932 ar[array_index] = mechanisms[c].peer->f;
934 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
935 array_index, ia[array_index], ja[array_index], ar[array_index]);
939 ia[array_index] = row_index;
940 ja[array_index] = col_u;
941 ar[array_index] = -1;
943 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
944 array_index, ia[array_index], ja[array_index], ar[array_index]);
950 // Constraint 9: optimize relativity
953 col_r = _lp_add_cols (ats->prob, 1);
955 _lp_set_col_name (ats->prob, col_r, "r");
956 _lp_set_obj_coef (ats->prob, col_r, ats->R);
957 _lp_set_col_bnds (ats->prob, col_r, GLP_LO, 0.0, 0.0);
958 _lp_add_rows (ats->prob, c_p);
961 for (c = 1; c <= c_p; c++)
963 _lp_set_row_bnds (ats->prob, row_index, GLP_LO, 0.0, 0.0);
964 struct ATS_mechanism *m = peers[c].m_head;
968 ia[array_index] = row_index;
969 ja[array_index] = m->col_index;
970 ar[array_index] = 1 / mechanisms[c].peer->f;
972 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
974 ia[array_index], ja[array_index], ar[array_index]);
979 ia[array_index] = row_index;
980 ja[array_index] = col_r;
981 ar[array_index] = -1;
983 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
984 array_index, ia[array_index], ja[array_index], ar[array_index]);
990 /* Loading the matrix */
991 _lp_load_matrix (ats->prob, array_index - 1, ia, ja, ar);
996 stat->valid = GNUNET_YES;
1008 ats_delete_problem (struct ATS_Handle *ats)
1011 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Deleting problem\n");
1015 for (c = 0; c < (ats->internal).c_mechs; c++)
1016 GNUNET_free_non_null (ats->mechanisms[c].rc);
1017 if (ats->mechanisms != NULL)
1019 GNUNET_free (ats->mechanisms);
1020 ats->mechanisms = NULL;
1023 if (ats->peers != NULL)
1025 GNUNET_free (ats->peers);
1029 if (ats->prob != NULL)
1031 _lp_delete_prob (ats->prob);
1035 ats->internal.begin_cr = GNUNET_SYSERR;
1036 ats->internal.begin_qm = GNUNET_SYSERR;
1037 ats->internal.c_mechs = 0;
1038 ats->internal.c_peers = 0;
1039 ats->internal.end_cr = GNUNET_SYSERR;
1040 ats->internal.end_qm = GNUNET_SYSERR;
1041 ats->internal.solution = GNUNET_SYSERR;
1042 ats->internal.valid = GNUNET_SYSERR;
1046 ats_modify_problem_state (struct ATS_Handle *ats, enum ATS_problem_state s)
1053 ats->internal.recreate_problem = GNUNET_NO;
1054 ats->internal.modified_quality = GNUNET_NO;
1055 ats->internal.modified_resources = GNUNET_NO;
1058 ats->internal.recreate_problem = GNUNET_YES;
1060 case ATS_QUALITY_UPDATED:
1061 ats->internal.modified_quality = GNUNET_YES;
1063 case ATS_COST_UPDATED:
1064 ats->internal.modified_resources = GNUNET_YES;
1066 case ATS_QUALITY_COST_UPDATED:
1067 ats->internal.modified_resources = GNUNET_YES;
1068 ats->internal.modified_quality = GNUNET_YES;
1079 ats_solve_problem (struct ATS_Handle *ats,
1080 unsigned int max_it,
1081 unsigned int max_dur,
1082 unsigned int c_peers,
1083 unsigned int c_mechs, struct ATS_internals *stat)
1085 int result = GNUNET_SYSERR;
1086 int lp_solution = GNUNET_SYSERR;
1087 int mlp_solution = GNUNET_SYSERR;
1093 _lp_init_smcp (&opt_lp);
1095 opt_lp.msg_lev = GLP_MSG_ALL;
1097 opt_lp.msg_lev = GLP_MSG_OFF;
1099 // setting iteration limit
1100 opt_lp.it_lim = max_it;
1102 opt_lp.tm_lim = max_dur;
1104 if (ats->internal.recreate_problem == GNUNET_YES)
1105 opt_lp.presolve = GLP_ON;
1107 result = _lp_simplex (ats->prob, &opt_lp);
1108 lp_solution = _lp_get_status (ats->prob);
1110 if ((result == GLP_ETMLIM) || (result == GLP_EITLIM))
1112 ats->internal.valid = GNUNET_NO;
1113 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1114 "ATS exceeded time or iteration limit!\n");
1118 if (ats_evaluate_results (result, lp_solution, "LP") == GNUNET_YES)
1120 stat->valid = GNUNET_YES;
1124 ats->internal.simplex_rerun_required = GNUNET_YES;
1125 opt_lp.presolve = GLP_ON;
1126 result = _lp_simplex (ats->prob, &opt_lp);
1127 lp_solution = _lp_get_status (ats->prob);
1129 // TODO: Remove if this does not appear until release
1130 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, ""
1131 "EXECUTED SIMPLEX WITH PRESOLVER! %i \n", lp_solution);
1133 if (ats_evaluate_results (result, lp_solution, "LP") != GNUNET_YES)
1135 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1136 "After execution simplex with presolver: STILL INVALID!\n");
1139 GNUNET_asprintf (&filename,
1140 "ats_mlp_p%i_m%i_%llu.mlp",
1141 ats->internal.c_peers,
1142 ats->internal.c_mechs,
1143 GNUNET_TIME_absolute_get ().abs_value);
1144 _lp_write_lp ((void *) ats->prob, NULL, filename);
1145 GNUNET_free (filename);
1146 stat->valid = GNUNET_NO;
1147 ats->internal.recreate_problem = GNUNET_YES;
1150 stat->valid = GNUNET_YES;
1156 _lp_init_iocp (&opt_mlp);
1158 opt_mlp.tm_lim = max_dur;
1161 opt_mlp.msg_lev = GLP_MSG_ALL;
1163 opt_mlp.msg_lev = GLP_MSG_OFF;
1166 result = _lp_intopt (ats->prob, &opt_mlp);
1167 mlp_solution = _lp_mip_status (ats->prob);
1168 stat->solution = mlp_solution;
1170 if (ats_evaluate_results (result, mlp_solution, "MLP") == GNUNET_YES)
1172 stat->valid = GNUNET_YES;
1176 // TODO: Remove if this does not appear until release
1177 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1178 "MLP solution for %i peers, %i mechs is invalid: %i\n",
1179 ats->internal.c_peers, ats->internal.c_mechs, mlp_solution);
1180 stat->valid = GNUNET_NO;
1184 if (_lp_get_col_prim (ats->prob, 2 * c_mechs + 1) != 1)
1188 for (c = 1; c <= available_quality_metrics; c++)
1190 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1191 _lp_get_col_name (ats->prob, 2 * c_mechs + 3 + c),
1192 _lp_get_col_prim (ats->prob, 2 * c_mechs + 3 + c));
1194 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1195 _lp_get_col_name (ats->prob, 2 * c_mechs + 1),
1196 _lp_get_col_prim (ats->prob, 2 * c_mechs + 1));
1197 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1198 _lp_get_col_name (ats->prob, 2 * c_mechs + 2),
1199 _lp_get_col_prim (ats->prob, 2 * c_mechs + 2));
1200 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "%s %f\n",
1201 _lp_get_col_name (ats->prob, 2 * c_mechs + 3),
1202 _lp_get_col_prim (ats->prob, 2 * c_mechs + 3));
1203 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "objective value: %f\n",
1204 _lp_mip_obj_val (ats->prob));
1211 ats_shutdown (struct ATS_Handle *ats)
1214 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "ATS shutdown\n");
1216 ats_delete_problem (ats);
1223 ats_update_problem_qm (struct ATS_Handle *ats)
1228 int c_q_metrics = available_quality_metrics;
1230 int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1231 available_quality_metrics) * sizeof (int));
1232 double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1233 available_quality_metrics) * sizeof (double));
1235 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n");
1237 row_index = ats->internal.begin_qm;
1239 for (c = 1; c <= c_q_metrics; c++)
1245 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] \n", row_index);
1247 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
1248 for (c2 = 1; c2 <= ats->internal.c_mechs; c2++)
1250 ja[array_index] = c2;
1251 GNUNET_assert (ats->mechanisms[c2].addr != NULL);
1252 GNUNET_assert (ats->mechanisms[c2].peer != NULL);
1254 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DELAY)
1256 double v0 = 0, v1 = 0, v2 = 0;
1258 v0 = ats->mechanisms[c2].quality[c - 1].values[0];
1261 v1 = ats->mechanisms[c2].quality[c - 1].values[1];
1264 v2 = ats->mechanisms[c2].quality[c - 1].values[2];
1267 value = 100.0 / ((v0 + 2 * v1 + 3 * v2) / 6.0);
1270 if (qm[c - 1].atis_index == GNUNET_TRANSPORT_ATS_QUALITY_NET_DISTANCE)
1272 double v0 = 0, v1 = 0, v2 = 0;
1274 v0 = ats->mechanisms[c2].quality[c - 1].values[0];
1277 v1 = ats->mechanisms[c2].quality[c - 1].values[1];
1280 v2 = ats->mechanisms[c2].quality[c - 1].values[2];
1283 value = (v0 + 2 * v1 + 3 * v2) / 6.0;
1285 value = (double) 10 / value;
1289 ar[array_index] = (ats->mechanisms[c2].peer->f) * value;
1291 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: %s [%i,%i]=%f \n",
1293 qm[c - 1].name, row_index, ja[array_index], ar[array_index]);
1297 ja[array_index] = ats->internal.col_qm + c - 1;
1298 ar[array_index] = -1;
1301 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
1302 array_index, row_index, ja[array_index], ar[array_index]);
1304 _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar);
1308 GNUNET_free_non_null (ja);
1309 GNUNET_free_non_null (ar);
1315 ats_calculate_bandwidth_distribution (struct ATS_Handle *ats)
1317 struct GNUNET_TIME_Absolute start;
1318 struct GNUNET_TIME_Relative creation;
1319 struct GNUNET_TIME_Relative solving;
1322 char *text = "unmodified";
1327 if (INT_MAX < ats->max_exec_duration.rel_value)
1330 dur = (int) ats->max_exec_duration.rel_value;
1333 ats->internal.simplex_rerun_required = GNUNET_NO;
1334 start = GNUNET_TIME_absolute_get ();
1335 if ((ats->internal.recreate_problem == GNUNET_YES) ||
1336 (ats->prob == NULL) || (ats->internal.valid == GNUNET_NO))
1339 ats->internal.recreate_problem = GNUNET_YES;
1340 ats_delete_problem (ats);
1341 ats->addr_notification (&ats->peers, &c_p, &ats->mechanisms, &c_m);
1343 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1344 "Service returned: %i peer, %i mechs\n", c_p, c_m);
1346 ats_create_problem (ats, &ats->internal, ats->peers, c_p, ats->mechanisms,
1351 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1352 "Peers/Addresses were modified... new problem: %i peer, %i mechs\n",
1353 ats->internal.c_peers, ats->internal.c_mechs);
1357 else if ((ats->internal.recreate_problem == GNUNET_NO) &&
1358 (ats->internal.modified_resources == GNUNET_YES) &&
1359 (ats->internal.valid == GNUNET_YES))
1361 text = "modified resources";
1362 ats_update_problem_cr (ats);
1364 else if ((ats->internal.recreate_problem == GNUNET_NO) &&
1365 (ats->internal.modified_quality == GNUNET_YES) &&
1366 (ats->internal.valid == GNUNET_YES))
1368 text = "modified quality";
1369 ats_update_problem_qm (ats);
1370 //ats_update_problem_qm_TEST ();
1374 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Problem is %s\n", text);
1378 GNUNET_TIME_absolute_get_difference (start, GNUNET_TIME_absolute_get ());
1379 start = GNUNET_TIME_absolute_get ();
1381 ats->internal.solution = GLP_UNDEF;
1382 if (ats->internal.valid == GNUNET_YES)
1384 ats_solve_problem (ats,
1385 ats->max_iterations,
1386 ats->max_exec_duration.rel_value,
1387 ats->internal.c_peers,
1388 ats->internal.c_mechs, &ats->internal);
1391 GNUNET_TIME_absolute_get_difference (start, GNUNET_TIME_absolute_get ());
1393 if (ats->internal.valid == GNUNET_YES)
1395 /* Telling about new distribution */
1398 int msg_type = GNUNET_ERROR_TYPE_DEBUG;
1401 msg_type = GNUNET_ERROR_TYPE_ERROR;
1403 GNUNET_log (msg_type,
1404 "MLP %s: creation time: %llu, execution time: %llu, %i peers, %i mechanisms, simplex rerun: %s, solution %s\n",
1408 ats->internal.c_peers,
1409 ats->internal.c_mechs,
1410 (ats->internal.simplex_rerun_required ==
1411 GNUNET_NO) ? "NO" : "YES",
1412 (ats->internal.solution == 5) ? "OPTIMAL" : "INVALID");
1413 ats->successful_executions++;
1414 GNUNET_STATISTICS_set (ats->stats, "# ATS successful executions",
1415 ats->successful_executions, GNUNET_NO);
1417 if ((ats->internal.recreate_problem == GNUNET_YES) || (ats->prob == NULL))
1418 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_NEW, GNUNET_NO);
1419 else if ((ats->internal.modified_resources == GNUNET_YES) &&
1420 (ats->internal.modified_quality == GNUNET_NO))
1421 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_COST_UPDATED,
1423 else if ((ats->internal.modified_resources == GNUNET_NO) &&
1424 (ats->internal.modified_quality == GNUNET_YES) &&
1425 (ats->internal.simplex_rerun_required == GNUNET_NO))
1426 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_QUALITY_UPDATED,
1428 else if ((ats->internal.modified_resources == GNUNET_YES) &&
1429 (ats->internal.modified_quality == GNUNET_YES) &&
1430 (ats->internal.simplex_rerun_required == GNUNET_NO))
1431 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_QUALITY_COST_UPDATED,
1433 else if (ats->internal.simplex_rerun_required == GNUNET_NO)
1434 GNUNET_STATISTICS_set (ats->stats, "ATS state", ATS_UNMODIFIED,
1439 if (ats->internal.c_peers != 0)
1441 ats->invalid_executions++;
1442 GNUNET_STATISTICS_set (ats->stats, "# ATS invalid executions",
1443 ats->invalid_executions, GNUNET_NO);
1447 GNUNET_STATISTICS_set (ats->stats, "# ATS successful executions",
1448 ats->successful_executions, GNUNET_NO);
1452 GNUNET_STATISTICS_set (ats->stats,
1453 "ATS duration", solving.rel_value + creation.rel_value,
1455 GNUNET_STATISTICS_set (ats->stats, "ATS mechanisms", ats->internal.c_mechs,
1457 GNUNET_STATISTICS_set (ats->stats, "ATS peers", ats->internal.c_peers,
1459 GNUNET_STATISTICS_set (ats->stats, "ATS solution", ats->internal.solution,
1461 GNUNET_STATISTICS_set (ats->stats, "ATS timestamp", start.abs_value,
1464 if ((ats->save_mlp == GNUNET_YES) &&
1465 (ats->internal.c_mechs >= ats->dump_min_peers) &&
1466 (ats->internal.c_mechs >= ats->dump_min_addr))
1470 if (ats->dump_overwrite == GNUNET_NO)
1472 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.mlp",
1473 ats->internal.c_peers,
1474 ats->internal.c_mechs,
1475 text, GNUNET_TIME_absolute_get ().abs_value);
1476 _lp_write_lp ((void *) ats->prob, NULL, filename);
1480 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.mlp",
1481 ats->internal.c_peers, ats->internal.c_mechs);
1482 _lp_write_lp ((void *) ats->prob, NULL, filename);
1484 GNUNET_free (filename);
1486 if ((ats->save_solution == GNUNET_YES) &&
1487 (ats->internal.c_mechs >= ats->dump_min_peers) &&
1488 (ats->internal.c_mechs >= ats->dump_min_addr))
1492 if (ats->dump_overwrite == GNUNET_NO)
1494 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i_%s_%llu.sol",
1495 ats->internal.c_peers,
1496 ats->internal.c_mechs,
1497 text, GNUNET_TIME_absolute_get ().abs_value);
1498 _lp_print_sol (ats->prob, filename);
1502 GNUNET_asprintf (&filename, "ats_mlp_p%i_m%i.sol",
1503 ats->internal.c_peers, ats->internal.c_mechs);
1504 _lp_print_sol (ats->prob, filename);
1506 GNUNET_free (filename);
1509 ats->internal.recreate_problem = GNUNET_NO;
1510 ats->internal.modified_resources = GNUNET_NO;
1511 ats->internal.modified_quality = GNUNET_NO;
1515 * Evaluate the result of the last simplex or mlp solving
1516 * @param result return value returned by the solver
1517 * @param solution solution state
1518 * @param problem mlp or lp
1519 * @return GNUNET_NO if solution is invalid, GNUNET_YES if solution is
1524 ats_evaluate_results (int result, int solution, char *problem)
1526 int cont = GNUNET_NO;
1528 #if DEBUG_ATS || VERBOSE_ATS
1529 int error_kind = GNUNET_ERROR_TYPE_DEBUG;
1532 error_kind = GNUNET_ERROR_TYPE_ERROR;
1536 case GNUNET_SYSERR: /* GNUNET problem, not GLPK related */
1537 #if DEBUG_ATS || VERBOSE_ATS
1538 GNUNET_log (error_kind, "%s, GLPK solving not executed\n", problem);
1541 case GLP_ESTOP: /* search terminated by application */
1542 #if DEBUG_ATS || VERBOSE_ATS
1543 GNUNET_log (error_kind, "%s , Search terminated by application\n", problem);
1546 case GLP_EITLIM: /* iteration limit exceeded */
1547 #if DEBUG_ATS || VERBOSE_ATS
1548 GNUNET_log (GNUNET_ERROR_TYPE_WARNING,
1549 "%s Iteration limit exceeded\n", problem);
1552 case GLP_ETMLIM: /* time limit exceeded */
1553 #if DEBUG_ATS || VERBOSE_ATS
1554 GNUNET_log (GNUNET_ERROR_TYPE_WARNING, "%s Time limit exceeded\n", problem);
1557 case GLP_ENOPFS: /* no primal feasible solution */
1558 case GLP_ENODFS: /* no dual feasible solution */
1559 #if DEBUG_ATS || VERBOSE_ATS
1560 GNUNET_log (error_kind, "%s No feasible solution\n", problem);
1563 case GLP_EBADB: /* invalid basis */
1564 case GLP_ESING: /* singular matrix */
1565 case GLP_ECOND: /* ill-conditioned matrix */
1566 case GLP_EBOUND: /* invalid bounds */
1567 case GLP_EFAIL: /* solver failed */
1568 case GLP_EOBJLL: /* objective lower limit reached */
1569 case GLP_EOBJUL: /* objective upper limit reached */
1570 case GLP_EROOT: /* root LP optimum not provided */
1571 #if DEBUG_ATS || VERBOSE_ATS
1572 GNUNET_log (error_kind, "%s Invalid Input data: %i\n", problem, result);
1576 #if DEBUG_ATS || VERBOSE_ATS
1577 GNUNET_log (error_kind, "%s Problem has been solved\n", problem);
1585 #if DEBUG_ATS || VERBOSE_ATS
1586 GNUNET_log (error_kind, "%s solution is undefined\n", problem);
1590 #if DEBUG_ATS || VERBOSE_ATS
1591 GNUNET_log (error_kind, "%s solution is optimal\n", problem);
1596 #if DEBUG_ATS || VERBOSE_ATS
1597 GNUNET_log (error_kind,
1598 "%s solution is %s feasible, however, its optimality (or non-optimality) has not been proven\n",
1599 problem, (0 == strcmp (problem, "LP") ? "" : "integer"));
1604 #if DEBUG_ATS || VERBOSE_ATS
1605 GNUNET_log (error_kind, "%s problem has no %sfeasible solution\n",
1606 problem, (0 == strcmp (problem, "LP") ? "" : "integer "));
1610 #if DEBUG_ATS || VERBOSE_ATS
1611 GNUNET_log (error_kind, "%s problem is infeasible \n", problem);
1615 #if DEBUG_ATS || VERBOSE_ATS
1616 GNUNET_log (error_kind, "%s problem is unbounded \n", problem);
1625 ats_update_problem_cr (struct ATS_Handle *ats)
1630 double ct_max, ct_min;
1632 int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1633 available_quality_metrics) * sizeof (int));
1634 double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1635 available_quality_metrics) * sizeof (double));
1637 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "Updating problem quality metrics\n");
1638 row_index = ats->internal.begin_cr;
1641 for (c = 0; c < available_ressources; c++)
1643 ct_max = ressources[c].c_max;
1644 ct_min = ressources[c].c_min;
1646 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "bounds [row]=[%i] %f..%f\n",
1647 row_index, ct_min, ct_max);
1649 _lp_set_row_bnds (ats->prob, row_index, GLP_DB, ct_min, ct_max);
1650 for (c2 = 1; c2 <= ats->internal.c_mechs; c2++)
1654 GNUNET_assert (ats->mechanisms[c2].addr != NULL);
1655 GNUNET_assert (ats->mechanisms[c2].peer != NULL);
1657 ja[array_index] = c2;
1658 value = ats->mechanisms[c2].ressources[c].c;
1659 ar[array_index] = value;
1661 GNUNET_log (GNUNET_ERROR_TYPE_ERROR, "[index]=[%i]: [%i,%i]=%f \n",
1662 array_index, row_index, ja[array_index], ar[array_index]);
1666 _lp_set_mat_row (ats->prob, row_index, array_index, ja, ar);
1669 GNUNET_free_non_null (ja);
1670 GNUNET_free_non_null (ar);
1675 ats_set_logging_options (struct ATS_Handle *ats,
1676 struct GNUNET_STATISTICS_Handle *stats,
1677 const struct GNUNET_CONFIGURATION_Handle *cfg)
1679 int minimum_addresses;
1684 unsigned long long value;
1688 log_problem = GNUNET_CONFIGURATION_get_value_yesno (cfg,
1689 "transport", "DUMP_MLP");
1690 log_solution = GNUNET_CONFIGURATION_get_value_yesno (cfg,
1693 overwrite_dump = GNUNET_CONFIGURATION_get_value_yesno (cfg,
1697 GNUNET_CONFIGURATION_get_value_number (cfg,
1699 "DUMP_MIN_PEERS", &value))
1700 minimum_peers = (int) value;
1702 GNUNET_CONFIGURATION_get_value_number (cfg,
1704 "DUMP_MIN_ADDRS", &value))
1705 minimum_addresses = (int) value;
1709 ats->dump_min_addr = minimum_addresses;
1710 ats->dump_min_peers = minimum_peers;
1711 ats->dump_overwrite = overwrite_dump;
1712 ats->save_mlp = log_problem;
1713 ats->save_solution = log_solution;
1718 ats_update_problem_qm_TEST ()
1725 int old_ja[ats->internal.c_mechs + 2];
1726 double old_ar[ats->internal.c_mechs + 2];
1728 int *ja = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1729 available_quality_metrics) * sizeof (int));
1730 double *ar = GNUNET_malloc ((1 + ats->internal.c_mechs * 2 + 3 +
1731 available_quality_metrics) * sizeof (double));
1733 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1734 "Updating problem quality metrics TEST\n");
1736 if (ats->internal.begin_qm > 0)
1737 row_index = ats->internal.begin_qm;
1740 for (c = 0; c < available_quality_metrics; c++)
1742 c_old = _lp_get_mat_row (ats->prob, row_index, old_ja, old_ar);
1743 _lp_set_row_bnds (ats->prob, row_index, GLP_FX, 0.0, 0.0);
1744 for (c2 = 1; c2 <= c_old; c2++)
1746 ja[c2] = old_ja[c2];
1747 if ((changed < 3) && (c2 > 2) && (old_ar[c2] != -1))
1749 ar[c2] = old_ar[c2] + 5 - changed;
1753 ar[c2] = old_ar[c2];
1755 GNUNET_log (GNUNET_ERROR_TYPE_ERROR,
1756 "[index]=[%i]: old [%i,%i]=%f new [%i,%i]=%f\n",
1758 row_index, old_ja[c2], old_ar[c2], row_index, ja[c2], ar[c2]);
1761 _lp_set_mat_row (ats->prob, row_index, c_old, ja, ar);
1764 GNUNET_free_non_null (ja);
1765 GNUNET_free_non_null (ar);
1771 /* end of transport_ats.c */