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
34 #define RIL_INTERVAL_EXPONENT 10
36 #define RIL_DEFAULT_STEP_TIME_MIN GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MILLISECONDS, 500)
37 #define RIL_DEFAULT_STEP_TIME_MAX GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MILLISECONDS, 3000)
38 #define RIL_DEFAULT_ALGORITHM RIL_ALGO_SARSA
39 #define RIL_DEFAULT_DISCOUNT_BETA 0.7
40 #define RIL_DEFAULT_GRADIENT_STEP_SIZE 0.3
41 #define RIL_DEFAULT_TRACE_DECAY 0.5
42 #define RIL_DEFAULT_EXPLORE_RATIO 0.1
45 * ATS reinforcement learning solver
51 * The actions, how an agent can manipulate the current assignment. I.e. how the bandwidth can be
52 * changed for the currently chosen address. Not depicted in the enum are the actions of switching
53 * to a particular address. The action of switching to address with index i is depicted by the
54 * number (RIL_ACTION_TYPE_NUM + i).
58 RIL_ACTION_NOTHING = 0,
59 RIL_ACTION_BW_IN_DBL = 1,
60 RIL_ACTION_BW_IN_HLV = 2,
61 RIL_ACTION_BW_IN_INC = 3,
62 RIL_ACTION_BW_IN_DEC = 4,
63 RIL_ACTION_BW_OUT_DBL = 5,
64 RIL_ACTION_BW_OUT_HLV = 6,
65 RIL_ACTION_BW_OUT_INC = 7,
66 RIL_ACTION_BW_OUT_DEC = 8,
67 RIL_ACTION_TYPE_NUM = 9
76 enum RIL_E_Modification
85 * Global learning parameters
87 struct RIL_Learning_Parameters
90 * The TD-algorithm to use
92 enum RIL_Algorithm algorithm;
95 * Learning discount factor in the TD-update
100 * Gradient-descent step-size
105 * Trace-decay factor for eligibility traces
112 double explore_ratio;
115 * Minimal interval time between steps in milliseconds
117 struct GNUNET_TIME_Relative step_time_min;
120 * Maximum interval time between steps in milliseconds
122 struct GNUNET_TIME_Relative step_time_max;
126 * Wrapper for addresses to store them in agent's linked list
128 struct RIL_Address_Wrapped
133 struct RIL_Address_Wrapped *next;
138 struct RIL_Address_Wrapped *prev;
143 struct ATS_Address *address_naked;
146 struct RIL_Peer_Agent
149 * Next agent in solver's linked list
151 struct RIL_Peer_Agent *next;
154 * Previous agent in solver's linked list
156 struct RIL_Peer_Agent *prev;
161 struct GAS_RIL_Handle *envi;
166 struct GNUNET_PeerIdentity peer;
169 * Whether the agent is active or not
174 * Number of performed time-steps
176 unsigned long long step_count;
179 * Experience matrix W
184 * Number of rows of W / Number of state-vector features
189 * Number of columns of W / Number of actions
194 * Last perceived state feature vector
204 * Eligibility trace vector
211 struct ATS_Address * address_inuse;
214 * Head of addresses DLL
216 struct RIL_Address_Wrapped * addresses_head;
219 * Tail of addresses DLL
221 struct RIL_Address_Wrapped * addresses_tail;
224 * Inbound bandwidth assigned by the agent
226 unsigned long long bw_in;
229 * Outbound bandwidth assigned by the agent
231 unsigned long long bw_out;
234 * Flag whether a suggestion has to be issued
236 int suggestion_issue;
239 * The address which has to be issued ()
241 struct ATS_Address * suggestion_address;
249 enum GNUNET_ATS_Network_Type type;
252 * Total available inbound bandwidth
254 unsigned long long bw_in_available;
257 * Total available outbound bandwidth
259 unsigned long long bw_out_available;
263 * A handle for the reinforcement learning solver
265 struct GAS_RIL_Handle
268 * The solver-plugin environment of the solver-plugin API
270 struct GNUNET_ATS_PluginEnvironment *plugin_envi;
275 struct GNUNET_STATISTICS_Handle *stats;
278 * Number of performed steps
280 unsigned long long step_count;
283 * Timestamp for the last time-step
285 struct GNUNET_TIME_Absolute step_time_last;
288 * Task identifier of the next time-step to be executed
290 GNUNET_SCHEDULER_TaskIdentifier step_next_task_id;
293 * Whether a step is already scheduled
298 * Variable discount factor, dependent on time between steps
300 double discount_variable;
303 * Integrated variable discount factor, dependent on time between steps
305 double discount_integrated;
308 * Lock for bulk operations
313 * Number of changes during a lock
318 * Learning parameters
320 struct RIL_Learning_Parameters parameters;
323 * Array of networks with global assignment state
325 struct RIL_Network * network_entries;
330 unsigned int networks_count;
333 * List of active peer-agents
335 struct RIL_Peer_Agent * agents_head;
336 struct RIL_Peer_Agent * agents_tail;
341 * ---------------------------
345 * Estimate the current action-value for state s and action a
347 * @param agent agent performing the estimation
350 * @return estimation value
353 agent_estimate_q (struct RIL_Peer_Agent *agent, double *state, int action)
358 for (i = 0; i < agent->m; i++)
360 result += state[i] * agent->W[action][i];
367 * Decide whether to do exploration (i.e. taking a new action) or exploitation (i.e. taking the
368 * currently estimated best action) in the current step
370 * @param agent agent performing the step
371 * @return yes, if exploring
374 agent_decide_exploration (struct RIL_Peer_Agent *agent)
376 //TODO? Future Work: Improve exploration/exploitation trade-off by different mechanisms than e-greedy
377 double r = (double) GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
378 UINT32_MAX) / (double) UINT32_MAX;
380 if (r < agent->envi->parameters.explore_ratio)
388 * Get the index of the address in the agent's list.
390 * @param agent agent handle
391 * @param address address handle
392 * @return the index, starting with zero
395 agent_address_get_index (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
398 struct RIL_Address_Wrapped *cur;
401 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
404 if (cur->address_naked == address)
414 * Gets the wrapped address from the agent's list
416 * @param agent agent handle
417 * @param address address handle
418 * @return wrapped address
420 static struct RIL_Address_Wrapped *
421 agent_address_get (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
423 struct RIL_Address_Wrapped *cur;
425 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
427 if (cur->address_naked == address)
437 * Gets the action, with the maximal estimated Q-value (i.e. the one currently estimated to bring the
438 * most reward in the future)
440 * @param agent agent performing the calculation
441 * @param state the state from which to take the action
442 * @return the action promising most future reward
445 agent_get_action_best (struct RIL_Peer_Agent *agent, double *state)
448 int max_i = RIL_ACTION_INVALID;
450 double max_q = -DBL_MAX;
452 for (i = 0; i < agent->n; i++)
454 cur_q = agent_estimate_q (agent, state, i);
462 GNUNET_assert(RIL_ACTION_INVALID != max_i);
468 * Gets any action, to explore the action space from that state
470 * @param agent agent performing the calculation
471 * @param state the state from which to take the action
475 agent_get_action_explore (struct RIL_Peer_Agent *agent, double *state)
477 // TODO?: Future Work: Choose the action for exploration, which has been explored the least in this state
478 return GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, agent->n);
482 * Updates the weights (i.e. coefficients) of the weight vector in matrix W for action a
484 * @param agent the agent performing the update
485 * @param reward the reward received for the last action
486 * @param s_next the new state, the last step got the agent into
487 * @param a_prime the new
490 agent_update_weights (struct RIL_Peer_Agent *agent, double reward, double *s_next, int a_prime)
494 double *theta = agent->W[agent->a_old];
496 delta = agent->envi->discount_integrated * reward; //reward
497 delta += agent->envi->discount_variable * agent_estimate_q (agent, s_next, a_prime); //discounted future value
498 delta -= agent_estimate_q (agent, agent->s_old, agent->a_old); //one step
499 for (i = 0; i < agent->m; i++)
501 theta[i] += agent->envi->parameters.alpha * delta * agent->e[i];
506 * Changes the eligibility trace vector e in various manners:
507 * RIL_E_ACCUMULATE - adds 1 to each component as in accumulating eligibility traces
508 * RIL_E_REPLACE - resets each component to 1 as in replacing traces
509 * RIL_E_SET - multiplies e with discount factor and lambda as in the update rule
510 * RIL_E_ZERO - sets e to 0 as in Watkin's Q-learning algorithm when exploring and when initializing
512 * @param agent the agent handle
513 * @param mod the kind of modification
516 agent_modify_eligibility (struct RIL_Peer_Agent *agent, enum RIL_E_Modification mod)
519 double *e = agent->e;
521 for (i = 0; i < agent->m; i++)
525 case RIL_E_ACCUMULATE:
532 e[i] *= agent->envi->discount_variable * agent->envi->parameters.lambda;
542 ril_inform (struct GAS_RIL_Handle *solver,
543 enum GAS_Solver_Operation op,
544 enum GAS_Solver_Status stat)
546 if (NULL != solver->plugin_envi->info_cb)
547 solver->plugin_envi->info_cb (solver->plugin_envi->info_cb_cls, op, stat, GAS_INFO_NONE);
551 * Changes the active assignment suggestion of the handler and invokes the bw_changed callback to
552 * notify ATS of its new decision
554 * @param solver solver handle
555 * @param agent agent handle
556 * @param new_address the address which is to be used
557 * @param new_bw_in the new amount of inbound bandwidth set for this address
558 * @param new_bw_out the new amount of outbound bandwidth set for this address
559 * @param silent disables invocation of the bw_changed callback, if GNUNET_YES
562 envi_set_active_suggestion (struct GAS_RIL_Handle *solver,
563 struct RIL_Peer_Agent *agent,
564 struct ATS_Address *new_address,
565 unsigned long long new_bw_in,
566 unsigned long long new_bw_out,
569 int notify = GNUNET_NO;
571 LOG(GNUNET_ERROR_TYPE_DEBUG, " set_active_suggestion() for peer '%s'\n", GNUNET_i2s (&agent->peer));
574 if (agent->address_inuse != new_address)
576 if (NULL != agent->address_inuse)
578 agent->address_inuse->active = GNUNET_NO;
579 agent->address_inuse->assigned_bw_in.value__ = htonl (0);
580 agent->address_inuse->assigned_bw_out.value__ = htonl (0);
582 if (NULL != new_address)
584 LOG(GNUNET_ERROR_TYPE_DEBUG, " set address active: %s\n", agent->is_active ? "yes" : "no");
585 new_address->active = agent->is_active;
586 new_address->assigned_bw_in.value__ = htonl (agent->bw_in);
587 new_address->assigned_bw_out.value__ = htonl (agent->bw_out);
589 notify |= GNUNET_YES;
595 if (new_address->active != agent->is_active)
597 new_address->active = agent->is_active;
598 notify |= GNUNET_YES;
602 if (agent->bw_in != new_bw_in)
604 agent->bw_in = new_bw_in;
605 new_address->assigned_bw_in.value__ = htonl (new_bw_in);
606 notify |= GNUNET_YES;
608 if (agent->bw_out != new_bw_out)
610 agent->bw_out = new_bw_out;
611 new_address->assigned_bw_out.value__ = htonl (new_bw_out);
612 notify |= GNUNET_YES;
616 if (notify && agent->is_active && (GNUNET_NO == silent))
620 LOG(GNUNET_ERROR_TYPE_DEBUG, " envi_set_active_suggestion() notify\n");
621 agent->suggestion_issue = GNUNET_YES;
622 agent->suggestion_address = new_address;
624 else if (agent->address_inuse)
626 //disconnect case, no new address
627 GNUNET_assert(0 == ntohl (agent->address_inuse->assigned_bw_in.value__));
628 GNUNET_assert(0 == ntohl (agent->address_inuse->assigned_bw_out.value__));
632 agent->suggestion_issue = GNUNET_YES;
633 agent->suggestion_address = agent->address_inuse;
636 agent->address_inuse = new_address;
639 static unsigned long long
640 ril_network_get_assigned (struct GAS_RIL_Handle *solver, enum GNUNET_ATS_Network_Type type, int direction_in)
642 struct RIL_Peer_Agent *cur;
643 struct RIL_Network *net;
644 unsigned long long sum = 0;
646 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
648 if (cur->is_active && cur->address_inuse)
650 net = cur->address_inuse->solver_information;
651 if (net->type == type)
665 * Allocates a state vector and fills it with the features present
666 * @param solver the solver handle
667 * @param agent the agent handle
668 * @return pointer to the state vector
671 envi_get_state (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
675 struct RIL_Network net;
676 double *state = GNUNET_malloc (sizeof (double) * agent->m);
677 struct RIL_Address_Wrapped *cur_address;
678 const double *properties;
680 for (i = 0; i < solver->networks_count; i++)
682 net = solver->network_entries[i];
683 state[i * RIL_FEATURES_NETWORK_COUNT + 0] = (double) ril_network_get_assigned(solver, net.type, GNUNET_YES);
684 state[i * RIL_FEATURES_NETWORK_COUNT + 1] = (double) net.bw_in_available;
685 state[i * RIL_FEATURES_NETWORK_COUNT + 2] = (double) ril_network_get_assigned(solver, net.type, GNUNET_NO);
686 state[i * RIL_FEATURES_NETWORK_COUNT + 3] = (double) net.bw_out_available;
689 i = i * RIL_FEATURES_NETWORK_COUNT; //first address feature
691 for (cur_address = agent->addresses_head; NULL != cur_address; cur_address = cur_address->next)
693 state[i++] = cur_address->address_naked->active;
694 state[i++] = cur_address->address_naked->active ? agent->bw_in : 0;
695 state[i++] = cur_address->address_naked->active ? agent->bw_out : 0;
696 properties = solver->plugin_envi->get_property (solver->plugin_envi->get_property_cls,
697 cur_address->address_naked);
698 for (k = 0; k < GNUNET_ATS_QualityPropertiesCount; k++)
700 state[i++] = properties[k];
708 * For all networks a peer has an address in, this gets the maximum bandwidth which could
709 * theoretically be available in one of the networks. This is used for bandwidth normalization.
711 * @param agent the agent handle
712 * @param direction_in whether the inbound bandwidth should be considered. Returns the maximum outbound bandwidth if GNUNET_NO
714 static long long unsigned
715 ril_get_max_bw (struct RIL_Peer_Agent *agent, int direction_in)
718 * get the maximum bandwidth possible for a peer, e.g. among all addresses which addresses'
719 * network could provide the maximum bandwidth if all that bandwidth was used on that one peer.
722 struct RIL_Address_Wrapped *cur;
723 struct RIL_Network *net;
725 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
727 net = cur->address_naked->solver_information;
730 if (net->bw_in_available > max)
732 max = net->bw_in_available;
737 if (net->bw_out_available > max)
739 max = net->bw_out_available;
747 * Get the index of the quality-property in question
749 * @param type the quality property type
753 ril_find_property_index (uint32_t type)
755 int existing_types[] = GNUNET_ATS_QualityProperties;
757 for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
758 if (existing_types[c] == type)
760 return GNUNET_SYSERR;
764 ril_get_atsi (struct ATS_Address *address, uint32_t type)
767 GNUNET_assert(NULL != address);
769 if ((NULL == address->atsi) || (0 == address->atsi_count))
772 for (c1 = 0; c1 < address->atsi_count; c1++)
774 if (ntohl (address->atsi[c1].type) == type)
775 return ntohl (address->atsi[c1].value);
781 envi_reward_global (struct GAS_RIL_Handle *solver)
784 struct RIL_Network net;
785 unsigned int sum_in_available = 0;
786 unsigned int sum_out_available = 0;
787 unsigned int sum_in_assigned = 0;
788 unsigned int sum_out_assigned = 0;
792 for (i = 0; i < solver->networks_count; i++)
794 net = solver->network_entries[i];
795 sum_in_available += net.bw_in_available;
796 sum_in_assigned += ril_network_get_assigned(solver, net.type, GNUNET_YES);
797 sum_out_available += net.bw_out_available;
798 sum_out_assigned += ril_network_get_assigned(solver, net.type, GNUNET_NO);
801 ratio_in = ((double) sum_in_assigned) / ((double) sum_in_available);
802 ratio_out = ((double) sum_out_assigned) / ((double) sum_out_available);
804 // global reward in [1,2]
805 return ((ratio_in + ratio_out) / 2) + 1;
809 envi_reward_local (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
811 const double *preferences;
812 const double *properties;
814 double pref_match = 0;
818 preferences = solver->plugin_envi->get_preferences (solver->plugin_envi->get_preference_cls,
820 properties = solver->plugin_envi->get_property (solver->plugin_envi->get_property_cls,
821 agent->address_inuse);
824 prop_index = ril_find_property_index (GNUNET_ATS_QUALITY_NET_DELAY);
825 dl_norm = 2 - properties[prop_index]; //invert property as we want to maximize for lower latencies
827 // utilization in [0,1]
828 bw_norm = ((ril_get_atsi (agent->address_inuse, GNUNET_ATS_UTILIZATION_IN)
829 / ril_get_max_bw (agent, GNUNET_YES))
830 + (ril_get_atsi (agent->address_inuse, GNUNET_ATS_UTILIZATION_OUT)
831 / ril_get_max_bw (agent, GNUNET_NO))) / 2;
833 // preference matching in [0,4]
834 pref_match += (preferences[GNUNET_ATS_PREFERENCE_LATENCY] * dl_norm);
835 pref_match += (preferences[GNUNET_ATS_PREFERENCE_BANDWIDTH] * bw_norm);
837 // local reward in [1,2]
838 return (pref_match / 4) +1;
842 * Gets the reward for the last performed step, which is calculated in equal
843 * parts from the local (the peer specific) and the global (for all peers
846 * @param solver the solver handle
847 * @param agent the agent handle
851 envi_get_reward (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
853 struct RIL_Network *net;
856 //punish overutilization
857 net = agent->address_inuse->solver_information;
858 if ((ril_network_get_assigned(solver, net->type, GNUNET_YES) > net->bw_in_available)
859 || (ril_network_get_assigned(solver, net->type, GNUNET_NO) > net->bw_out_available))
864 reward += envi_reward_global (solver);
865 reward += envi_reward_local (solver, agent);
870 * Doubles the bandwidth for the active address
872 * @param solver solver handle
873 * @param agent agent handle
874 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise the outbound bandwidth
877 envi_action_bw_double (struct GAS_RIL_Handle *solver,
878 struct RIL_Peer_Agent *agent,
881 unsigned long long new_bw;
885 new_bw = agent->bw_in * 2;
886 if (new_bw < agent->bw_in)
888 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw,
889 agent->bw_out, GNUNET_NO);
893 new_bw = agent->bw_out * 2;
894 if (new_bw < agent->bw_out)
896 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
902 * Cuts the bandwidth for the active address in half. The least amount of bandwidth suggested, is
903 * the minimum bandwidth for a peer, in order to not invoke a disconnect.
905 * @param solver solver handle
906 * @param agent agent handle
907 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
911 envi_action_bw_halven (struct GAS_RIL_Handle *solver,
912 struct RIL_Peer_Agent *agent,
915 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
916 unsigned long long new_bw;
920 new_bw = agent->bw_in / 2;
921 if (new_bw < min_bw || new_bw > agent->bw_in)
923 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
928 new_bw = agent->bw_out / 2;
929 if (new_bw < min_bw || new_bw > agent->bw_out)
931 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
937 * Increases the bandwidth by 5 times the minimum bandwidth for the active address.
939 * @param solver solver handle
940 * @param agent agent handle
941 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
945 envi_action_bw_inc (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
947 unsigned long long new_bw;
948 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
952 new_bw = agent->bw_in + (5 * min_bw);
953 if (new_bw < agent->bw_in)
955 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw,
956 agent->bw_out, GNUNET_NO);
960 new_bw = agent->bw_out + (5 * min_bw);
961 if (new_bw < agent->bw_out)
963 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
969 * Decreases the bandwidth by 5 times the minimum bandwidth for the active address. The least amount
970 * of bandwidth suggested, is the minimum bandwidth for a peer, in order to not invoke a disconnect.
972 * @param solver solver handle
973 * @param agent agent handle
974 * @param direction_in if GNUNET_YES, change inbound bandwidth, otherwise change the outbound
978 envi_action_bw_dec (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
980 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
981 unsigned long long new_bw;
985 new_bw = agent->bw_in - (5 * min_bw);
986 if (new_bw < min_bw || new_bw > agent->bw_in)
988 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out,
993 new_bw = agent->bw_out - (5 * min_bw);
994 if (new_bw < min_bw || new_bw > agent->bw_in)
996 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw,
1002 * Switches to the address given by its index
1004 * @param solver solver handle
1005 * @param agent agent handle
1006 * @param address_index index of the address as it is saved in the agent's list, starting with zero
1009 envi_action_address_switch (struct GAS_RIL_Handle *solver,
1010 struct RIL_Peer_Agent *agent,
1011 unsigned int address_index)
1013 struct RIL_Address_Wrapped *cur;
1016 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
1018 if (i == address_index)
1020 envi_set_active_suggestion (solver, agent, cur->address_naked, agent->bw_in, agent->bw_out,
1028 //no address with address_index exists, in this case this action should not be callable
1029 GNUNET_assert(GNUNET_NO);
1033 * Puts the action into effect by calling the according function
1035 * @param solver the solver handle
1036 * @param agent the action handle
1037 * @param action the action to perform by the solver
1040 envi_do_action (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int action)
1046 case RIL_ACTION_NOTHING:
1048 case RIL_ACTION_BW_IN_DBL:
1049 envi_action_bw_double (solver, agent, GNUNET_YES);
1051 case RIL_ACTION_BW_IN_HLV:
1052 envi_action_bw_halven (solver, agent, GNUNET_YES);
1054 case RIL_ACTION_BW_IN_INC:
1055 envi_action_bw_inc (solver, agent, GNUNET_YES);
1057 case RIL_ACTION_BW_IN_DEC:
1058 envi_action_bw_dec (solver, agent, GNUNET_YES);
1060 case RIL_ACTION_BW_OUT_DBL:
1061 envi_action_bw_double (solver, agent, GNUNET_NO);
1063 case RIL_ACTION_BW_OUT_HLV:
1064 envi_action_bw_halven (solver, agent, GNUNET_NO);
1066 case RIL_ACTION_BW_OUT_INC:
1067 envi_action_bw_inc (solver, agent, GNUNET_NO);
1069 case RIL_ACTION_BW_OUT_DEC:
1070 envi_action_bw_dec (solver, agent, GNUNET_NO);
1073 if ((action >= RIL_ACTION_TYPE_NUM) && (action < agent->n)) //switch address action
1075 address_index = action - RIL_ACTION_TYPE_NUM;
1077 GNUNET_assert(address_index >= 0);
1079 address_index <= agent_address_get_index (agent, agent->addresses_tail->address_naked));
1081 envi_action_address_switch (solver, agent, address_index);
1084 // error - action does not exist
1085 GNUNET_assert(GNUNET_NO);
1090 * Performs one step of the Markov Decision Process. Other than in the literature the step starts
1091 * after having done the last action a_old. It observes the new state s_next and the reward
1092 * received. Then the coefficient update is done according to the SARSA or Q-learning method. The
1093 * next action is put into effect.
1095 * @param agent the agent performing the step
1098 agent_step (struct RIL_Peer_Agent *agent)
1100 int a_next = RIL_ACTION_INVALID;
1104 LOG(GNUNET_ERROR_TYPE_DEBUG, " agent_step() Peer '%s', algorithm %s\n",
1105 GNUNET_i2s (&agent->peer),
1106 agent->envi->parameters.algorithm ? "Q" : "SARSA");
1108 s_next = envi_get_state (agent->envi, agent);
1109 reward = envi_get_reward (agent->envi, agent);
1111 switch (agent->envi->parameters.algorithm)
1113 case RIL_ALGO_SARSA:
1114 agent_modify_eligibility (agent, RIL_E_SET);
1115 if (agent_decide_exploration (agent))
1117 a_next = agent_get_action_explore (agent, s_next);
1121 a_next = agent_get_action_best (agent, s_next);
1123 if (RIL_ACTION_INVALID != agent->a_old)
1125 //updates weights with selected action (on-policy), if not first step
1126 agent_update_weights (agent, reward, s_next, a_next);
1131 a_next = agent_get_action_best (agent, s_next);
1132 if (RIL_ACTION_INVALID != agent->a_old)
1134 //updates weights with best action, disregarding actually selected action (off-policy), if not first step
1135 agent_update_weights (agent, reward, s_next, a_next);
1137 if (agent_decide_exploration (agent))
1139 a_next = agent_get_action_explore (agent, s_next);
1140 agent_modify_eligibility (agent, RIL_E_ZERO);
1144 a_next = agent_get_action_best (agent, s_next);
1145 agent_modify_eligibility (agent, RIL_E_SET);
1150 //TODO delete this, debug test, faulty actions are 1357
1152 LOG(GNUNET_ERROR_TYPE_INFO, " a_next = %d\n", a_next);
1154 GNUNET_assert(RIL_ACTION_INVALID != a_next);
1156 agent_modify_eligibility (agent, RIL_E_ACCUMULATE);
1158 envi_do_action (agent->envi, agent, a_next);
1160 GNUNET_free(agent->s_old);
1161 agent->s_old = s_next;
1162 agent->a_old = a_next;
1164 agent->step_count += 1;
1168 ril_step (struct GAS_RIL_Handle *solver);
1171 * Task for the scheduler, which performs one step and lets the solver know that
1172 * no further step is scheduled.
1174 * @param cls the solver handle
1175 * @param tc the task context for the scheduler
1178 ril_step_scheduler_task (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
1180 struct GAS_RIL_Handle *solver = cls;
1182 solver->task_pending = GNUNET_NO;
1187 ril_get_used_resource_ratio (struct GAS_RIL_Handle *solver)
1190 struct RIL_Network net;
1191 unsigned long long sum_assigned = 0;
1192 unsigned long long sum_available = 0;
1195 for (i = 0; i < solver->networks_count; i++)
1197 net = solver->network_entries[i];
1198 if (ril_network_get_assigned(solver, net.type, GNUNET_YES) > 0) //only consider scopes with an active address
1200 sum_assigned += ril_network_get_assigned(solver, net.type, GNUNET_YES);
1201 sum_assigned += ril_network_get_assigned(solver, net.type, GNUNET_NO);
1202 sum_available += net.bw_in_available;
1203 sum_available += net.bw_out_available;
1206 if (sum_available > 0)
1208 ratio = ((double) sum_assigned) / ((double) sum_available);
1215 return ratio > 1 ? 1 : ratio; //overutilization possible, cap at 1
1219 * Schedules the next global step in an adaptive way. The more resources are
1220 * left, the earlier the next step is scheduled. This serves the reactivity of
1221 * the solver to changed inputs.
1223 * @param solver the solver handle
1226 ril_step_schedule_next (struct GAS_RIL_Handle *solver)
1232 struct GNUNET_TIME_Relative time_next;
1234 if (solver->task_pending)
1236 GNUNET_SCHEDULER_cancel (solver->step_next_task_id);
1239 used_ratio = ril_get_used_resource_ratio (solver);
1242 solver->parameters.step_time_min.rel_value_us
1243 < solver->parameters.step_time_max.rel_value_us);
1245 factor = (double) GNUNET_TIME_relative_subtract (solver->parameters.step_time_max,
1246 solver->parameters.step_time_min).rel_value_us;
1247 offset = (double) solver->parameters.step_time_min.rel_value_us;
1248 y = factor * pow (used_ratio, RIL_INTERVAL_EXPONENT) + offset;
1250 GNUNET_assert(y <= (double ) solver->parameters.step_time_max.rel_value_us);
1251 GNUNET_assert(y >= (double ) solver->parameters.step_time_min.rel_value_us);
1253 time_next = GNUNET_TIME_relative_multiply (GNUNET_TIME_UNIT_MICROSECONDS, (unsigned int) y);
1255 solver->step_next_task_id = GNUNET_SCHEDULER_add_delayed (time_next, &ril_step_scheduler_task,
1257 solver->task_pending = GNUNET_YES;
1261 * Triggers one step per agent
1265 ril_step (struct GAS_RIL_Handle *solver)
1267 struct RIL_Peer_Agent *cur;
1268 struct GNUNET_TIME_Absolute time_now;
1269 struct GNUNET_TIME_Relative time_delta;
1272 if (GNUNET_YES == solver->bulk_lock)
1274 solver->bulk_changes++;
1278 ril_inform (solver, GAS_OP_SOLVE_START, GAS_STAT_SUCCESS);
1280 LOG(GNUNET_ERROR_TYPE_DEBUG, " RIL step number %d\n", solver->step_count);
1282 if (0 == solver->step_count)
1284 solver->step_time_last = GNUNET_TIME_absolute_get ();
1287 //calculate tau, i.e. how many real valued time units have passed, one time unit is one minimum time step
1288 time_now = GNUNET_TIME_absolute_get ();
1289 time_delta = GNUNET_TIME_absolute_get_difference (solver->step_time_last, time_now);
1290 tau = ((double) time_delta.rel_value_us)
1291 / ((double) solver->parameters.step_time_min.rel_value_us);
1292 solver->step_time_last = time_now;
1294 //calculate reward discounts (once per step for all agents)
1295 solver->discount_variable = pow (M_E, ((-1.) * ((double) solver->parameters.beta) * tau));
1296 solver->discount_integrated = (1 - solver->discount_variable)
1297 / ((double) solver->parameters.beta);
1299 //trigger one step per active agent
1300 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1302 if (cur->is_active && cur->address_inuse)
1308 solver->step_count += 1;
1309 ril_step_schedule_next (solver);
1311 ril_inform (solver, GAS_OP_SOLVE_STOP, GAS_STAT_SUCCESS);
1313 ril_inform (solver, GAS_OP_SOLVE_UPDATE_NOTIFICATION_START, GAS_STAT_SUCCESS);
1314 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1316 if (cur->suggestion_issue) {
1317 solver->plugin_envi->bandwidth_changed_cb(solver->plugin_envi->bw_changed_cb_cls, cur->suggestion_address);
1318 LOG(GNUNET_ERROR_TYPE_DEBUG, "\n Suggest address: %s\n\n",
1319 cur->suggestion_address->addr);
1320 cur->suggestion_issue = GNUNET_NO;
1323 ril_inform (solver, GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP, GAS_STAT_SUCCESS);
1329 * Initialize an agent without addresses and its knowledge base
1331 * @param s ril solver
1332 * @param peer the one in question
1333 * @return handle to the new agent
1335 static struct RIL_Peer_Agent *
1336 agent_init (void *s, const struct GNUNET_PeerIdentity *peer)
1339 struct GAS_RIL_Handle * solver = s;
1340 struct RIL_Peer_Agent * agent = GNUNET_malloc (sizeof (struct RIL_Peer_Agent));
1342 agent->envi = solver;
1343 agent->peer = *peer;
1344 agent->step_count = 0;
1345 agent->is_active = GNUNET_NO;
1348 agent->suggestion_issue = GNUNET_NO;
1349 agent->n = RIL_ACTION_TYPE_NUM;
1350 agent->m = solver->networks_count * RIL_FEATURES_NETWORK_COUNT;
1351 agent->W = (double **) GNUNET_malloc (sizeof (double *) * agent->n);
1352 for (i = 0; i < agent->n; i++)
1354 agent->W[i] = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1356 agent->a_old = RIL_ACTION_INVALID;
1357 agent->s_old = envi_get_state (solver, agent);
1358 agent->e = (double *) GNUNET_malloc (sizeof (double) * agent->m);
1359 agent_modify_eligibility (agent, RIL_E_ZERO);
1361 GNUNET_CONTAINER_DLL_insert_tail(solver->agents_head, solver->agents_tail, agent);
1369 * @param solver the solver handle
1370 * @param agent the agent to retire
1373 agent_die (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
1377 for (i = 0; i < agent->n; i++)
1379 GNUNET_free(agent->W[i]);
1381 GNUNET_free(agent->W);
1382 GNUNET_free(agent->e);
1383 GNUNET_free(agent->s_old);
1388 * Returns the agent for a peer
1390 * @param solver the solver handle
1391 * @param peer the identity of the peer
1392 * @param create whether or not to create an agent, if none is allocated yet
1395 static struct RIL_Peer_Agent *
1396 ril_get_agent (struct GAS_RIL_Handle *solver, const struct GNUNET_PeerIdentity *peer, int create)
1398 struct RIL_Peer_Agent *cur;
1400 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
1402 if (0 == memcmp (peer, &cur->peer, sizeof(struct GNUNET_PeerIdentity)))
1410 return agent_init (solver, peer);
1416 * Lookup network struct by type
1418 * @param s the solver handle
1419 * @param type the network type
1420 * @return the network struct
1422 static struct RIL_Network *
1423 ril_get_network (struct GAS_RIL_Handle *s, uint32_t type)
1427 for (i = 0; i < s->networks_count; i++)
1429 if (s->network_entries[i].type == type)
1431 return &s->network_entries[i];
1438 * Determine whether at least the minimum bandwidth is set for the network. Otherwise the network is
1439 * considered inactive and not used. Addresses in an inactive network are ignored.
1441 * @param solver solver handle
1442 * @param network the network type
1443 * @return whether or not the network is considered active
1446 ril_network_is_active (struct GAS_RIL_Handle *solver, enum GNUNET_ATS_Network_Type network)
1448 struct RIL_Network *net;
1449 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1451 net = ril_get_network (solver, network);
1452 if (net->bw_out_available < min_bw)
1458 * Cuts a slice out of a vector of elements. This is used to decrease the size of the matrix storing
1459 * the reward function approximation. It copies the memory, which is not cut, to the new vector,
1460 * frees the memory of the old vector, and redirects the pointer to the new one.
1462 * @param old pointer to the pointer to the first element of the vector
1463 * @param element_size byte size of the vector elements
1464 * @param hole_start the first element to cut out
1465 * @param hole_length the number of elements to cut out
1466 * @param old_length the length of the old vector
1469 ril_cut_from_vector (void **old,
1470 size_t element_size,
1471 unsigned int hole_start,
1472 unsigned int hole_length,
1473 unsigned int old_length)
1476 char *oldptr = (char *) *old;
1478 unsigned int bytes_before;
1479 unsigned int bytes_hole;
1480 unsigned int bytes_after;
1482 GNUNET_assert(old_length > hole_length);
1483 GNUNET_assert(old_length >= (hole_start + hole_length));
1485 size = element_size * (old_length - hole_length);
1487 bytes_before = element_size * hole_start;
1488 bytes_hole = element_size * hole_length;
1489 bytes_after = element_size * (old_length - hole_start - hole_length);
1497 tmpptr = GNUNET_malloc (size);
1498 memcpy (tmpptr, oldptr, bytes_before);
1499 memcpy (tmpptr + bytes_before, oldptr + (bytes_before + bytes_hole), bytes_after);
1505 *old = (void *) tmpptr;
1509 * Solver API functions
1510 * ---------------------------
1514 * Change relative preference for quality in solver
1516 * @param solver the solver handle
1517 * @param peer the peer to change the preference for
1518 * @param kind the kind to change the preference
1519 * @param pref_rel the normalized preference value for this kind over all clients
1522 GAS_ril_address_change_preference (void *solver,
1523 const struct GNUNET_PeerIdentity *peer,
1524 enum GNUNET_ATS_PreferenceKind kind,
1527 LOG(GNUNET_ERROR_TYPE_DEBUG,
1528 "API_address_change_preference() Preference '%s' for peer '%s' changed to %.2f \n",
1529 GNUNET_ATS_print_preference_type (kind), GNUNET_i2s (peer), pref_rel);
1535 * Entry point for the plugin
1537 * @param cls pointer to the 'struct GNUNET_ATS_PluginEnvironment'
1540 libgnunet_plugin_ats_ril_init (void *cls)
1542 struct GNUNET_ATS_PluginEnvironment *env = cls;
1543 struct GAS_RIL_Handle *solver = GNUNET_new (struct GAS_RIL_Handle);
1544 struct RIL_Network * cur;
1548 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_init() Initializing RIL solver\n");
1550 GNUNET_assert(NULL != env);
1551 GNUNET_assert(NULL != env->cfg);
1552 GNUNET_assert(NULL != env->stats);
1553 GNUNET_assert(NULL != env->bandwidth_changed_cb);
1554 GNUNET_assert(NULL != env->get_preferences);
1555 GNUNET_assert(NULL != env->get_property);
1558 != GNUNET_CONFIGURATION_get_value_time (env->cfg, "ats", "RIL_STEP_TIME_MIN",
1559 &solver->parameters.step_time_min))
1561 solver->parameters.step_time_min = RIL_DEFAULT_STEP_TIME_MIN;
1564 != GNUNET_CONFIGURATION_get_value_time (env->cfg, "ats", "RIL_STEP_TIME_MAX",
1565 &solver->parameters.step_time_max))
1567 solver->parameters.step_time_max = RIL_DEFAULT_STEP_TIME_MAX;
1569 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_ALGORITHM", &string))
1571 solver->parameters.algorithm = !strcmp (string, "SARSA") ? RIL_ALGO_SARSA : RIL_ALGO_Q;
1572 GNUNET_free (string);
1576 solver->parameters.algorithm = RIL_DEFAULT_ALGORITHM;
1578 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_DISCOUNT_BETA", &string))
1580 solver->parameters.beta = strtod (string, NULL);
1581 GNUNET_free (string);
1585 solver->parameters.beta = RIL_DEFAULT_DISCOUNT_BETA;
1588 == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_GRADIENT_STEP_SIZE", &string))
1590 solver->parameters.alpha = strtod (string, NULL);
1591 GNUNET_free (string);
1595 solver->parameters.alpha = RIL_DEFAULT_GRADIENT_STEP_SIZE;
1597 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_TRACE_DECAY", &string))
1599 solver->parameters.lambda = strtod (string, NULL);
1600 GNUNET_free (string);
1604 solver->parameters.lambda = RIL_DEFAULT_TRACE_DECAY;
1606 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (env->cfg, "ats", "RIL_EXPLORE_RATIO", &string))
1608 solver->parameters.explore_ratio = strtod (string, NULL);
1609 GNUNET_free (string);
1613 solver->parameters.explore_ratio = RIL_DEFAULT_EXPLORE_RATIO;
1616 env->sf.s_add = &GAS_ril_address_add;
1617 env->sf.s_address_update_property = &GAS_ril_address_property_changed;
1618 env->sf.s_address_update_session = &GAS_ril_address_session_changed;
1619 env->sf.s_address_update_inuse = &GAS_ril_address_inuse_changed;
1620 env->sf.s_address_update_network = &GAS_ril_address_change_network;
1621 env->sf.s_get = &GAS_ril_get_preferred_address;
1622 env->sf.s_get_stop = &GAS_ril_stop_get_preferred_address;
1623 env->sf.s_pref = &GAS_ril_address_change_preference;
1624 env->sf.s_feedback = &GAS_ril_address_preference_feedback;
1625 env->sf.s_del = &GAS_ril_address_delete;
1626 env->sf.s_bulk_start = &GAS_ril_bulk_start;
1627 env->sf.s_bulk_stop = &GAS_ril_bulk_stop;
1629 solver->plugin_envi = env;
1630 solver->networks_count = env->network_count;
1631 solver->network_entries = GNUNET_malloc (env->network_count * sizeof (struct RIL_Network));
1632 solver->step_count = 0;
1634 for (c = 0; c < env->network_count; c++)
1636 cur = &solver->network_entries[c];
1637 cur->type = env->networks[c];
1638 cur->bw_in_available = env->in_quota[c];
1639 cur->bw_out_available = env->out_quota[c];
1642 solver->step_next_task_id = GNUNET_SCHEDULER_add_delayed (
1643 GNUNET_TIME_relative_multiply (GNUNET_TIME_relative_get_millisecond_ (), 1000),
1644 &ril_step_scheduler_task, solver);
1645 solver->task_pending = GNUNET_YES;
1651 * Exit point for the plugin
1653 * @param cls the solver handle
1656 libgnunet_plugin_ats_ril_done (void *cls)
1658 struct GAS_RIL_Handle *s = cls;
1659 struct RIL_Peer_Agent *cur_agent;
1660 struct RIL_Peer_Agent *next_agent;
1662 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_done() Shutting down RIL solver\n");
1664 cur_agent = s->agents_head;
1665 while (NULL != cur_agent)
1667 next_agent = cur_agent->next;
1668 GNUNET_CONTAINER_DLL_remove(s->agents_head, s->agents_tail, cur_agent);
1669 agent_die (s, cur_agent);
1670 cur_agent = next_agent;
1673 if (s->task_pending)
1675 GNUNET_SCHEDULER_cancel (s->step_next_task_id);
1677 GNUNET_free(s->network_entries);
1684 * Add a new address for a peer to the solver
1686 * The address is already contained in the addresses hashmap!
1688 * @param solver the solver Handle
1689 * @param address the address to add
1690 * @param network network type of this address
1693 GAS_ril_address_add (void *solver, struct ATS_Address *address, uint32_t network)
1695 struct GAS_RIL_Handle *s = solver;
1696 struct RIL_Peer_Agent *agent;
1697 struct RIL_Address_Wrapped *address_wrapped;
1698 struct RIL_Network *net;
1705 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1707 LOG (GNUNET_ERROR_TYPE_DEBUG, "API_address_add()\n");
1709 net = ril_get_network (s, network);
1710 address->solver_information = net;
1712 if (!ril_network_is_active (s, network))
1714 LOG(GNUNET_ERROR_TYPE_DEBUG,
1715 "API_address_add() Did not add %s address %s for peer '%s', network does not have enough bandwidth\n",
1716 address->plugin, address->addr, GNUNET_i2s (&address->peer));
1720 agent = ril_get_agent (s, &address->peer, GNUNET_YES);
1723 address_wrapped = GNUNET_malloc (sizeof (struct RIL_Address_Wrapped));
1724 address_wrapped->address_naked = address;
1725 GNUNET_CONTAINER_DLL_insert_tail(agent->addresses_head, agent->addresses_tail, address_wrapped);
1727 //increase size of W
1728 m_new = agent->m + RIL_FEATURES_ADDRESS_COUNT;
1730 n_new = agent->n + 1;
1733 GNUNET_array_grow(agent->W, agent->n, n_new);
1734 for (i = 0; i < n_new; i++)
1739 GNUNET_array_grow(agent->W[i], agent->m, m_new);
1744 GNUNET_array_grow(agent->W[i], zero, m_new);
1748 //increase size of old state vector
1750 GNUNET_array_grow(agent->s_old, agent->m, m_new);
1753 GNUNET_array_grow(agent->e, agent->m, m_new);
1755 if (NULL == agent->address_inuse)
1757 envi_set_active_suggestion (s, agent, address, min_bw, min_bw, GNUNET_NO);
1762 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_add() Added %s %s address %s for peer '%s'\n",
1763 address->active ? "active" : "inactive", address->plugin, address->addr,
1764 GNUNET_i2s (&address->peer));
1768 * Delete an address in the solver
1770 * The address is not contained in the address hashmap anymore!
1772 * @param solver the solver handle
1773 * @param address the address to remove
1774 * @param session_only delete only session not whole address
1777 GAS_ril_address_delete (void *solver, struct ATS_Address *address, int session_only)
1779 struct GAS_RIL_Handle *s = solver;
1780 struct RIL_Peer_Agent *agent;
1781 struct RIL_Address_Wrapped *address_wrapped;
1782 int address_was_used = address->active;
1787 struct RIL_Network *net;
1788 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1790 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_delete() Delete %s%s %s address %s for peer '%s'\n",
1791 session_only ? "session for " : "", address->active ? "active" : "inactive", address->plugin,
1792 address->addr, GNUNET_i2s (&address->peer));
1794 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1797 net = address->solver_information;
1798 GNUNET_assert(!ril_network_is_active (s, net->type));
1799 LOG(GNUNET_ERROR_TYPE_DEBUG,
1800 "No agent allocated for peer yet, since address was in inactive network\n");
1804 address_index = agent_address_get_index (agent, address);
1805 address_wrapped = agent_address_get (agent, address);
1807 if (NULL == address_wrapped)
1809 net = address->solver_information;
1810 GNUNET_assert(!ril_network_is_active (s, net->type));
1811 LOG(GNUNET_ERROR_TYPE_DEBUG,
1812 "Address not considered by agent, address was in inactive network\n");
1816 GNUNET_CONTAINER_DLL_remove(agent->addresses_head, agent->addresses_tail, address_wrapped);
1817 GNUNET_free(address_wrapped);
1820 m_new = agent->m - RIL_FEATURES_ADDRESS_COUNT;
1821 n_new = agent->n - 1;
1823 for (i = 0; i < agent->n; i++)
1825 ril_cut_from_vector ((void **) &agent->W[i], sizeof(double),
1826 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1827 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1829 GNUNET_free(agent->W[RIL_ACTION_TYPE_NUM + address_index]);
1830 ril_cut_from_vector ((void **) &agent->W, sizeof(double *), RIL_ACTION_TYPE_NUM + address_index,
1832 //correct last action
1833 if (agent->a_old > (RIL_ACTION_TYPE_NUM + address_index))
1837 else if (agent->a_old == (RIL_ACTION_TYPE_NUM + address_index))
1839 agent->a_old = RIL_ACTION_INVALID;
1841 //decrease old state vector and eligibility vector
1842 ril_cut_from_vector ((void **) &agent->s_old, sizeof(double),
1843 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1844 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1845 ril_cut_from_vector ((void **) &agent->e, sizeof(double),
1846 ((s->networks_count * RIL_FEATURES_NETWORK_COUNT)
1847 + (address_index * RIL_FEATURES_ADDRESS_COUNT)), RIL_FEATURES_ADDRESS_COUNT, agent->m);
1851 LOG(GNUNET_ERROR_TYPE_DEBUG, "address was used: %s\n", address_was_used ? "yes" : "no");
1853 if (address_was_used)
1855 if (NULL != agent->addresses_head) //if peer has an address left, use it
1857 LOG(GNUNET_ERROR_TYPE_DEBUG, "address left: %s\n",
1858 agent->addresses_head->address_naked->addr);
1860 envi_set_active_suggestion (s, agent, agent->addresses_head->address_naked, min_bw, min_bw,
1865 LOG(GNUNET_ERROR_TYPE_DEBUG, "no address left => disconnect\n");
1867 envi_set_active_suggestion (s, agent, NULL, 0, 0, GNUNET_NO);
1871 LOG(GNUNET_ERROR_TYPE_DEBUG, "Address deleted: %s\n", address->addr);
1877 * Update the properties of an address in the solver
1879 * @param solver solver handle
1880 * @param address the address
1881 * @param type the ATSI type in HBO
1882 * @param abs_value the absolute value of the property
1883 * @param rel_value the normalized value
1886 GAS_ril_address_property_changed (void *solver,
1887 struct ATS_Address *address,
1892 LOG(GNUNET_ERROR_TYPE_DEBUG,
1893 "API_address_property_changed() Property '%s' for peer '%s' address %s changed "
1894 "to %.2f \n", GNUNET_ATS_print_property_type (type), GNUNET_i2s (&address->peer),
1895 address->addr, rel_value);
1901 * Update the session of an address in the solver
1903 * NOTE: values in addresses are already updated
1905 * @param solver solver handle
1906 * @param address the address
1907 * @param cur_session the current session
1908 * @param new_session the new session
1911 GAS_ril_address_session_changed (void *solver,
1912 struct ATS_Address *address,
1913 uint32_t cur_session,
1914 uint32_t new_session)
1917 * TODO? Future Work: Potentially add session activity as a feature in state vector
1919 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_session_changed()\n");
1923 * Notify the solver that an address is (not) actively used by transport
1924 * to communicate with a remote peer
1926 * NOTE: values in addresses are already updated
1928 * @param solver solver handle
1929 * @param address the address
1930 * @param in_use usage state
1933 GAS_ril_address_inuse_changed (void *solver, struct ATS_Address *address, int in_use)
1935 /* Nothing to do here.
1936 * Possible TODO? Future Work: Potentially add usage variable to state vector
1938 LOG(GNUNET_ERROR_TYPE_DEBUG,
1939 "API_address_inuse_changed() Usage for %s address of peer '%s' changed to %s\n",
1940 address->plugin, GNUNET_i2s (&address->peer), (GNUNET_YES == in_use) ? "USED" : "UNUSED");
1944 * Notify solver that the network an address is located in has changed
1946 * NOTE: values in addresses are already updated
1948 * @param solver solver handle
1949 * @param address the address
1950 * @param current_network the current network
1951 * @param new_network the new network
1954 GAS_ril_address_change_network (void *solver,
1955 struct ATS_Address *address,
1956 uint32_t current_network,
1957 uint32_t new_network)
1959 struct GAS_RIL_Handle *s = solver;
1960 struct RIL_Peer_Agent *agent;
1962 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_change_network() Network type changed, moving "
1963 "%s address of peer %s from '%s' to '%s'\n",
1964 (GNUNET_YES == address->active) ? "active" : "inactive", GNUNET_i2s (&address->peer),
1965 GNUNET_ATS_print_network_type (current_network), GNUNET_ATS_print_network_type (new_network));
1967 if (address->active && !ril_network_is_active (solver, new_network))
1969 GAS_ril_address_delete (solver, address, GNUNET_NO);
1973 agent = ril_get_agent (s, &address->peer, GNUNET_NO);
1976 GNUNET_assert(!ril_network_is_active (solver, current_network));
1978 GAS_ril_address_add (s, address, new_network);
1982 address->solver_information = ril_get_network(solver, new_network);
1986 * Give feedback about the current assignment
1988 * @param solver the solver handle
1989 * @param application the application
1990 * @param peer the peer to change the preference for
1991 * @param scope the time interval for this feedback: [now - scope .. now]
1992 * @param kind the kind to change the preference
1993 * @param score the score
1996 GAS_ril_address_preference_feedback (void *solver,
1998 const struct GNUNET_PeerIdentity *peer,
1999 const struct GNUNET_TIME_Relative scope,
2000 enum GNUNET_ATS_PreferenceKind kind,
2003 LOG(GNUNET_ERROR_TYPE_DEBUG,
2004 "API_address_preference_feedback() Peer '%s' got a feedback of %+.3f from application %s for "
2005 "preference %s for %d seconds\n", GNUNET_i2s (peer), "UNKNOWN",
2006 GNUNET_ATS_print_preference_type (kind), scope.rel_value_us / 1000000);
2010 * Start a bulk operation
2012 * @param solver the solver
2015 GAS_ril_bulk_start (void *solver)
2017 struct GAS_RIL_Handle *s = solver;
2019 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_bulk_start() lock: %d\n", s->bulk_lock+1);
2025 * Bulk operation done
2027 * @param solver the solver handle
2030 GAS_ril_bulk_stop (void *solver)
2032 struct GAS_RIL_Handle *s = solver;
2034 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_bulk_stop() lock: %d\n", s->bulk_lock-1);
2036 if (s->bulk_lock < 1)
2043 if (0 < s->bulk_changes)
2046 s->bulk_changes = 0;
2051 * Tell solver to notify ATS if the address to use changes for a specific
2052 * peer using the bandwidth changed callback
2054 * The solver must only notify about changes for peers with pending address
2057 * @param solver the solver handle
2058 * @param peer the identity of the peer
2060 const struct ATS_Address *
2061 GAS_ril_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
2064 * activate agent, return currently chosen address
2066 struct GAS_RIL_Handle *s = solver;
2067 struct RIL_Peer_Agent *agent;
2069 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_get_preferred_address()\n");
2071 agent = ril_get_agent (s, peer, GNUNET_YES);
2073 agent->is_active = GNUNET_YES;
2075 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
2078 if (agent->address_inuse)
2080 LOG(GNUNET_ERROR_TYPE_DEBUG,
2081 "API_get_preferred_address() Activated agent for peer '%s' with %s address %s\n",
2082 GNUNET_i2s (peer), agent->address_inuse->plugin, agent->address_inuse->addr);
2086 LOG(GNUNET_ERROR_TYPE_DEBUG,
2087 "API_get_preferred_address() Activated agent for peer '%s', but no address available\n",
2091 return agent->address_inuse;
2095 * Tell solver stop notifying ATS about changes for this peers
2097 * The solver must only notify about changes for peers with pending address
2100 * @param solver the solver handle
2101 * @param peer the peer
2104 GAS_ril_stop_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
2106 struct GAS_RIL_Handle *s = solver;
2107 struct RIL_Peer_Agent *agent;
2109 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_stop_get_preferred_address()");
2111 agent = ril_get_agent (s, peer, GNUNET_NO);
2118 if (GNUNET_NO == agent->is_active)
2124 agent->is_active = GNUNET_NO;
2126 envi_set_active_suggestion (s, agent, agent->address_inuse, agent->bw_in, agent->bw_out,
2131 LOG(GNUNET_ERROR_TYPE_DEBUG,
2132 "API_stop_get_preferred_address() Paused agent for peer '%s' with %s address\n",
2133 GNUNET_i2s (peer), agent->address_inuse->plugin);
2136 /* end of libgnunet_plugin_ats_ril.c */