2 This file is part of GNUnet.
3 (C) 2011 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/libgnunet_plugin_ats_ril.c
23 * @brief ATS reinforcement learning solver
24 * @author Fabian Oehlmann
25 * @author Matthias Wachs
27 #include "libgnunet_plugin_ats_ril.h"
29 #define LOG(kind,...) GNUNET_log_from (kind, "ats-ril",__VA_ARGS__)
31 #define RIL_ACTION_INVALID -1
32 #define RIL_FEATURES_ADDRESS_COUNT (3 + GNUNET_ATS_QualityPropertiesCount)
33 #define RIL_FEATURES_NETWORK_COUNT 4
35 #define RIL_DEFAULT_STEP_TIME GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MILLISECONDS, 3000)
36 #define RIL_DEFAULT_ALGORITHM RIL_ALGO_Q
37 #define RIL_DEFAULT_DISCOUNT_FACTOR 0.5
38 #define RIL_DEFAULT_GRADIENT_STEP_SIZE 0.4
39 #define RIL_DEFAULT_TRACE_DECAY 0.6
40 #define RIL_EXPLORE_RATIO 0.1
43 * ATS reinforcement learning solver
49 * The actions, how an agent can manipulate the current assignment. I.e. how the bandwidth can be
50 * changed for the currently chosen address. Not depicted in the enum are the actions of switching
51 * to a particular address. The action of switching to address with index i is depicted by the
52 * number (RIL_ACTION_TYPE_NUM + i).
56 RIL_ACTION_NOTHING = 0,
57 RIL_ACTION_BW_IN_DBL = 1,
58 RIL_ACTION_BW_IN_HLV = 2,
59 RIL_ACTION_BW_IN_INC = 3,
60 RIL_ACTION_BW_IN_DEC = 4,
61 RIL_ACTION_BW_OUT_DBL = 5,
62 RIL_ACTION_BW_OUT_HLV = 6,
63 RIL_ACTION_BW_OUT_INC = 7,
64 RIL_ACTION_BW_OUT_DEC = 8,
65 RIL_ACTION_TYPE_NUM = 9
74 enum RIL_E_Modification
83 * Global learning parameters
85 struct RIL_Learning_Parameters
88 * The TD-algorithm to use
90 enum RIL_Algorithm algorithm;
93 * Learning discount factor in the TD-update
98 * Gradient-descent step-size
103 * Trace-decay factor for eligibility traces
109 * Wrapper for addresses to store them in agent's linked list
111 struct RIL_Address_Wrapped
116 struct RIL_Address_Wrapped *next;
121 struct RIL_Address_Wrapped *prev;
126 struct ATS_Address *address_naked;
129 struct RIL_Peer_Agent
132 * Next agent in solver's linked list
134 struct RIL_Peer_Agent *next;
137 * Previous agent in solver's linked list
139 struct RIL_Peer_Agent *prev;
144 struct GAS_RIL_Handle *envi;
149 struct GNUNET_PeerIdentity peer;
152 * Whether the agent is active or not
154 int active; //TODO? rename into something better. It reflects the state whether get_preferred_address() has been called for the according peer or not
157 * Number of performed time-steps
159 unsigned long long step_count;
162 * Experience matrix W
167 * Number of rows of W / Number of state-vector features
172 * Number of columns of W / Number of actions
177 * Last perceived state feature vector
187 * Eligibility trace vector
194 struct ATS_Address * address_inuse;
197 * Head of addresses DLL
199 struct RIL_Address_Wrapped * addresses_head;
202 * Tail of addresses DLL
204 struct RIL_Address_Wrapped * addresses_tail;
207 * Inbound bandwidth assigned by the agent
209 unsigned long long bw_in;
212 * Outbound bandwidth assigned by the agent
214 unsigned long long bw_out;
222 enum GNUNET_ATS_Network_Type type;
225 * Total available inbound bandwidth
227 unsigned long long bw_in_available;
230 * Total assigned outbound bandwidth
232 unsigned long long bw_in_assigned;
235 * Total available outbound bandwidth
237 unsigned long long bw_out_available;
240 * Total assigned outbound bandwidth
242 unsigned long long bw_out_assigned;
246 * A handle for the reinforcement learning solver
248 struct GAS_RIL_Handle
253 struct GNUNET_ATS_PluginEnvironment *plugin_envi;
258 struct GNUNET_STATISTICS_Handle *stats;
261 * Number of performed time-steps
263 unsigned long long step_count;
266 * Interval time between steps in milliseconds //TODO? Future Work: Heterogeneous stepping among agents
268 struct GNUNET_TIME_Relative step_time;
271 * Task identifier of the next time-step to be executed
273 GNUNET_SCHEDULER_TaskIdentifier next_step;
276 * Learning parameters
278 struct RIL_Learning_Parameters parameters;
281 * Array of networks with global assignment state
283 struct RIL_Network * network_entries;
288 unsigned int networks_count;
291 * List of active peer-agents
293 struct RIL_Peer_Agent * agents_head;
294 struct RIL_Peer_Agent * agents_tail;
299 * ---------------------------
303 * Estimate the current action-value for state s and action a
305 * @param agent agent performing the estimation
308 * @return estimation value
311 agent_estimate_q (struct RIL_Peer_Agent *agent, double *state, int action)
316 for (i = 0; i < agent->m; i++)
318 result += state[i] * agent->W[action][i];
325 * Decide whether to do exploration (i.e. taking a new action) or exploitation (i.e. taking the
326 * currently estimated best action) in the current step
328 * @param agent agent performing the step
329 * @return yes, if exploring
332 agent_decide_exploration (struct RIL_Peer_Agent *agent)
334 //TODO? Future Work: Improve exploration/exploitation trade-off by different mechanisms than e-greedy
336 * An e-greedy replacement could be based on the accuracy of the prediction of the Q-value
338 double r = (double) GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
339 UINT32_MAX) / (double) UINT32_MAX;
341 if (r < RIL_EXPLORE_RATIO)
349 * Get the index of the address in the agent's list.
351 * @param agent agent handle
352 * @param address address handle
353 * @return the index, starting with zero
356 agent_address_get_index (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
359 struct RIL_Address_Wrapped *cur;
362 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
365 if (cur->address_naked == address)
375 * Gets the wrapped address from the agent's list
377 * @param agent agent handle
378 * @param address address handle
379 * @return wrapped address
381 static struct RIL_Address_Wrapped *
382 agent_address_get (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
384 struct RIL_Address_Wrapped *cur;
386 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
388 if (cur->address_naked == address)
398 * Gets the action, with the maximal estimated Q-value (i.e. the one currently estimated to bring the
399 * most reward in the future)
401 * @param agent agent performing the calculation
402 * @param state the state from which to take the action
403 * @return the action promising most future reward
406 agent_get_action_best (struct RIL_Peer_Agent *agent, double *state)
409 int max_i = RIL_ACTION_INVALID;
411 double max_q = -DBL_MAX;
413 for (i = 0; i < agent->n; i++)
415 cur_q = agent_estimate_q (agent, state, i);
423 GNUNET_assert(RIL_ACTION_INVALID != max_i);
429 * Gets any action, to explore the action space from that state
431 * @param agent agent performing the calculation
432 * @param state the state from which to take the action
436 agent_get_action_explore (struct RIL_Peer_Agent *agent, double *state)
438 // TODO?: Future Work: Choose the action for exploration, which has been explored the least in this state
439 return GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, agent->n);
443 * Updates the weights (i.e. coefficients) of the weight vector in matrix W for action a
445 * @param agent the agent performing the update
446 * @param reward the reward received for the last action
447 * @param s_next the new state, the last step got the agent into
448 * @param a_prime the new
451 agent_update_weights (struct RIL_Peer_Agent *agent, double reward, double *s_next, int a_prime)
455 double *theta = agent->W[agent->a_old];
457 delta = reward + agent_estimate_q (agent, s_next, a_prime)
458 - agent_estimate_q (agent, agent->s_old, agent->a_old);
459 for (i = 0; i < agent->m; i++)
461 theta[i] += agent->envi->parameters.alpha * delta * (agent->e)[i];
466 * Changes the eligibility trace vector e in various manners:
467 * RIL_E_ACCUMULATE - adds 1 to each component as in accumulating eligibility traces
468 * RIL_E_REPLACE - resets each component to 1 as in replacing traces
469 * RIL_E_SET - multiplies e with gamma and lambda as in the update rule
470 * RIL_E_ZERO - sets e to 0 as in Watkin's Q-learning algorithm when exploring and when initializing
472 * @param agent the agent handle
473 * @param mod the kind of modification
476 agent_modify_eligibility (struct RIL_Peer_Agent *agent, enum RIL_E_Modification mod)
479 double *e = agent->e;
480 double gamma = agent->envi->parameters.gamma;
481 double lambda = agent->envi->parameters.lambda;
483 for (i = 0; i < agent->m; i++)
487 case RIL_E_ACCUMULATE:
494 e[i] = gamma * lambda;
504 * Changes the active assignment suggestion of the handler and invokes the bw_changed callback to
505 * notify ATS of its new decision
507 * @param solver solver handle
508 * @param agent agent handle
509 * @param new_address the address which is to be used
510 * @param new_bw_in the new amount of inbound bandwidth set for this address
511 * @param new_bw_out the new amount of outbound bandwidth set for this address
512 * @param silent disables invocation of the bw_changed callback, if GNUNET_YES
515 envi_set_active_suggestion (struct GAS_RIL_Handle *solver,
516 struct RIL_Peer_Agent *agent,
517 struct ATS_Address *new_address,
518 unsigned long long new_bw_in,
519 unsigned long long new_bw_out,
522 int notify = GNUNET_NO;
524 LOG(GNUNET_ERROR_TYPE_DEBUG, "set_active_suggestion()\n");
527 if (agent->address_inuse != new_address)
529 if (NULL != agent->address_inuse)
531 agent->address_inuse->active = GNUNET_NO;
532 agent->address_inuse->assigned_bw_in.value__ = htonl (0);
533 agent->address_inuse->assigned_bw_out.value__ = htonl (0);
535 if (NULL != new_address)
537 LOG(GNUNET_ERROR_TYPE_DEBUG, "set address active: %s\n", agent->active ? "yes" : "no");
538 new_address->active = agent->active;
539 new_address->assigned_bw_in.value__ = htonl (agent->bw_in);
540 new_address->assigned_bw_out.value__ = htonl (agent->bw_out);
542 notify |= GNUNET_YES;
548 if (new_address->active != agent->active)
550 new_address->active = agent->active;
554 if (agent->bw_in != new_bw_in)
556 agent->bw_in = new_bw_in;
557 new_address->assigned_bw_in.value__ = htonl (new_bw_out);
558 notify |= GNUNET_YES;
560 if (agent->bw_out != new_bw_out)
562 agent->bw_out = new_bw_out;
563 new_address->assigned_bw_out.value__ = htonl (new_bw_out);
564 notify |= GNUNET_YES;
568 if (notify && agent->active && (GNUNET_NO == silent))
572 solver->plugin_envi->bandwidth_changed_cb (solver->plugin_envi->bw_changed_cb_cls,
575 else if (agent->address_inuse)
577 GNUNET_assert(0 == ntohl (agent->address_inuse->assigned_bw_in.value__));
578 GNUNET_assert(0 == ntohl (agent->address_inuse->assigned_bw_out.value__));
582 solver->plugin_envi->bandwidth_changed_cb (solver->plugin_envi->bw_changed_cb_cls,
583 agent->address_inuse);
586 agent->address_inuse = new_address;
590 * Allocates a state vector and fills it with the features present
592 * @param solver the solver handle
593 * @return pointer to the state vector
596 envi_get_state (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
600 struct RIL_Network *net;
601 double *state = GNUNET_malloc (sizeof (double) * agent->m);
602 struct RIL_Address_Wrapped *cur_address;
603 const double *properties;
605 for (i = 0; i < solver->networks_count; i++)
607 net = &solver->network_entries[i];
608 state[i * RIL_FEATURES_NETWORK_COUNT + 0] = (double) net->bw_in_assigned;
609 state[i * RIL_FEATURES_NETWORK_COUNT + 1] = (double) net->bw_in_available;
610 state[i * RIL_FEATURES_NETWORK_COUNT + 2] = (double) net->bw_out_assigned;
611 state[i * RIL_FEATURES_NETWORK_COUNT + 3] = (double) net->bw_out_available;
614 i = i * RIL_FEATURES_NETWORK_COUNT; //first address feature
616 for (cur_address = agent->addresses_head; NULL != cur_address; cur_address = cur_address->next)
618 state[i++] = cur_address->address_naked->active;
619 state[i++] = cur_address->address_naked->active ? agent->bw_in : 0;
620 state[i++] = cur_address->address_naked->active ? agent->bw_out : 0;
621 properties = solver->plugin_envi->get_property (solver->plugin_envi->get_property_cls,
622 cur_address->address_naked);
623 for (k = 0; k < GNUNET_ATS_QualityPropertiesCount; k++)
625 state[i++] = properties[k];
633 * For all networks a peer has an address in, this gets the maximum bandwidth which could
634 * theoretically be available in one of the networks. This is used for bandwidth normalization.
636 * @param solver the solver handle
637 * @param agent the agent handle
638 * @param direction_in whether the inbound bandwidth should be considered. Returns the maximum outbound bandwidth if GNUNET_NO
640 static long long unsigned
641 ril_get_max_bw (struct RIL_Peer_Agent *agent, int direction_in)
644 * get the maximum bandwidth possible for a peer, e.g. among all addresses which addresses'
645 * network could provide the maximum bandwidth if all that bandwidth was used on that one peer.
648 struct RIL_Address_Wrapped *cur;
649 struct RIL_Network *net;
651 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
653 net = cur->address_naked->solver_information;
656 if (net->bw_in_available > max)
658 max = net->bw_in_available;
663 if (net->bw_out_available > max)
665 max = net->bw_out_available;
673 * Get the index of the quality-property in question
675 * @param type the quality property type
679 ril_find_property_index (uint32_t type)
681 int existing_types[] = GNUNET_ATS_QualityProperties;
683 for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
684 if (existing_types[c] == type)
686 return GNUNET_SYSERR;
690 * Gets the reward for the last performed step
692 * @param solver solver handle
696 envi_get_reward (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
699 * Match the preferences of the peer with the current assignment.
701 const double *preferences;
702 const double *properties;
703 double pref_match = 0;
705 struct RIL_Network *net;
708 preferences = solver->plugin_envi->get_preferences (solver->plugin_envi->get_preference_cls,
710 properties = solver->plugin_envi->get_property (solver->plugin_envi->get_property_cls,
711 agent->address_inuse);
712 prop_index = ril_find_property_index (GNUNET_ATS_QUALITY_NET_DELAY);
713 pref_match += preferences[GNUNET_ATS_PREFERENCE_LATENCY] * properties[prop_index];
714 bw_norm = GNUNET_MAX(2, (((
715 ((double) agent->bw_in / (double) ril_get_max_bw(agent, GNUNET_YES)) +
716 ((double) agent->bw_out / (double) ril_get_max_bw(agent, GNUNET_NO))
719 pref_match += preferences[GNUNET_ATS_PREFERENCE_BANDWIDTH] * bw_norm;
721 net = agent->address_inuse->solver_information;
722 if ((net->bw_in_assigned > net->bw_in_available) || net->bw_out_assigned > net->bw_out_available)
731 * Doubles the bandwidth for the active address
733 * @param solver solver handle
734 * @param agent agent handle
735 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise the outbound bandwidth
738 envi_action_bw_double (struct GAS_RIL_Handle *solver,
739 struct RIL_Peer_Agent *agent,
744 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in * 2,
745 agent->bw_out, GNUNET_NO);
749 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
750 agent->bw_out * 2, GNUNET_NO);
755 * Cuts the bandwidth for the active address in half. The least amount of bandwidth suggested, is
756 * the minimum bandwidth for a peer, in order to not invoke a disconnect.
758 * @param solver solver handle
759 * @param agent agent handle
760 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
764 envi_action_bw_halven (struct GAS_RIL_Handle *solver,
765 struct RIL_Peer_Agent *agent,
768 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
769 unsigned long long new_bw;
773 new_bw = agent->bw_in / 2;
776 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
781 new_bw = agent->bw_out / 2;
784 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
790 * Increases the bandwidth by 5 times the minimum bandwidth for the active address.
792 * @param solver solver handle
793 * @param agent agent handle
794 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
798 envi_action_bw_inc (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
800 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
804 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in + (5 * min_bw),
805 agent->bw_out, GNUNET_NO);
809 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
810 agent->bw_out + (5 * min_bw), GNUNET_NO);
815 * Decreases the bandwidth by 5 times the minimum bandwidth for the active address. The least amount
816 * of bandwidth suggested, is the minimum bandwidth for a peer, in order to not invoke a disconnect.
818 * @param solver solver handle
819 * @param agent agent handle
820 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
824 envi_action_bw_dec (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
826 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
827 unsigned long long new_bw;
831 new_bw = agent->bw_in - (5 * min_bw);
834 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
839 new_bw = agent->bw_out - (5 * min_bw);
842 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
848 * Switches to the address given by its index
850 * @param solver solver handle
851 * @param agent agent handle
852 * @param address_index index of the address as it is saved in the agent's list, starting with zero
855 envi_action_address_switch (struct GAS_RIL_Handle *solver,
856 struct RIL_Peer_Agent *agent,
857 unsigned int address_index)
859 struct RIL_Address_Wrapped *cur;
862 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
864 if (i == address_index)
866 envi_set_active_suggestion (solver, agent, cur->address_naked, agent->bw_in, agent->bw_out,
874 //no address with address_index exists, in this case this action should not be callable
875 GNUNET_assert(GNUNET_NO);
879 * Puts the action into effect by calling the according function
881 * @param solver solver handle
882 * @param action action to perform by the solver
885 envi_do_action (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int action)
891 case RIL_ACTION_NOTHING:
893 case RIL_ACTION_BW_IN_DBL:
894 envi_action_bw_double (solver, agent, GNUNET_YES);
896 case RIL_ACTION_BW_IN_HLV:
897 envi_action_bw_halven (solver, agent, GNUNET_YES);
899 case RIL_ACTION_BW_IN_INC:
900 envi_action_bw_inc (solver, agent, GNUNET_YES);
902 case RIL_ACTION_BW_IN_DEC:
903 envi_action_bw_dec (solver, agent, GNUNET_YES);
905 case RIL_ACTION_BW_OUT_DBL:
906 envi_action_bw_double (solver, agent, GNUNET_NO);
908 case RIL_ACTION_BW_OUT_HLV:
909 envi_action_bw_halven (solver, agent, GNUNET_NO);
911 case RIL_ACTION_BW_OUT_INC:
912 envi_action_bw_inc (solver, agent, GNUNET_NO);
914 case RIL_ACTION_BW_OUT_DEC:
915 envi_action_bw_dec (solver, agent, GNUNET_NO);
918 if ((action >= RIL_ACTION_TYPE_NUM) && (action < agent->n)) //switch address action
920 address_index = action - RIL_ACTION_TYPE_NUM;
922 GNUNET_assert(address_index >= 0);
924 address_index <= agent_address_get_index (agent, agent->addresses_tail->address_naked));
926 envi_action_address_switch (solver, agent, address_index);
929 // error - action does not exist
930 GNUNET_assert(GNUNET_NO);
935 * Performs one step of the Markov Decision Process. Other than in the literature the step starts
936 * after having done the last action a_old. It observes the new state s_next and the reward
937 * received. Then the coefficient update is done according to the SARSA or Q-learning method. The
938 * next action is put into effect.
940 * @param agent the agent performing the step
943 agent_step (struct RIL_Peer_Agent *agent)
945 int a_next = RIL_ACTION_INVALID;
949 s_next = envi_get_state (agent->envi, agent);
950 reward = envi_get_reward (agent->envi, agent);
952 LOG(GNUNET_ERROR_TYPE_DEBUG, "agent_step() with algorithm %s\n",
953 agent->envi->parameters.algorithm ? "Q" : "SARSA");
955 switch (agent->envi->parameters.algorithm)
958 agent_modify_eligibility (agent, RIL_E_SET);
959 if (agent_decide_exploration (agent))
961 a_next = agent_get_action_explore (agent, s_next);
965 a_next = agent_get_action_best (agent, s_next);
967 if (RIL_ACTION_INVALID != agent->a_old)
969 //updates weights with selected action (on-policy), if not first step
970 agent_update_weights (agent, reward, s_next, a_next);
975 a_next = agent_get_action_best (agent, s_next);
976 if (RIL_ACTION_INVALID != agent->a_old)
978 //updates weights with best action, disregarding actually selected action (off-policy), if not first step
979 agent_update_weights (agent, reward, s_next, a_next);
981 if (agent_decide_exploration (agent))
983 a_next = agent_get_action_explore (agent, s_next);
984 agent_modify_eligibility (agent, RIL_E_ZERO);
988 a_next = agent_get_action_best (agent, s_next);
989 agent_modify_eligibility (agent, RIL_E_SET);
994 GNUNET_assert(RIL_ACTION_INVALID != a_next);
996 agent_modify_eligibility (agent, RIL_E_ACCUMULATE);
998 envi_do_action (agent->envi, agent, a_next);
1000 GNUNET_free(agent->s_old);
1001 agent->s_old = s_next;
1002 agent->a_old = a_next;
1004 agent->step_count += 1;
1008 * Cycles through all agents and lets the active ones do a step. Schedules the next step.
1010 * @param solver the solver handle
1011 * @param tc task context for the scheduler
1014 ril_periodic_step (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1016 struct GAS_RIL_Handle *solver = cls;
1017 struct RIL_Peer_Agent *cur;
1019 LOG(GNUNET_ERROR_TYPE_DEBUG, "RIL step number %d\n", solver->step_count);
1021 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1023 if (cur->active && cur->address_inuse)
1029 solver->step_count += 1;
1030 solver->next_step = GNUNET_SCHEDULER_add_delayed (solver->step_time, &ril_periodic_step, solver);
1034 * Initialize an agent without addresses and its knowledge base
1036 * @param s ril solver
1037 * @param peer the one in question
1038 * @return handle to the new agent
1040 static struct RIL_Peer_Agent *
1041 agent_init (void *s, const struct GNUNET_PeerIdentity *peer)
1044 struct GAS_RIL_Handle * solver = s;
1045 struct RIL_Peer_Agent * agent = GNUNET_malloc (sizeof (struct RIL_Peer_Agent));
1047 agent->envi = solver;
1048 agent->peer = *peer;
1049 agent->step_count = 0;
1050 agent->active = GNUNET_NO;
1051 agent->n = RIL_ACTION_TYPE_NUM;
1052 agent->m = solver->networks_count * RIL_FEATURES_NETWORK_COUNT;
1053 agent->W = (double **) GNUNET_malloc (sizeof (double *) * agent->n);
1054 for (i = 0; i < agent->n; i++)
1056 agent->W[i] = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1058 agent->a_old = RIL_ACTION_INVALID;
1059 agent->s_old = envi_get_state (solver, agent);
1060 agent->e = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1061 agent_modify_eligibility (agent, RIL_E_ZERO);
1063 GNUNET_CONTAINER_DLL_insert_tail(solver->agents_head, solver->agents_tail, agent);
1071 * @param s solver handle
1072 * @param agent the agent to retire
1075 agent_die (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
1079 for (i = 0; i < agent->n; i++)
1081 GNUNET_free(agent->W[i]);
1083 GNUNET_free(agent->W);
1084 GNUNET_free(agent->e);
1085 GNUNET_free(agent->s_old);
1090 * Returns the agent for a peer
1092 * @param s solver handle
1093 * @param peer identity of the peer
1094 * @param create whether to create an agent if none is allocated yet
1097 static struct RIL_Peer_Agent *
1098 ril_get_agent (struct GAS_RIL_Handle *solver, const struct GNUNET_PeerIdentity *peer, int create)
1100 struct RIL_Peer_Agent *cur;
1102 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1104 if (0 == memcmp (peer, &cur->peer, sizeof(struct GNUNET_PeerIdentity)))
1112 return agent_init (solver, peer);
1118 * Lookup network struct by type
1120 * @param s the solver handle
1121 * @param type the network type
1122 * @return the network struct
1124 static struct RIL_Network *
1125 ril_get_network (struct GAS_RIL_Handle *s, uint32_t type)
1129 for (i = 0; i < s->networks_count; i++)
1131 if (s->network_entries[i].type == type)
1133 return &s->network_entries[i];
1140 * Determine whether at least the minimum bandwidth is set for the network. Otherwise the network is
1141 * considered inactive and not used. Addresses in an inactive network are ignored.
1143 * @param solver solver handle
1144 * @param network the network type
1145 * @return whether or not the network is considered active
1148 ril_network_is_active (struct GAS_RIL_Handle *solver, enum GNUNET_ATS_Network_Type network)
1150 struct RIL_Network *net;
1151 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1153 net = ril_get_network (solver, network);
1154 if (net->bw_out_available < min_bw)
1160 * Cuts a slice out of a vector of elements. This is used to decrease the size of the matrix storing
1161 * the reward function approximation. It copies the memory, which is not cut, to the new vector,
1162 * frees the memory of the old vector, and redirects the pointer to the new one.
1164 * @param old pointer to the pointer to the first element of the vector
1165 * @param element_size byte size of the vector elements
1166 * @param hole_start the first element to cut out
1167 * @param hole_length the number of elements to cut out
1168 * @param old_length the length of the old vector
1171 ril_cut_from_vector (void **old,
1172 size_t element_size,
1173 unsigned int hole_start,
1174 unsigned int hole_length,
1175 unsigned int old_length)
1178 char *oldptr = (char *) *old;
1180 unsigned int bytes_before;
1181 unsigned int bytes_hole;
1182 unsigned int bytes_after;
1184 GNUNET_assert(old_length > hole_length);
1185 GNUNET_assert(old_length >= (hole_start + hole_length));
1187 size = element_size * (old_length - hole_length);
1189 bytes_before = element_size * hole_start;
1190 bytes_hole = element_size * hole_length;
1191 bytes_after = element_size * (old_length - hole_start - hole_length);
1199 tmpptr = GNUNET_malloc (size);
1200 memcpy (tmpptr, oldptr, bytes_before);
1201 memcpy (tmpptr + bytes_before, oldptr + (bytes_before + bytes_hole), bytes_after);
1207 *old = (void *) tmpptr;
1211 * Solver API functions
1212 * ---------------------------
1216 * Change relative preference for quality in solver
1218 * @param solver the solver handle
1219 * @param peer the peer to change the preference for
1220 * @param kind the kind to change the preference
1221 * @param pref_rel the normalized preference value for this kind over all clients
1224 GAS_ril_address_change_preference (void *s,
1225 const struct GNUNET_PeerIdentity *peer,
1226 enum GNUNET_ATS_PreferenceKind kind,
1229 LOG(GNUNET_ERROR_TYPE_DEBUG,
1230 "API_address_change_preference() Preference '%s' for peer '%s' changed to %.2f \n",
1231 GNUNET_ATS_print_preference_type (kind), GNUNET_i2s (peer), pref_rel);
1233 * Nothing to do here. Preferences are considered during reward calculation.
1238 * Entry point for the plugin
1240 * @param cls pointer to the 'struct GNUNET_ATS_PluginEnvironment'
1243 libgnunet_plugin_ats_ril_init (void *cls)
1245 struct GNUNET_ATS_PluginEnvironment *env = cls;
1246 struct GAS_RIL_Handle *solver = GNUNET_new (struct GAS_RIL_Handle);
1247 struct RIL_Network * cur;
1249 unsigned long long tmp;
1252 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_init() Initializing RIL solver\n");
1254 GNUNET_assert(NULL != env);
1255 GNUNET_assert(NULL != env->cfg);
1256 GNUNET_assert(NULL != env->stats);
1257 GNUNET_assert(NULL != env->bandwidth_changed_cb);
1258 GNUNET_assert(NULL != env->get_preferences);
1259 GNUNET_assert(NULL != env->get_property);
1262 != GNUNET_CONFIGURATION_get_value_time (env->cfg, "ats", "RIL_STEP_TIME", &solver->step_time))
1264 solver->step_time = RIL_DEFAULT_STEP_TIME;
1266 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_ALGORITHM", &string)
1267 && NULL != string && 0 == strcmp (string, "SARSA"))
1269 solver->parameters.algorithm = RIL_ALGO_SARSA;
1273 solver->parameters.algorithm = RIL_DEFAULT_ALGORITHM;
1276 == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_DISCOUNT_FACTOR", &tmp))
1278 solver->parameters.gamma = (double) tmp / 100;
1282 solver->parameters.gamma = RIL_DEFAULT_DISCOUNT_FACTOR;
1285 == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_GRADIENT_STEP_SIZE", &tmp))
1287 solver->parameters.alpha = (double) tmp / 100;
1291 solver->parameters.alpha = RIL_DEFAULT_GRADIENT_STEP_SIZE;
1293 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_TRACE_DECAY", &tmp))
1295 solver->parameters.lambda = (double) tmp / 100;
1299 solver->parameters.lambda = RIL_DEFAULT_TRACE_DECAY;
1302 env->sf.s_add = &GAS_ril_address_add;
1303 env->sf.s_address_update_property = &GAS_ril_address_property_changed;
1304 env->sf.s_address_update_session = &GAS_ril_address_session_changed;
1305 env->sf.s_address_update_inuse = &GAS_ril_address_inuse_changed;
1306 env->sf.s_address_update_network = &GAS_ril_address_change_network;
1307 env->sf.s_get = &GAS_ril_get_preferred_address;
1308 env->sf.s_get_stop = &GAS_ril_stop_get_preferred_address;
1309 env->sf.s_pref = &GAS_ril_address_change_preference;
1310 env->sf.s_feedback = &GAS_ril_address_preference_feedback;
1311 env->sf.s_del = &GAS_ril_address_delete;
1312 env->sf.s_bulk_start = &GAS_ril_bulk_start;
1313 env->sf.s_bulk_stop = &GAS_ril_bulk_stop;
1315 solver->plugin_envi = env;
1316 solver->networks_count = env->network_count;
1317 solver->network_entries = GNUNET_malloc (env->network_count * sizeof (struct RIL_Network));
1318 solver->step_count = 0;
1320 for (c = 0; c < env->network_count; c++)
1322 cur = &solver->network_entries[c];
1323 cur->type = env->networks[c];
1324 cur->bw_in_available = env->in_quota[c];
1325 cur->bw_in_assigned = 0;
1326 cur->bw_out_available = env->out_quota[c];
1327 cur->bw_out_assigned = 0;
1330 solver->next_step = GNUNET_SCHEDULER_add_delayed (
1331 GNUNET_TIME_relative_multiply (GNUNET_TIME_relative_get_millisecond_ (), 1000),
1332 &ril_periodic_step, solver);
1338 * Exit point for the plugin
1340 * @param cls the solver handle
1343 libgnunet_plugin_ats_ril_done (void *cls)
1345 struct GAS_RIL_Handle *s = cls;
1346 struct RIL_Peer_Agent *cur_agent;
1347 struct RIL_Peer_Agent *next_agent;
1349 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_done() Shutting down RIL solver\n");
1351 cur_agent = s->agents_head;
1352 while (NULL != cur_agent)
1354 next_agent = cur_agent->next;
1355 GNUNET_CONTAINER_DLL_remove(s->agents_head, s->agents_tail, cur_agent);
1356 agent_die (s, cur_agent);
1357 cur_agent = next_agent;
1360 GNUNET_SCHEDULER_cancel (s->next_step);
1361 GNUNET_free(s->network_entries);
1368 * Add a new address for a peer to the solver
1370 * The address is already contained in the addresses hashmap!
1372 * @param solver the solver Handle
1373 * @param address the address to add
1374 * @param network network type of this address
1377 GAS_ril_address_add (void *solver, struct ATS_Address *address, uint32_t network)
1379 struct GAS_RIL_Handle *s = solver;
1380 struct RIL_Peer_Agent *agent;
1381 struct RIL_Address_Wrapped *address_wrapped;
1382 struct RIL_Network *net;
1389 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1391 net = ril_get_network (s, network);
1392 address->solver_information = net;
1394 if (!ril_network_is_active (s, network))
1396 LOG(GNUNET_ERROR_TYPE_DEBUG,
1397 "API_address_add() Did not add %s address %p for peer '%s', network does not have enough bandwidth\n",
1398 address->plugin, address->addr, GNUNET_i2s (&address->peer));
1402 agent = ril_get_agent (s, &address->peer, GNUNET_YES);
1405 address_wrapped = GNUNET_malloc (sizeof (struct RIL_Address_Wrapped));
1406 address_wrapped->address_naked = address;
1407 GNUNET_CONTAINER_DLL_insert_tail(agent->addresses_head, agent->addresses_tail, address_wrapped);
1409 //increase size of W
1410 m_new = agent->m + RIL_FEATURES_ADDRESS_COUNT;
1412 n_new = agent->n + 1;
1415 GNUNET_array_grow(agent->W, agent->n, n_new);
1416 for (i = 0; i < n_new; i++)
1421 GNUNET_array_grow(agent->W[i], agent->m, m_new);
1426 GNUNET_array_grow(agent->W[i], zero, m_new);
1430 //increase size of old state vector
1432 GNUNET_array_grow(agent->s_old, agent->m, m_new); //TODO random instead of zero-initialization of state features
1435 GNUNET_array_grow(agent->e, agent->m, m_new);
1437 if (NULL == agent->address_inuse)
1439 net->bw_in_assigned += min_bw;
1440 net->bw_out_assigned += min_bw;
1441 envi_set_active_suggestion (s, agent, address, min_bw, min_bw, GNUNET_NO);
1444 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_add() Added %s %s address %p for peer '%s'\n",
1445 address->active ? "active" : "inactive", address->plugin, address->addr,
1446 GNUNET_i2s (&address->peer));
1450 * Delete an address in the solver
1452 * The address is not contained in the address hashmap anymore!
1454 * @param solver the solver handle
1455 * @param address the address to remove
1456 * @param session_only delete only session not whole address
1459 GAS_ril_address_delete (void *solver, struct ATS_Address *address, int session_only)
1461 struct GAS_RIL_Handle *s = solver;
1462 struct RIL_Peer_Agent *agent;
1463 struct RIL_Address_Wrapped *address_wrapped;
1464 int address_was_used = address->active;
1469 struct RIL_Network *net;
1470 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1472 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_delete() Delete %s%s %s address %p for peer '%s'\n",
1473 session_only ? "session for " : "", address->active ? "active" : "inactive", address->plugin,
1474 address->addr, GNUNET_i2s (&address->peer));
1476 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1479 net = address->solver_information;
1480 GNUNET_assert(!ril_network_is_active (s, net->type));
1481 LOG(GNUNET_ERROR_TYPE_DEBUG,
1482 "No agent allocated for peer yet, since address was in inactive network\n");
1486 address_index = agent_address_get_index (agent, address);
1487 address_wrapped = agent_address_get (agent, address);
1489 if (NULL == address_wrapped)
1491 net = address->solver_information;
1492 GNUNET_assert(!ril_network_is_active (s, net->type));
1493 LOG(GNUNET_ERROR_TYPE_DEBUG,
1494 "Address not considered by agent, address was in inactive network\n");
1498 GNUNET_CONTAINER_DLL_remove(agent->addresses_head, agent->addresses_tail, address_wrapped);
1499 GNUNET_free(address_wrapped);
1502 m_new = agent->m - RIL_FEATURES_ADDRESS_COUNT;
1503 n_new = agent->n - 1;
1505 for (i = 0; i < agent->n; i++)
1507 ril_cut_from_vector ((void **) &agent->W[i], sizeof(double),
1508 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1509 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1511 GNUNET_free(agent->W[RIL_ACTION_TYPE_NUM + address_index]);
1512 ril_cut_from_vector ((void **) &agent->W, sizeof(double *), RIL_ACTION_TYPE_NUM + address_index,
1514 //correct last action
1515 if (agent->a_old > (RIL_ACTION_TYPE_NUM + address_index))
1519 else if (agent->a_old == (RIL_ACTION_TYPE_NUM + address_index))
1521 agent->a_old = RIL_ACTION_INVALID;
1523 //decrease old state vector and eligibility vector
1524 ril_cut_from_vector ((void **) &agent->s_old, sizeof(double),
1525 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1526 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1527 ril_cut_from_vector ((void **) &agent->e, sizeof(double),
1528 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1529 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1533 LOG(GNUNET_ERROR_TYPE_DEBUG, "address was used: %s\n", address_was_used ? "yes" : "no");
1535 if (address_was_used)
1537 net = address->solver_information;
1538 net->bw_in_assigned -= agent->bw_in;
1539 net->bw_out_assigned -= agent->bw_out;
1541 if (NULL != agent->addresses_head) //if peer has an address left, use it
1543 LOG(GNUNET_ERROR_TYPE_DEBUG, "address left: %p\n",
1544 agent->addresses_head->address_naked->addr);
1545 //TODO? check if network/bandwidth update can be done more clever/elegant at different function
1546 envi_set_active_suggestion (s, agent, agent->addresses_head->address_naked, min_bw, min_bw,
1548 net = agent->addresses_head->address_naked->solver_information;
1549 net->bw_in_assigned -= min_bw;
1550 net->bw_out_assigned -= min_bw;
1554 LOG(GNUNET_ERROR_TYPE_DEBUG, "no address left => disconnect\n");
1556 envi_set_active_suggestion (s, agent, NULL, 0, 0, GNUNET_NO);
1560 LOG(GNUNET_ERROR_TYPE_DEBUG, "Address deleted\n");
1564 * Update the properties of an address in the solver
1566 * @param solver solver handle
1567 * @param address the address
1568 * @param type the ATSI type in HBO
1569 * @param abs_value the absolute value of the property
1570 * @param rel_value the normalized value
1573 GAS_ril_address_property_changed (void *solver,
1574 struct ATS_Address *address,
1579 LOG(GNUNET_ERROR_TYPE_DEBUG,
1580 "API_address_property_changed() Property '%s' for peer '%s' address %p changed "
1581 "to %.2f \n", GNUNET_ATS_print_property_type (type), GNUNET_i2s (&address->peer),
1582 address->addr, rel_value);
1584 * Nothing to do here, properties are considered in every reward calculation
1589 * Update the session of an address in the solver
1591 * NOTE: values in addresses are already updated
1593 * @param solver solver handle
1594 * @param address the address
1595 * @param cur_session the current session
1596 * @param new_session the new session
1599 GAS_ril_address_session_changed (void *solver,
1600 struct ATS_Address *address,
1601 uint32_t cur_session,
1602 uint32_t new_session)
1605 * TODO? Future Work: Potentially add session activity as a feature in state vector
1607 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_session_changed()\n");
1611 * Notify the solver that an address is (not) actively used by transport
1612 * to communicate with a remote peer
1614 * NOTE: values in addresses are already updated
1616 * @param solver solver handle
1617 * @param address the address
1618 * @param in_use usage state
1621 GAS_ril_address_inuse_changed (void *solver, struct ATS_Address *address, int in_use)
1623 /* Nothing to do here.
1624 * Possible TODO? Future Work: Use usage as state vector
1626 LOG(GNUNET_ERROR_TYPE_DEBUG,
1627 "API_address_inuse_changed() Usage for %s address of peer '%s' changed to %s\n",
1628 address->plugin, GNUNET_i2s (&address->peer), (GNUNET_YES == in_use) ? "USED" : "UNUSED");
1632 * Notify solver that the network an address is located in has changed
1634 * NOTE: values in addresses are already updated
1636 * @param solver solver handle
1637 * @param address the address
1638 * @param current_network the current network
1639 * @param new_network the new network
1642 GAS_ril_address_change_network (void *solver,
1643 struct ATS_Address *address,
1644 uint32_t current_network,
1645 uint32_t new_network)
1647 struct GAS_RIL_Handle *s = solver;
1648 struct RIL_Peer_Agent *agent;
1649 struct RIL_Network *net;
1650 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1652 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_change_network() Network type changed, moving "
1653 "%s address of peer %s from '%s' to '%s'\n",
1654 (GNUNET_YES == address->active) ? "active" : "inactive", GNUNET_i2s (&address->peer),
1655 GNUNET_ATS_print_network_type (current_network), GNUNET_ATS_print_network_type (new_network));
1657 if (address->active && !ril_network_is_active (solver, new_network))
1659 GAS_ril_address_delete (solver, address, GNUNET_NO);
1663 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1666 GNUNET_assert(!ril_network_is_active (solver, current_network));
1668 GAS_ril_address_add (s, address, new_network);
1672 net = ril_get_network (s, current_network);
1673 net->bw_in_assigned -= agent->bw_in;
1674 net->bw_out_assigned -= agent->bw_out;
1676 net = ril_get_network (s, new_network);
1677 net->bw_in_assigned -= min_bw;
1678 net->bw_out_assigned -= min_bw;
1679 address->solver_information = net;
1683 * Give feedback about the current assignment
1685 * @param solver the solver handle
1686 * @param application the application
1687 * @param peer the peer to change the preference for
1688 * @param scope the time interval for this feedback: [now - scope .. now]
1689 * @param kind the kind to change the preference
1690 * @param score the score
1693 GAS_ril_address_preference_feedback (void *solver,
1695 const struct GNUNET_PeerIdentity *peer,
1696 const struct GNUNET_TIME_Relative scope,
1697 enum GNUNET_ATS_PreferenceKind kind,
1700 //TODO! collect feedback
1701 LOG(GNUNET_ERROR_TYPE_DEBUG,
1702 "API_address_preference_feedback() Peer '%s' got a feedback of %+.3f from application %s for "
1703 "preference %s for %d seconds\n", GNUNET_i2s (peer), "UNKNOWN",
1704 GNUNET_ATS_print_preference_type (kind), scope.rel_value_us / 1000000);
1708 * Start a bulk operation
1710 * Since new calculations of the assignment are not triggered by a change of preferences, as it
1711 * happens in the proportional and the mlp solver, there is no need to block this solver.
1713 * @param solver the solver
1716 GAS_ril_bulk_start (void *solver)
1722 * Bulk operation done
1724 * Since new calculations of the assignment are not triggered by a change of preferences, as it
1725 * happens in the proportional and the mlp solver, there is no need to block this solver.
1727 * @param solver the solver handle
1730 GAS_ril_bulk_stop (void *solver)
1736 * Tell solver to notify ATS if the address to use changes for a specific
1737 * peer using the bandwidth changed callback
1739 * The solver must only notify about changes for peers with pending address
1742 * @param solver the solver handle
1743 * @param peer the identity of the peer
1745 const struct ATS_Address *
1746 GAS_ril_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
1749 * activate agent, return currently chosen address
1751 struct GAS_RIL_Handle *s = solver;
1752 struct RIL_Peer_Agent *agent;
1754 agent = ril_get_agent (s, peer, GNUNET_YES);
1756 agent->active = GNUNET_YES;
1758 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
1761 if (agent->address_inuse)
1763 LOG(GNUNET_ERROR_TYPE_DEBUG,
1764 "API_get_preferred_address() Activated agent for peer '%s' with %s address %p\n",
1765 GNUNET_i2s (peer), agent->address_inuse->plugin, agent->address_inuse->addr);
1769 LOG(GNUNET_ERROR_TYPE_DEBUG,
1770 "API_get_preferred_address() Activated agent for peer '%s', but no address available\n",
1774 return agent->address_inuse;
1778 * Tell solver stop notifying ATS about changes for this peers
1780 * The solver must only notify about changes for peers with pending address
1783 * @param solver the solver handle
1784 * @param peer the peer
1787 GAS_ril_stop_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
1789 struct GAS_RIL_Handle *s = solver;
1790 struct RIL_Peer_Agent *agent;
1792 agent = ril_get_agent (s, peer, GNUNET_NO);
1799 if (GNUNET_NO == agent->active)
1805 agent->active = GNUNET_NO;
1806 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
1809 LOG(GNUNET_ERROR_TYPE_DEBUG,
1810 "API_stop_get_preferred_address() Paused agent for peer '%s' with %s address\n",
1811 GNUNET_i2s (peer), agent->address_inuse->plugin);
1814 /* end of libgnunet_plugin_ats_ril.c */