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
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
700 * - Validity of the solution
702 const double *preferences;
703 const double *properties;
704 double pref_match = 0;
706 struct RIL_Network *net;
709 preferences = solver->plugin_envi->get_preferences (solver->plugin_envi->get_preference_cls,
711 properties = solver->plugin_envi->get_property (solver->plugin_envi->get_property_cls,
712 agent->address_inuse);
713 prop_index = ril_find_property_index (GNUNET_ATS_QUALITY_NET_DELAY);
714 pref_match += preferences[GNUNET_ATS_PREFERENCE_LATENCY] * (3 - properties[prop_index]); //invert property as we want to maximize for lower latencies
715 bw_norm = GNUNET_MAX(2, (((
716 ((double) agent->bw_in / (double) ril_get_max_bw(agent, GNUNET_YES)) +
717 ((double) agent->bw_out / (double) ril_get_max_bw(agent, GNUNET_NO))
720 pref_match += preferences[GNUNET_ATS_PREFERENCE_BANDWIDTH] * bw_norm;
722 net = agent->address_inuse->solver_information;
723 if ((net->bw_in_assigned > net->bw_in_available) || (net->bw_out_assigned > net->bw_out_available))
732 * Doubles the bandwidth for the active address
734 * @param solver solver handle
735 * @param agent agent handle
736 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise the outbound bandwidth
739 envi_action_bw_double (struct GAS_RIL_Handle *solver,
740 struct RIL_Peer_Agent *agent,
745 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in * 2,
746 agent->bw_out, GNUNET_NO);
750 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
751 agent->bw_out * 2, GNUNET_NO);
756 * Cuts the bandwidth for the active address in half. The least amount of bandwidth suggested, is
757 * the minimum bandwidth for a peer, in order to not invoke a disconnect.
759 * @param solver solver handle
760 * @param agent agent handle
761 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
765 envi_action_bw_halven (struct GAS_RIL_Handle *solver,
766 struct RIL_Peer_Agent *agent,
769 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
770 unsigned long long new_bw;
774 new_bw = agent->bw_in / 2;
777 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
782 new_bw = agent->bw_out / 2;
785 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
791 * Increases the bandwidth by 5 times the minimum bandwidth for the active address.
793 * @param solver solver handle
794 * @param agent agent handle
795 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
799 envi_action_bw_inc (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
801 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
805 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in + (5 * min_bw),
806 agent->bw_out, GNUNET_NO);
810 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
811 agent->bw_out + (5 * min_bw), GNUNET_NO);
816 * Decreases the bandwidth by 5 times the minimum bandwidth for the active address. The least amount
817 * of bandwidth suggested, is the minimum bandwidth for a peer, in order to not invoke a disconnect.
819 * @param solver solver handle
820 * @param agent agent handle
821 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
825 envi_action_bw_dec (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
827 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
828 unsigned long long new_bw;
832 new_bw = agent->bw_in - (5 * min_bw);
835 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
840 new_bw = agent->bw_out - (5 * min_bw);
843 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
849 * Switches to the address given by its index
851 * @param solver solver handle
852 * @param agent agent handle
853 * @param address_index index of the address as it is saved in the agent's list, starting with zero
856 envi_action_address_switch (struct GAS_RIL_Handle *solver,
857 struct RIL_Peer_Agent *agent,
858 unsigned int address_index)
860 struct RIL_Address_Wrapped *cur;
863 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
865 if (i == address_index)
867 envi_set_active_suggestion (solver, agent, cur->address_naked, agent->bw_in, agent->bw_out,
875 //no address with address_index exists, in this case this action should not be callable
876 GNUNET_assert(GNUNET_NO);
880 * Puts the action into effect by calling the according function
882 * @param solver solver handle
883 * @param action action to perform by the solver
886 envi_do_action (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int action)
892 case RIL_ACTION_NOTHING:
894 case RIL_ACTION_BW_IN_DBL:
895 envi_action_bw_double (solver, agent, GNUNET_YES);
897 case RIL_ACTION_BW_IN_HLV:
898 envi_action_bw_halven (solver, agent, GNUNET_YES);
900 case RIL_ACTION_BW_IN_INC:
901 envi_action_bw_inc (solver, agent, GNUNET_YES);
903 case RIL_ACTION_BW_IN_DEC:
904 envi_action_bw_dec (solver, agent, GNUNET_YES);
906 case RIL_ACTION_BW_OUT_DBL:
907 envi_action_bw_double (solver, agent, GNUNET_NO);
909 case RIL_ACTION_BW_OUT_HLV:
910 envi_action_bw_halven (solver, agent, GNUNET_NO);
912 case RIL_ACTION_BW_OUT_INC:
913 envi_action_bw_inc (solver, agent, GNUNET_NO);
915 case RIL_ACTION_BW_OUT_DEC:
916 envi_action_bw_dec (solver, agent, GNUNET_NO);
919 if ((action >= RIL_ACTION_TYPE_NUM) && (action < agent->n)) //switch address action
921 address_index = action - RIL_ACTION_TYPE_NUM;
923 GNUNET_assert(address_index >= 0);
925 address_index <= agent_address_get_index (agent, agent->addresses_tail->address_naked));
927 envi_action_address_switch (solver, agent, address_index);
930 // error - action does not exist
931 GNUNET_assert(GNUNET_NO);
936 * Performs one step of the Markov Decision Process. Other than in the literature the step starts
937 * after having done the last action a_old. It observes the new state s_next and the reward
938 * received. Then the coefficient update is done according to the SARSA or Q-learning method. The
939 * next action is put into effect.
941 * @param agent the agent performing the step
944 agent_step (struct RIL_Peer_Agent *agent)
946 int a_next = RIL_ACTION_INVALID;
950 s_next = envi_get_state (agent->envi, agent);
951 reward = envi_get_reward (agent->envi, agent);
953 LOG(GNUNET_ERROR_TYPE_DEBUG, "agent_step() with algorithm %s\n",
954 agent->envi->parameters.algorithm ? "Q" : "SARSA");
956 switch (agent->envi->parameters.algorithm)
959 agent_modify_eligibility (agent, RIL_E_SET);
960 if (agent_decide_exploration (agent))
962 a_next = agent_get_action_explore (agent, s_next);
966 a_next = agent_get_action_best (agent, s_next);
968 if (RIL_ACTION_INVALID != agent->a_old)
970 //updates weights with selected action (on-policy), if not first step
971 agent_update_weights (agent, reward, s_next, a_next);
976 a_next = agent_get_action_best (agent, s_next);
977 if (RIL_ACTION_INVALID != agent->a_old)
979 //updates weights with best action, disregarding actually selected action (off-policy), if not first step
980 agent_update_weights (agent, reward, s_next, a_next);
982 if (agent_decide_exploration (agent))
984 a_next = agent_get_action_explore (agent, s_next);
985 agent_modify_eligibility (agent, RIL_E_ZERO);
989 a_next = agent_get_action_best (agent, s_next);
990 agent_modify_eligibility (agent, RIL_E_SET);
995 GNUNET_assert(RIL_ACTION_INVALID != a_next);
997 agent_modify_eligibility (agent, RIL_E_ACCUMULATE);
999 envi_do_action (agent->envi, agent, a_next);
1001 GNUNET_free(agent->s_old);
1002 agent->s_old = s_next;
1003 agent->a_old = a_next;
1005 agent->step_count += 1;
1009 * Cycles through all agents and lets the active ones do a step. Schedules the next step.
1011 * @param solver the solver handle
1012 * @param tc task context for the scheduler
1015 ril_periodic_step (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1017 struct GAS_RIL_Handle *solver = cls;
1018 struct RIL_Peer_Agent *cur;
1020 LOG(GNUNET_ERROR_TYPE_DEBUG, "RIL step number %d\n", solver->step_count);
1022 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1024 if (cur->active && cur->address_inuse)
1030 solver->step_count += 1;
1031 solver->next_step = GNUNET_SCHEDULER_add_delayed (solver->step_time, &ril_periodic_step, solver);
1035 * Initialize an agent without addresses and its knowledge base
1037 * @param s ril solver
1038 * @param peer the one in question
1039 * @return handle to the new agent
1041 static struct RIL_Peer_Agent *
1042 agent_init (void *s, const struct GNUNET_PeerIdentity *peer)
1045 struct GAS_RIL_Handle * solver = s;
1046 struct RIL_Peer_Agent * agent = GNUNET_malloc (sizeof (struct RIL_Peer_Agent));
1048 agent->envi = solver;
1049 agent->peer = *peer;
1050 agent->step_count = 0;
1051 agent->active = GNUNET_NO;
1052 agent->n = RIL_ACTION_TYPE_NUM;
1053 agent->m = solver->networks_count * RIL_FEATURES_NETWORK_COUNT;
1054 agent->W = (double **) GNUNET_malloc (sizeof (double *) * agent->n);
1055 for (i = 0; i < agent->n; i++)
1057 agent->W[i] = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1059 agent->a_old = RIL_ACTION_INVALID;
1060 agent->s_old = envi_get_state (solver, agent);
1061 agent->e = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1062 agent_modify_eligibility (agent, RIL_E_ZERO);
1064 GNUNET_CONTAINER_DLL_insert_tail(solver->agents_head, solver->agents_tail, agent);
1072 * @param s solver handle
1073 * @param agent the agent to retire
1076 agent_die (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
1080 for (i = 0; i < agent->n; i++)
1082 GNUNET_free(agent->W[i]);
1084 GNUNET_free(agent->W);
1085 GNUNET_free(agent->e);
1086 GNUNET_free(agent->s_old);
1091 * Returns the agent for a peer
1093 * @param s solver handle
1094 * @param peer identity of the peer
1095 * @param create whether to create an agent if none is allocated yet
1098 static struct RIL_Peer_Agent *
1099 ril_get_agent (struct GAS_RIL_Handle *solver, const struct GNUNET_PeerIdentity *peer, int create)
1101 struct RIL_Peer_Agent *cur;
1103 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1105 if (0 == memcmp (peer, &cur->peer, sizeof(struct GNUNET_PeerIdentity)))
1113 return agent_init (solver, peer);
1119 * Lookup network struct by type
1121 * @param s the solver handle
1122 * @param type the network type
1123 * @return the network struct
1125 static struct RIL_Network *
1126 ril_get_network (struct GAS_RIL_Handle *s, uint32_t type)
1130 for (i = 0; i < s->networks_count; i++)
1132 if (s->network_entries[i].type == type)
1134 return &s->network_entries[i];
1141 * Determine whether at least the minimum bandwidth is set for the network. Otherwise the network is
1142 * considered inactive and not used. Addresses in an inactive network are ignored.
1144 * @param solver solver handle
1145 * @param network the network type
1146 * @return whether or not the network is considered active
1149 ril_network_is_active (struct GAS_RIL_Handle *solver, enum GNUNET_ATS_Network_Type network)
1151 struct RIL_Network *net;
1152 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1154 net = ril_get_network (solver, network);
1155 if (net->bw_out_available < min_bw)
1161 * Cuts a slice out of a vector of elements. This is used to decrease the size of the matrix storing
1162 * the reward function approximation. It copies the memory, which is not cut, to the new vector,
1163 * frees the memory of the old vector, and redirects the pointer to the new one.
1165 * @param old pointer to the pointer to the first element of the vector
1166 * @param element_size byte size of the vector elements
1167 * @param hole_start the first element to cut out
1168 * @param hole_length the number of elements to cut out
1169 * @param old_length the length of the old vector
1172 ril_cut_from_vector (void **old,
1173 size_t element_size,
1174 unsigned int hole_start,
1175 unsigned int hole_length,
1176 unsigned int old_length)
1179 char *oldptr = (char *) *old;
1181 unsigned int bytes_before;
1182 unsigned int bytes_hole;
1183 unsigned int bytes_after;
1185 GNUNET_assert(old_length > hole_length);
1186 GNUNET_assert(old_length >= (hole_start + hole_length));
1188 size = element_size * (old_length - hole_length);
1190 bytes_before = element_size * hole_start;
1191 bytes_hole = element_size * hole_length;
1192 bytes_after = element_size * (old_length - hole_start - hole_length);
1200 tmpptr = GNUNET_malloc (size);
1201 memcpy (tmpptr, oldptr, bytes_before);
1202 memcpy (tmpptr + bytes_before, oldptr + (bytes_before + bytes_hole), bytes_after);
1208 *old = (void *) tmpptr;
1212 * Solver API functions
1213 * ---------------------------
1217 * Change relative preference for quality in solver
1219 * @param solver the solver handle
1220 * @param peer the peer to change the preference for
1221 * @param kind the kind to change the preference
1222 * @param pref_rel the normalized preference value for this kind over all clients
1225 GAS_ril_address_change_preference (void *s,
1226 const struct GNUNET_PeerIdentity *peer,
1227 enum GNUNET_ATS_PreferenceKind kind,
1230 LOG(GNUNET_ERROR_TYPE_DEBUG,
1231 "API_address_change_preference() Preference '%s' for peer '%s' changed to %.2f \n",
1232 GNUNET_ATS_print_preference_type (kind), GNUNET_i2s (peer), pref_rel);
1234 * Nothing to do here. Preferences are considered during reward calculation.
1239 * Entry point for the plugin
1241 * @param cls pointer to the 'struct GNUNET_ATS_PluginEnvironment'
1244 libgnunet_plugin_ats_ril_init (void *cls)
1246 struct GNUNET_ATS_PluginEnvironment *env = cls;
1247 struct GAS_RIL_Handle *solver = GNUNET_new (struct GAS_RIL_Handle);
1248 struct RIL_Network * cur;
1250 unsigned long long tmp;
1253 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_init() Initializing RIL solver\n");
1255 GNUNET_assert(NULL != env);
1256 GNUNET_assert(NULL != env->cfg);
1257 GNUNET_assert(NULL != env->stats);
1258 GNUNET_assert(NULL != env->bandwidth_changed_cb);
1259 GNUNET_assert(NULL != env->get_preferences);
1260 GNUNET_assert(NULL != env->get_property);
1263 != GNUNET_CONFIGURATION_get_value_time (env->cfg, "ats", "RIL_STEP_TIME", &solver->step_time))
1265 solver->step_time = RIL_DEFAULT_STEP_TIME;
1267 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_ALGORITHM", &string)
1268 && NULL != string && 0 == strcmp (string, "SARSA"))
1270 solver->parameters.algorithm = RIL_ALGO_SARSA;
1274 solver->parameters.algorithm = RIL_DEFAULT_ALGORITHM;
1277 == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_DISCOUNT_FACTOR", &tmp))
1279 solver->parameters.gamma = (double) tmp / 100;
1283 solver->parameters.gamma = RIL_DEFAULT_DISCOUNT_FACTOR;
1286 == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_GRADIENT_STEP_SIZE", &tmp))
1288 solver->parameters.alpha = (double) tmp / 100;
1292 solver->parameters.alpha = RIL_DEFAULT_GRADIENT_STEP_SIZE;
1294 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (env->cfg, "ats", "RIL_TRACE_DECAY", &tmp))
1296 solver->parameters.lambda = (double) tmp / 100;
1300 solver->parameters.lambda = RIL_DEFAULT_TRACE_DECAY;
1303 env->sf.s_add = &GAS_ril_address_add;
1304 env->sf.s_address_update_property = &GAS_ril_address_property_changed;
1305 env->sf.s_address_update_session = &GAS_ril_address_session_changed;
1306 env->sf.s_address_update_inuse = &GAS_ril_address_inuse_changed;
1307 env->sf.s_address_update_network = &GAS_ril_address_change_network;
1308 env->sf.s_get = &GAS_ril_get_preferred_address;
1309 env->sf.s_get_stop = &GAS_ril_stop_get_preferred_address;
1310 env->sf.s_pref = &GAS_ril_address_change_preference;
1311 env->sf.s_feedback = &GAS_ril_address_preference_feedback;
1312 env->sf.s_del = &GAS_ril_address_delete;
1313 env->sf.s_bulk_start = &GAS_ril_bulk_start;
1314 env->sf.s_bulk_stop = &GAS_ril_bulk_stop;
1316 solver->plugin_envi = env;
1317 solver->networks_count = env->network_count;
1318 solver->network_entries = GNUNET_malloc (env->network_count * sizeof (struct RIL_Network));
1319 solver->step_count = 0;
1321 for (c = 0; c < env->network_count; c++)
1323 cur = &solver->network_entries[c];
1324 cur->type = env->networks[c];
1325 cur->bw_in_available = env->in_quota[c];
1326 cur->bw_in_assigned = 0;
1327 cur->bw_out_available = env->out_quota[c];
1328 cur->bw_out_assigned = 0;
1331 solver->next_step = GNUNET_SCHEDULER_add_delayed (
1332 GNUNET_TIME_relative_multiply (GNUNET_TIME_relative_get_millisecond_ (), 1000),
1333 &ril_periodic_step, solver);
1339 * Exit point for the plugin
1341 * @param cls the solver handle
1344 libgnunet_plugin_ats_ril_done (void *cls)
1346 struct GAS_RIL_Handle *s = cls;
1347 struct RIL_Peer_Agent *cur_agent;
1348 struct RIL_Peer_Agent *next_agent;
1350 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_done() Shutting down RIL solver\n");
1352 cur_agent = s->agents_head;
1353 while (NULL != cur_agent)
1355 next_agent = cur_agent->next;
1356 GNUNET_CONTAINER_DLL_remove(s->agents_head, s->agents_tail, cur_agent);
1357 agent_die (s, cur_agent);
1358 cur_agent = next_agent;
1361 GNUNET_SCHEDULER_cancel (s->next_step);
1362 GNUNET_free(s->network_entries);
1369 * Add a new address for a peer to the solver
1371 * The address is already contained in the addresses hashmap!
1373 * @param solver the solver Handle
1374 * @param address the address to add
1375 * @param network network type of this address
1378 GAS_ril_address_add (void *solver, struct ATS_Address *address, uint32_t network)
1380 struct GAS_RIL_Handle *s = solver;
1381 struct RIL_Peer_Agent *agent;
1382 struct RIL_Address_Wrapped *address_wrapped;
1383 struct RIL_Network *net;
1390 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1392 net = ril_get_network (s, network);
1393 address->solver_information = net;
1395 if (!ril_network_is_active (s, network))
1397 LOG(GNUNET_ERROR_TYPE_DEBUG,
1398 "API_address_add() Did not add %s address %p for peer '%s', network does not have enough bandwidth\n",
1399 address->plugin, address->addr, GNUNET_i2s (&address->peer));
1403 agent = ril_get_agent (s, &address->peer, GNUNET_YES);
1406 address_wrapped = GNUNET_malloc (sizeof (struct RIL_Address_Wrapped));
1407 address_wrapped->address_naked = address;
1408 GNUNET_CONTAINER_DLL_insert_tail(agent->addresses_head, agent->addresses_tail, address_wrapped);
1410 //increase size of W
1411 m_new = agent->m + RIL_FEATURES_ADDRESS_COUNT;
1413 n_new = agent->n + 1;
1416 GNUNET_array_grow(agent->W, agent->n, n_new);
1417 for (i = 0; i < n_new; i++)
1422 GNUNET_array_grow(agent->W[i], agent->m, m_new);
1427 GNUNET_array_grow(agent->W[i], zero, m_new);
1431 //increase size of old state vector
1433 GNUNET_array_grow(agent->s_old, agent->m, m_new);
1436 GNUNET_array_grow(agent->e, agent->m, m_new);
1438 if (NULL == agent->address_inuse)
1440 net->bw_in_assigned += min_bw;
1441 net->bw_out_assigned += min_bw;
1442 envi_set_active_suggestion (s, agent, address, min_bw, min_bw, GNUNET_NO);
1445 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_add() Added %s %s address %p for peer '%s'\n",
1446 address->active ? "active" : "inactive", address->plugin, address->addr,
1447 GNUNET_i2s (&address->peer));
1451 * Delete an address in the solver
1453 * The address is not contained in the address hashmap anymore!
1455 * @param solver the solver handle
1456 * @param address the address to remove
1457 * @param session_only delete only session not whole address
1460 GAS_ril_address_delete (void *solver, struct ATS_Address *address, int session_only)
1462 struct GAS_RIL_Handle *s = solver;
1463 struct RIL_Peer_Agent *agent;
1464 struct RIL_Address_Wrapped *address_wrapped;
1465 int address_was_used = address->active;
1470 struct RIL_Network *net;
1471 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1473 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_delete() Delete %s%s %s address %p for peer '%s'\n",
1474 session_only ? "session for " : "", address->active ? "active" : "inactive", address->plugin,
1475 address->addr, GNUNET_i2s (&address->peer));
1477 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1480 net = address->solver_information;
1481 GNUNET_assert(!ril_network_is_active (s, net->type));
1482 LOG(GNUNET_ERROR_TYPE_DEBUG,
1483 "No agent allocated for peer yet, since address was in inactive network\n");
1487 address_index = agent_address_get_index (agent, address);
1488 address_wrapped = agent_address_get (agent, address);
1490 if (NULL == address_wrapped)
1492 net = address->solver_information;
1493 GNUNET_assert(!ril_network_is_active (s, net->type));
1494 LOG(GNUNET_ERROR_TYPE_DEBUG,
1495 "Address not considered by agent, address was in inactive network\n");
1499 GNUNET_CONTAINER_DLL_remove(agent->addresses_head, agent->addresses_tail, address_wrapped);
1500 GNUNET_free(address_wrapped);
1503 m_new = agent->m - RIL_FEATURES_ADDRESS_COUNT;
1504 n_new = agent->n - 1;
1506 for (i = 0; i < agent->n; i++)
1508 ril_cut_from_vector ((void **) &agent->W[i], sizeof(double),
1509 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1510 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1512 GNUNET_free(agent->W[RIL_ACTION_TYPE_NUM + address_index]);
1513 ril_cut_from_vector ((void **) &agent->W, sizeof(double *), RIL_ACTION_TYPE_NUM + address_index,
1515 //correct last action
1516 if (agent->a_old > (RIL_ACTION_TYPE_NUM + address_index))
1520 else if (agent->a_old == (RIL_ACTION_TYPE_NUM + address_index))
1522 agent->a_old = RIL_ACTION_INVALID;
1524 //decrease old state vector and eligibility vector
1525 ril_cut_from_vector ((void **) &agent->s_old, sizeof(double),
1526 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1527 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1528 ril_cut_from_vector ((void **) &agent->e, sizeof(double),
1529 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1530 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1534 LOG(GNUNET_ERROR_TYPE_DEBUG, "address was used: %s\n", address_was_used ? "yes" : "no");
1536 if (address_was_used)
1538 net = address->solver_information;
1539 net->bw_in_assigned -= agent->bw_in;
1540 net->bw_out_assigned -= agent->bw_out;
1542 if (NULL != agent->addresses_head) //if peer has an address left, use it
1544 LOG(GNUNET_ERROR_TYPE_DEBUG, "address left: %p\n",
1545 agent->addresses_head->address_naked->addr);
1546 //TODO? check if network/bandwidth update can be done more clever/elegant at different function
1547 envi_set_active_suggestion (s, agent, agent->addresses_head->address_naked, min_bw, min_bw,
1549 net = agent->addresses_head->address_naked->solver_information;
1550 net->bw_in_assigned -= min_bw;
1551 net->bw_out_assigned -= min_bw;
1555 LOG(GNUNET_ERROR_TYPE_DEBUG, "no address left => disconnect\n");
1557 envi_set_active_suggestion (s, agent, NULL, 0, 0, GNUNET_NO);
1561 LOG(GNUNET_ERROR_TYPE_DEBUG, "Address deleted\n");
1565 * Update the properties of an address in the solver
1567 * @param solver solver handle
1568 * @param address the address
1569 * @param type the ATSI type in HBO
1570 * @param abs_value the absolute value of the property
1571 * @param rel_value the normalized value
1574 GAS_ril_address_property_changed (void *solver,
1575 struct ATS_Address *address,
1580 LOG(GNUNET_ERROR_TYPE_DEBUG,
1581 "API_address_property_changed() Property '%s' for peer '%s' address %p changed "
1582 "to %.2f \n", GNUNET_ATS_print_property_type (type), GNUNET_i2s (&address->peer),
1583 address->addr, rel_value);
1585 * Nothing to do here, properties are considered in every reward calculation
1590 * Update the session of an address in the solver
1592 * NOTE: values in addresses are already updated
1594 * @param solver solver handle
1595 * @param address the address
1596 * @param cur_session the current session
1597 * @param new_session the new session
1600 GAS_ril_address_session_changed (void *solver,
1601 struct ATS_Address *address,
1602 uint32_t cur_session,
1603 uint32_t new_session)
1606 * TODO? Future Work: Potentially add session activity as a feature in state vector
1608 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_session_changed()\n");
1612 * Notify the solver that an address is (not) actively used by transport
1613 * to communicate with a remote peer
1615 * NOTE: values in addresses are already updated
1617 * @param solver solver handle
1618 * @param address the address
1619 * @param in_use usage state
1622 GAS_ril_address_inuse_changed (void *solver, struct ATS_Address *address, int in_use)
1624 /* Nothing to do here.
1625 * Possible TODO? Future Work: Use usage as state vector
1627 LOG(GNUNET_ERROR_TYPE_DEBUG,
1628 "API_address_inuse_changed() Usage for %s address of peer '%s' changed to %s\n",
1629 address->plugin, GNUNET_i2s (&address->peer), (GNUNET_YES == in_use) ? "USED" : "UNUSED");
1633 * Notify solver that the network an address is located in has changed
1635 * NOTE: values in addresses are already updated
1637 * @param solver solver handle
1638 * @param address the address
1639 * @param current_network the current network
1640 * @param new_network the new network
1643 GAS_ril_address_change_network (void *solver,
1644 struct ATS_Address *address,
1645 uint32_t current_network,
1646 uint32_t new_network)
1648 struct GAS_RIL_Handle *s = solver;
1649 struct RIL_Peer_Agent *agent;
1650 struct RIL_Network *net;
1651 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1653 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_change_network() Network type changed, moving "
1654 "%s address of peer %s from '%s' to '%s'\n",
1655 (GNUNET_YES == address->active) ? "active" : "inactive", GNUNET_i2s (&address->peer),
1656 GNUNET_ATS_print_network_type (current_network), GNUNET_ATS_print_network_type (new_network));
1658 if (address->active && !ril_network_is_active (solver, new_network))
1660 GAS_ril_address_delete (solver, address, GNUNET_NO);
1664 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1667 GNUNET_assert(!ril_network_is_active (solver, current_network));
1669 GAS_ril_address_add (s, address, new_network);
1673 net = ril_get_network (s, current_network);
1674 net->bw_in_assigned -= agent->bw_in;
1675 net->bw_out_assigned -= agent->bw_out;
1677 net = ril_get_network (s, new_network);
1678 net->bw_in_assigned -= min_bw;
1679 net->bw_out_assigned -= min_bw;
1680 address->solver_information = net;
1684 * Give feedback about the current assignment
1686 * @param solver the solver handle
1687 * @param application the application
1688 * @param peer the peer to change the preference for
1689 * @param scope the time interval for this feedback: [now - scope .. now]
1690 * @param kind the kind to change the preference
1691 * @param score the score
1694 GAS_ril_address_preference_feedback (void *solver,
1696 const struct GNUNET_PeerIdentity *peer,
1697 const struct GNUNET_TIME_Relative scope,
1698 enum GNUNET_ATS_PreferenceKind kind,
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;
1753 struct RIL_Network *net;
1755 agent = ril_get_agent (s, peer, GNUNET_YES);
1757 agent->active = GNUNET_YES;
1759 if (agent->address_inuse)
1761 net = agent->address_inuse->solver_information;
1762 net->bw_in_assigned += agent->bw_in;
1763 net->bw_out_assigned += agent->bw_out;
1765 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
1768 if (agent->address_inuse)
1770 LOG(GNUNET_ERROR_TYPE_DEBUG,
1771 "API_get_preferred_address() Activated agent for peer '%s' with %s address %p\n",
1772 GNUNET_i2s (peer), agent->address_inuse->plugin, agent->address_inuse->addr);
1776 LOG(GNUNET_ERROR_TYPE_DEBUG,
1777 "API_get_preferred_address() Activated agent for peer '%s', but no address available\n",
1781 return agent->address_inuse;
1785 * Tell solver stop notifying ATS about changes for this peers
1787 * The solver must only notify about changes for peers with pending address
1790 * @param solver the solver handle
1791 * @param peer the peer
1794 GAS_ril_stop_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
1796 struct GAS_RIL_Handle *s = solver;
1797 struct RIL_Peer_Agent *agent;
1798 struct RIL_Network *net;
1800 agent = ril_get_agent (s, peer, GNUNET_NO);
1807 if (GNUNET_NO == agent->active)
1813 agent->active = GNUNET_NO;
1814 if (agent->address_inuse)
1816 net = agent->address_inuse->solver_information;
1817 net->bw_in_assigned -= agent->bw_in;
1818 net->bw_out_assigned -= agent->bw_out;
1820 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
1823 LOG(GNUNET_ERROR_TYPE_DEBUG,
1824 "API_stop_get_preferred_address() Paused agent for peer '%s' with %s address\n",
1825 GNUNET_i2s (peer), agent->address_inuse->plugin);
1828 /* end of libgnunet_plugin_ats_ril.c */