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/gnunet-service-ats-solver_ril.c
23 * @brief ATS reinforcement learning solver
24 * @author Fabian Oehlmann
25 * @author Matthias Wachs
29 #include "gnunet_util_lib.h"
30 #include "gnunet-service-ats_addresses.h"
31 #include "gnunet_statistics_service.h"
33 #define LOG(kind,...) GNUNET_log_from (kind, "ats-ril",__VA_ARGS__)
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 * TODO! implement address administration
50 * TODO! implement reward calculation 1 and 2 (i.e. meeting preferences and taking scores)
55 RIL_ACTION_NOTHING = 0,
56 RIL_ACTION_BW_IN_DBL = 1,
57 RIL_ACTION_BW_IN_HLV = 2,
58 RIL_ACTION_BW_IN_INC = 3,
59 RIL_ACTION_BW_IN_DEC = 4,
60 RIL_ACTION_BW_OUT_DBL = 5,
61 RIL_ACTION_BW_OUT_HLV = 6,
62 RIL_ACTION_BW_OUT_INC = 7,
63 RIL_ACTION_BW_OUT_DEC = 8,
64 RIL_ACTION_TYPE_NUM = 9
66 //TODO! add the rest of the actions
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;
248 * Bandwidth changed callback
250 GAS_bandwidth_changed_cb bw_changed;
253 * Bandwidth changed callback cls
255 void *bw_changed_cls;
258 * ATS function to get preferences
260 GAS_get_preferences get_preferences;
263 * Closure for ATS function to get preferences
265 void *get_preferences_cls;
268 * ATS function to get properties
270 GAS_get_properties get_properties;
273 * Closure for ATS function to get properties
275 void *get_properties_cls;
279 * A handle for the reinforcement learning solver
281 struct GAS_RIL_Handle
286 struct GNUNET_STATISTICS_Handle *stats;
289 * Hashmap containing all valid addresses
291 const struct GNUNET_CONTAINER_MultiHashMap *addresses;
294 * Callbacks for the solver
296 struct RIL_Callbacks *callbacks;
304 * Number of changes while solver was locked
309 * Number of performed time-steps
311 unsigned long long step_count;
314 * Interval time between steps in milliseconds //TODO? put in agent
316 struct GNUNET_TIME_Relative step_time;
319 * Task identifier of the next time-step to be executed //TODO? put in agent
321 GNUNET_SCHEDULER_TaskIdentifier next_step;
324 * Learning parameters
326 struct RIL_Learning_Parameters parameters;
329 * Array of networks with global assignment state
331 struct RIL_Network * network_entries;
336 unsigned int networks_count;
339 * List of active peer-agents
341 struct RIL_Peer_Agent * agents_head;
342 struct RIL_Peer_Agent * agents_tail;
347 * ---------------------------
351 * Estimate the current action-value for state s and action a
352 * @param agent agent performing the estimation
355 * @return estimation value
358 agent_estimate_q (struct RIL_Peer_Agent *agent, double *state, int action)
363 for (i = 0; i < agent->m; i++)
365 result += state[i] * agent->W[action][i];
372 * Decide whether to do exploration (i.e. taking a new action) or exploitation (i.e. taking the
373 * currently estimated best action) in the current step
374 * @param agent agent performing the step
375 * @return yes, if exploring
378 agent_decide_exploration (struct RIL_Peer_Agent *agent)
380 double r = (double) GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK,
381 UINT32_MAX) / (double) UINT32_MAX;
383 if (r < RIL_EXPLORE_RATIO)
391 agent_address_get_index (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
394 struct RIL_Address_Wrapped *cur;
397 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
399 if (cur->address_naked == address)
409 static struct RIL_Address_Wrapped *
410 agent_address_get (struct RIL_Peer_Agent *agent, struct ATS_Address *address)
412 struct RIL_Address_Wrapped *cur;
414 for (cur = agent->addresses_head; NULL != cur; cur = cur->next)
416 if (cur->address_naked == address)
426 * Gets the action, with the maximal estimated Q-value (i.e. the one currently estimated to bring the
427 * most reward in the future)
428 * @param agent agent performing the calculation
429 * @param state the state from which to take the action
430 * @return the action promising most future reward
433 agent_get_action_best (struct RIL_Peer_Agent *agent, double *state)
438 double max_q = -DBL_MAX;
440 for (i = 0; i < agent->n; i++)
442 cur_q = agent_estimate_q (agent, state, i);
450 GNUNET_assert(-1 != max_i);
456 * Gets any action, to explore the action space from that state
457 * @param agent agent performing the calculation
458 * @param state the state from which to take the action
462 agent_get_action_explore (struct RIL_Peer_Agent *agent, double *state)
464 return GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, agent->n);
468 * Updates the weights (i.e. coefficients) of the weight vector in matrix W for action a
469 * @param agent the agent performing the update
470 * @param reward the reward received for the last action
471 * @param s_next the new state, the last step got the agent into
472 * @param a_prime the new
475 agent_update_weights (struct RIL_Peer_Agent *agent, double reward, double *s_next, int a_prime)
479 double *theta = agent->W[agent->a_old];
481 delta = reward + agent_estimate_q (agent, s_next, a_prime)
482 - agent_estimate_q (agent, agent->s_old, agent->a_old);
483 for (i = 0; i < agent->m; i++)
485 theta[i] += agent->envi->parameters.alpha * delta * (agent->e)[i];
490 * Changes the eligibility trace vector e in various manners:
491 * RIL_E_ACCUMULATE - adds 1 to each component as in accumulating eligibility traces
492 * RIL_E_REPLACE - resets each component to 1 as in replacing traces
493 * RIL_E_SET - multiplies e with gamma and lambda as in the update rule
494 * RIL_E_ZERO - sets e to 0 as in Watkin's Q-learning algorithm when exploring and when initializing
499 agent_modify_eligibility (struct RIL_Peer_Agent *agent, enum RIL_E_Modification mod)
502 double *e = agent->e;
503 double gamma = agent->envi->parameters.gamma;
504 double lambda = agent->envi->parameters.lambda;
506 for (i = 0; i < agent->m; i++)
510 case RIL_E_ACCUMULATE:
517 e[i] = gamma * lambda;
527 envi_set_active_suggestion (struct GAS_RIL_Handle *solver,
528 struct RIL_Peer_Agent *agent,
529 struct ATS_Address *new_address,
530 unsigned long long new_bw_in,
531 unsigned long long new_bw_out)
533 int notify = GNUNET_NO;
535 if (agent->address_inuse != new_address)
537 if (NULL != agent->address_inuse)
539 agent->address_inuse->active = GNUNET_NO;
541 agent->address_inuse = new_address;
542 agent->address_inuse->active = GNUNET_YES;
543 agent->address_inuse->assigned_bw_in.value__ = htonl (agent->bw_in);
544 agent->address_inuse->assigned_bw_out.value__ = htonl (agent->bw_out);
545 notify |= GNUNET_YES;
547 if (agent->bw_in != new_bw_in)
549 agent->bw_in = new_bw_in;
550 agent->address_inuse->assigned_bw_in.value__ = htonl (new_bw_out);
551 notify |= GNUNET_YES;
553 if (agent->bw_out != new_bw_out)
555 agent->bw_out = new_bw_out;
556 agent->address_inuse->assigned_bw_out.value__ = htonl (new_bw_out);
557 notify |= GNUNET_YES;
560 if (notify && agent->active)
562 solver->callbacks->bw_changed (solver->callbacks->bw_changed_cls, agent->address_inuse);
567 * Allocates a state vector and fills it with the features present
568 * @param solver the solver handle
569 * @return pointer to the state vector
572 envi_get_state (struct GAS_RIL_Handle *solver)
575 struct RIL_Network *net;
576 double *state = GNUNET_malloc (sizeof (double) * solver->networks_count * 4);
578 for (i = 0; i < solver->networks_count; i++)
580 net = &solver->network_entries[i];
581 state[i * 4 + 0] = (double) net->bw_in_assigned;
582 state[i * 4 + 1] = (double) net->bw_in_available;
583 state[i * 4 + 2] = (double) net->bw_out_assigned;
584 state[i * 4 + 3] = (double) net->bw_out_available;
591 * Gets the reward of the last performed step
592 * @param solver solver handle
596 envi_get_reward (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
598 //TODO! implement reward calculation
600 return (double) GNUNET_CRYPTO_random_u32 (GNUNET_CRYPTO_QUALITY_WEAK, UINT32_MAX)
601 / (double) UINT32_MAX;
605 envi_action_bw_double (struct GAS_RIL_Handle *solver,
606 struct RIL_Peer_Agent *agent,
611 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in * 2, agent->bw_out);
615 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, agent->bw_out * 2);
620 envi_action_bw_halven (struct GAS_RIL_Handle *solver,
621 struct RIL_Peer_Agent *agent,
624 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
625 unsigned long long new_bw;
629 new_bw = agent->bw_in / 2;
632 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out);
636 new_bw = agent->bw_out / 2;
639 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw);
644 envi_action_bw_inc (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
646 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
650 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in + (5 * min_bw),
655 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in,
656 agent->bw_out + (5 * min_bw));
661 envi_action_bw_dec (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int direction_in)
663 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
664 unsigned long long new_bw;
668 new_bw = agent->bw_in - (5 * min_bw);
671 envi_set_active_suggestion (solver, agent, agent->address_inuse, new_bw, agent->bw_out);
675 new_bw = agent->bw_out - (5 * min_bw);
678 envi_set_active_suggestion (solver, agent, agent->address_inuse, agent->bw_in, new_bw);
683 * Puts the action into effect
684 * @param solver solver handle
685 * @param action action to perform by the solver
688 envi_do_action (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent, int action)
692 case RIL_ACTION_NOTHING:
694 case RIL_ACTION_BW_IN_DBL:
695 envi_action_bw_double (solver, agent, GNUNET_YES);
697 case RIL_ACTION_BW_IN_HLV:
698 envi_action_bw_halven (solver, agent, GNUNET_YES);
700 case RIL_ACTION_BW_IN_INC:
701 envi_action_bw_inc (solver, agent, GNUNET_YES);
703 case RIL_ACTION_BW_IN_DEC:
704 envi_action_bw_dec (solver, agent, GNUNET_YES);
706 case RIL_ACTION_BW_OUT_DBL:
707 envi_action_bw_double (solver, agent, GNUNET_NO);
709 case RIL_ACTION_BW_OUT_HLV:
710 envi_action_bw_halven (solver, agent, GNUNET_NO);
712 case RIL_ACTION_BW_OUT_INC:
713 envi_action_bw_inc (solver, agent, GNUNET_NO);
715 case RIL_ACTION_BW_OUT_DEC:
716 envi_action_bw_dec (solver, agent, GNUNET_NO);
719 // error - action does not exist
720 GNUNET_assert(GNUNET_NO);
725 * Performs one step of the Markov Decision Process. Other than in the literature the step starts
726 * after having done the last action a_old. It observes the new state s_next and the reward
727 * received. Then the coefficient update is done according to the SARSA or Q-learning method. The
728 * next action is put into effect.
729 * @param agent the agent performing the step
732 agent_step (struct RIL_Peer_Agent *agent)
738 s_next = envi_get_state (agent->envi);
739 reward = envi_get_reward (agent->envi, agent);
741 LOG(GNUNET_ERROR_TYPE_DEBUG, "agent_step() with algorithm %s\n",
742 agent->envi->parameters.algorithm ? "Q" : "SARSA");
744 switch (agent->envi->parameters.algorithm)
747 agent_modify_eligibility (agent, RIL_E_SET);
748 if (agent_decide_exploration (agent))
750 a_next = agent_get_action_explore (agent, s_next);
754 a_next = agent_get_action_best (agent, s_next);
756 //updates weights with selected action (on-policy), if not first step
757 if (-1 != agent->a_old)
758 agent_update_weights (agent, reward, s_next, a_next);
762 //updates weights with best action, disregarding actually selected action (off-policy), if not first step
763 a_next = agent_get_action_best (agent, s_next);
764 if (-1 != agent->a_old)
765 agent_update_weights (agent, reward, s_next, a_next);
766 if (agent_decide_exploration (agent))
768 a_next = agent_get_action_explore (agent, s_next);
769 agent_modify_eligibility (agent, RIL_E_ZERO);
773 a_next = agent_get_action_best (agent, s_next);
774 agent_modify_eligibility (agent, RIL_E_SET);
779 GNUNET_assert(-1 != a_next);
781 agent_modify_eligibility (agent, RIL_E_ACCUMULATE);
783 envi_do_action (agent->envi, agent, a_next);
785 GNUNET_free(agent->s_old);
786 agent->s_old = s_next;
787 agent->a_old = a_next;
789 agent->step_count += 1;
793 * Cycles through all agents and lets the active ones do a step. Schedules the next step.
794 * @param solver the solver handle
795 * @param tc task context for the scheduler
798 ril_periodic_step (void *cls, const struct GNUNET_SCHEDULER_TaskContext *tc)
800 struct GAS_RIL_Handle *solver = cls;
801 struct RIL_Peer_Agent *cur;
803 LOG(GNUNET_ERROR_TYPE_DEBUG, "RIL step number %d\n", solver->step_count);
805 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
813 solver->step_count += 1;
814 solver->next_step = GNUNET_SCHEDULER_add_delayed (solver->step_time, &ril_periodic_step, solver);
818 * Initialize an agent without addresses and its knowledge base
819 * @param s ril solver
820 * @param peer the one in question
821 * @return handle to the new agent
823 static struct RIL_Peer_Agent *
824 agent_init (void *s, const struct GNUNET_PeerIdentity *peer)
827 struct GAS_RIL_Handle * solver = s;
828 struct RIL_Peer_Agent * agent = GNUNET_malloc (sizeof (struct RIL_Peer_Agent));
830 agent->envi = solver;
832 agent->step_count = 0;
833 agent->active = GNUNET_NO;
834 agent->s_old = envi_get_state (solver);
835 agent->n = RIL_ACTION_TYPE_NUM;
836 agent->m = solver->networks_count * 4;
837 agent->W = (double **) GNUNET_malloc (sizeof (double) * agent->n);
838 for (i = 0; i < agent->n; i++)
840 agent->W[i] = (double *) GNUNET_malloc (sizeof (double) * agent->m);
843 agent->e = (double *) GNUNET_malloc (sizeof (double) * agent->m);
844 agent_modify_eligibility (agent, RIL_E_ZERO);
846 GNUNET_CONTAINER_DLL_insert_tail(solver->agents_head, solver->agents_tail, agent);
853 * @param s solver handle
854 * @param agent the agent to retire
857 agent_die (struct GAS_RIL_Handle *solver, struct RIL_Peer_Agent *agent)
861 for (i = 0; i < agent->n; i++)
863 GNUNET_free(agent->W[i]);
865 GNUNET_free(agent->W);
866 GNUNET_free(agent->e);
867 GNUNET_free(agent->s_old);
871 * Returns the agent for a peer
872 * @param s solver handle
873 * @param peer identity of the peer
874 * @param create whether to create an agent if none is allocated yet
877 static struct RIL_Peer_Agent *
878 ril_get_agent (struct GAS_RIL_Handle *solver, const struct GNUNET_PeerIdentity *peer, int create)
880 struct RIL_Peer_Agent *cur;
882 for (cur = solver->agents_head; NULL != cur; cur = cur->next)
884 if (0 == GNUNET_CRYPTO_hash_cmp (&peer->hashPubKey, &cur->peer.hashPubKey))
891 return agent_init (solver, peer);
896 * Lookup network struct by type
898 * @param s the solver handle
899 * @param type the network type
900 * @return the network struct
902 static struct RIL_Network *
903 ril_get_network (struct GAS_RIL_Handle *s, uint32_t type)
907 for (i = 0; i < s->networks_count; i++)
909 if (s->network_entries[i].type == type)
911 return &s->network_entries[i];
918 ril_network_is_active (struct GAS_RIL_Handle *solver, enum GNUNET_ATS_Network_Type network)
920 struct RIL_Network *net;
921 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
923 net = ril_get_network(solver, network);
924 if (net->bw_out_available < min_bw)
930 ril_cut_from_vector (void **old, size_t element_size, unsigned int hole_start, unsigned int hole_length, unsigned int old_length)
933 char *oldptr = (char *) *old;
935 unsigned int bytes_before;
936 unsigned int bytes_hole;
937 unsigned int bytes_after;
939 GNUNET_assert(old_length > hole_length);
940 GNUNET_assert(old_length > (hole_start + hole_length - 1));
942 size = (old_length - hole_length) * element_size;
944 bytes_before = element_size * hole_start;
945 bytes_hole = element_size * hole_length;
946 bytes_after = element_size * (old_length - hole_start - hole_length);
954 tmpptr = GNUNET_malloc (size);
955 memcpy (tmpptr, oldptr, bytes_before);
956 memcpy (tmpptr + bytes_before, oldptr + (bytes_before + bytes_hole), bytes_after);
962 *old = (void *) tmpptr;
966 * Solver API functions
967 * ---------------------------
971 * Changes the preferences for a peer in the problem
973 * @param solver the solver handle
974 * @param peer the peer to change the preference for
975 * @param kind the kind to change the preference
976 * @param pref_rel the normalized preference value for this kind over all clients
979 GAS_ril_address_change_preference (void *s,
980 const struct GNUNET_PeerIdentity *peer,
981 enum GNUNET_ATS_PreferenceKind kind,
984 LOG(GNUNET_ERROR_TYPE_DEBUG,
985 "API_address_change_preference() Preference '%s' for peer '%s' changed to %.2f \n",
986 GNUNET_ATS_print_preference_type (kind), GNUNET_i2s (peer), pref_rel);
988 * Nothing to do here. Preferences are considered during reward calculation.
993 * Init the reinforcement learning problem solver
996 * network[i] contains the network type as type GNUNET_ATS_NetworkType[i]
997 * out_quota[i] contains outbound quota for network type i
998 * in_quota[i] contains inbound quota for network type i
1001 * network = {GNUNET_ATS_NET_UNSPECIFIED, GNUNET_ATS_NET_LOOPBACK, GNUNET_ATS_NET_LAN, GNUNET_ATS_NET_WAN, GNUNET_ATS_NET_WLAN}
1002 * network[2] == GNUNET_ATS_NET_LAN
1003 * out_quota[2] == 65353
1004 * in_quota[2] == 65353
1006 * @param cfg configuration handle
1007 * @param stats the GNUNET_STATISTICS handle
1008 * @param network array of GNUNET_ATS_NetworkType with length dest_length
1009 * @param addresses hashmap containing all addresses
1010 * @param out_quota array of outbound quotas
1011 * @param in_quota array of outbound quota
1012 * @param dest_length array length for quota arrays
1013 * @param bw_changed_cb callback for changed bandwidth amounts
1014 * @param bw_changed_cb_cls cls for callback
1015 * @param get_preference callback to get relative preferences for a peer
1016 * @param get_preference_cls cls for callback to get relative preferences
1017 * @param get_properties_cls for callback to get relative properties
1018 * @param get_properties_cls cls for callback to get relative properties
1019 * @return handle for the solver on success, NULL on fail
1022 GAS_ril_init (const struct GNUNET_CONFIGURATION_Handle *cfg,
1023 const struct GNUNET_STATISTICS_Handle *stats,
1024 const struct GNUNET_CONTAINER_MultiHashMap *addresses,
1026 unsigned long long *out_quota,
1027 unsigned long long *in_quota,
1029 GAS_bandwidth_changed_cb bw_changed_cb,
1030 void *bw_changed_cb_cls,
1031 GAS_get_preferences get_preference,
1032 void *get_preference_cls,
1033 GAS_get_properties get_properties,
1034 void *get_properties_cls)
1037 unsigned long long tmp;
1039 struct RIL_Network * cur;
1040 struct GAS_RIL_Handle *solver = GNUNET_malloc (sizeof (struct GAS_RIL_Handle));
1042 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_init() Initializing RIL solver\n");
1044 GNUNET_assert(NULL != cfg);
1045 GNUNET_assert(NULL != stats);
1046 GNUNET_assert(NULL != network);
1047 GNUNET_assert(NULL != bw_changed_cb);
1048 GNUNET_assert(NULL != get_preference);
1049 GNUNET_assert(NULL != get_properties);
1052 != GNUNET_CONFIGURATION_get_value_time (cfg, "ats", "RIL_STEP_TIME", &solver->step_time))
1054 solver->step_time = RIL_DEFAULT_STEP_TIME;
1056 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_string (cfg, "ats", "RIL_ALGORITHM", &string)
1057 && NULL != string && 0 == strcmp (string, "SARSA"))
1059 solver->parameters.algorithm = RIL_ALGO_SARSA;
1063 solver->parameters.algorithm = RIL_DEFAULT_ALGORITHM;
1065 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats", "RIL_DISCOUNT_FACTOR", &tmp))
1067 solver->parameters.gamma = (double) tmp / 100;
1071 solver->parameters.gamma = RIL_DEFAULT_DISCOUNT_FACTOR;
1073 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats", "RIL_GRADIENT_STEP_SIZE", &tmp))
1075 solver->parameters.alpha = (double) tmp / 100;
1079 solver->parameters.alpha = RIL_DEFAULT_GRADIENT_STEP_SIZE;
1081 if (GNUNET_OK == GNUNET_CONFIGURATION_get_value_size (cfg, "ats", "RIL_TRACE_DECAY", &tmp))
1083 solver->parameters.lambda = (double) tmp / 100;
1087 solver->parameters.lambda = RIL_DEFAULT_TRACE_DECAY;
1090 solver->stats = (struct GNUNET_STATISTICS_Handle *) stats;
1091 solver->callbacks = GNUNET_malloc (sizeof (struct RIL_Callbacks));
1092 solver->callbacks->bw_changed = bw_changed_cb;
1093 solver->callbacks->bw_changed_cls = bw_changed_cb_cls;
1094 solver->callbacks->get_preferences = get_preference;
1095 solver->callbacks->get_preferences_cls = get_preference_cls;
1096 solver->callbacks->get_properties = get_properties;
1097 solver->callbacks->get_properties_cls = get_properties_cls;
1098 solver->networks_count = dest_length;
1099 solver->network_entries = GNUNET_malloc (dest_length * sizeof (struct RIL_Network));
1100 solver->bulk_lock = GNUNET_NO;
1101 solver->addresses = addresses;
1102 solver->step_count = 0;
1104 for (c = 0; c < dest_length; c++)
1106 cur = &solver->network_entries[c];
1107 cur->type = network[c];
1108 cur->bw_in_available = in_quota[c];
1109 cur->bw_in_assigned = 0;
1110 cur->bw_out_available = out_quota[c];
1111 cur->bw_out_assigned = 0;
1114 solver->next_step = GNUNET_SCHEDULER_add_delayed (
1115 GNUNET_TIME_relative_multiply (GNUNET_TIME_relative_get_millisecond_ (), 1000),
1116 &ril_periodic_step, solver);
1122 * Shutdown the reinforcement learning problem solver
1124 * @param solver the respective handle to shutdown
1127 GAS_ril_done (void * solver)
1129 struct GAS_RIL_Handle *s = solver;
1130 struct RIL_Peer_Agent *cur_agent;
1131 struct RIL_Peer_Agent *next_agent;
1133 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_done() Shutting down RIL solver\n");
1135 cur_agent = s->agents_head;
1136 while (NULL != cur_agent)
1138 next_agent = cur_agent->next;
1139 GNUNET_CONTAINER_DLL_remove(s->agents_head, s->agents_tail, cur_agent);
1140 agent_die (s, cur_agent);
1141 cur_agent = next_agent;
1144 GNUNET_SCHEDULER_cancel (s->next_step);
1145 GNUNET_free(s->callbacks);
1146 GNUNET_free(s->network_entries);
1151 * Add a single address within a network to the solver
1153 * @param solver the solver Handle
1154 * @param address the address to add
1155 * @param network network type of this address
1158 GAS_ril_address_add (void *solver, struct ATS_Address *address, uint32_t network)
1160 struct GAS_RIL_Handle *s = solver;
1161 struct RIL_Peer_Agent *agent;
1162 struct RIL_Address_Wrapped *address_wrapped;
1169 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1171 address->solver_information = ril_get_network (s, network);
1173 if (!ril_network_is_active(s, network))
1175 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_add() Did not add %s address %p for peer '%s', network does not have enough bandwidth\n",
1176 address->plugin, address->addr, GNUNET_i2s (&address->peer));
1180 agent = ril_get_agent(s, &address->peer, GNUNET_YES);
1183 address_wrapped = GNUNET_malloc (sizeof (struct RIL_Address_Wrapped));
1184 address_wrapped->address_naked = address;
1185 GNUNET_CONTAINER_DLL_insert_tail(agent->addresses_head, agent->addresses_tail, address_wrapped);
1187 //increase size of W
1188 m_new = agent->m + 5; //TODO! make size of features from address variable (Note to self: ctrl+f for "5" or I kill you!)
1190 n_new = agent->n + 1;
1193 GNUNET_array_grow (agent->W, agent->n, n_new);
1194 for (i = 0; i < n_new; i++)
1199 GNUNET_array_grow(agent->W[i], agent->m, m_new);
1204 GNUNET_array_grow(agent->W[i], zero, m_new);
1208 //increase size of old state vector if there is one
1209 if (-1 != agent->a_old)
1212 GNUNET_array_grow(agent->s_old, agent->m, m_new); //TODO initialize new state features?
1216 GNUNET_array_grow(agent->e, agent->m, m_new);
1218 if (NULL == agent->address_inuse)
1220 envi_set_active_suggestion(s, agent, address, min_bw, min_bw);
1223 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_add() Added %s address %p for peer '%s'\n",
1224 address->plugin, address->addr, GNUNET_i2s (&address->peer));
1228 * Remove an address from the solver
1230 * @param solver the solver handle
1231 * @param address the address to remove
1232 * @param session_only delete only session not whole address
1235 GAS_ril_address_delete (void *solver, struct ATS_Address *address, int session_only)
1237 //TODO! delete session only
1238 struct GAS_RIL_Handle *s = solver;
1239 struct RIL_Peer_Agent *agent;
1240 struct RIL_Address_Wrapped *address_wrapped;
1241 int address_was_used = address->active;
1246 struct RIL_Network *net;
1247 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1249 agent = ril_get_agent(s, &address->peer, GNUNET_NO);
1252 LOG (GNUNET_ERROR_TYPE_DEBUG, "No agent allocated for peer\n");
1255 address_index = agent_address_get_index(agent, address);
1256 address_wrapped = agent_address_get(agent, address);
1258 GNUNET_CONTAINER_DLL_remove(agent->addresses_head, agent->addresses_tail, address_wrapped);
1261 m_new = agent->m - 5;
1262 n_new = agent->n - 1;
1264 for (i = 0; i < agent->n; i++)
1266 ril_cut_from_vector((void **) &agent->W[i], sizeof (double), ((s->networks_count * 4) + (i * 5)), 5, agent->m);
1268 ril_cut_from_vector((void **) &agent->W, sizeof (double *), RIL_ACTION_TYPE_NUM + address_index, 1, agent->n);
1269 //correct last action
1270 if (agent->a_old > (RIL_ACTION_TYPE_NUM + address_index))
1274 else if (agent->a_old == (RIL_ACTION_TYPE_NUM + address_index))
1276 agent->a_old = -1; //TODO! macro for invalid action
1278 //decrease old state vector and eligibility vector
1279 ril_cut_from_vector((void **) &agent->s_old, sizeof (double), ((s->networks_count * 4) + (i * 5)), 5, agent->m);
1280 ril_cut_from_vector((void **) &agent->e, sizeof (double), ((s->networks_count * 4) + (i * 5)), 5, agent->m);
1284 if (address_was_used)
1286 net = address->solver_information;
1287 net->bw_in_assigned -= agent->bw_in;
1288 net->bw_out_assigned -= agent->bw_out;
1290 //TODO? check if network/bandwidth update can be done more clever/elegant at different function
1291 envi_set_active_suggestion(s, agent, agent->addresses_head->address_naked, min_bw, min_bw);
1292 net = agent->addresses_head->address_naked->solver_information;
1293 net->bw_in_assigned -= min_bw;
1294 net->bw_out_assigned -= min_bw;
1297 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_delete() Deleted %s%s address for peer '%s'\n",
1298 session_only ? "session for " : "", address->plugin, GNUNET_i2s (&address->peer));
1302 * Transport properties for this address have changed
1304 * @param solver solver handle
1305 * @param address the address
1306 * @param type the ATSI type in HBO
1307 * @param abs_value the absolute value of the property
1308 * @param rel_value the normalized value
1311 GAS_ril_address_property_changed (void *solver,
1312 struct ATS_Address *address,
1317 LOG(GNUNET_ERROR_TYPE_DEBUG,
1318 "API_address_property_changed() Property '%s' for peer '%s' address %p changed "
1319 "to %.2f \n", GNUNET_ATS_print_property_type (type), GNUNET_i2s (&address->peer), address,
1322 * Nothing to do here, properties are considered in every reward calculation
1327 * Transport session for this address has changed
1329 * NOTE: values in addresses are already updated
1331 * @param solver solver handle
1332 * @param address the address
1333 * @param cur_session the current session
1334 * @param new_session the new session
1337 GAS_ril_address_session_changed (void *solver,
1338 struct ATS_Address *address,
1339 uint32_t cur_session,
1340 uint32_t new_session)
1342 //TODO? consider session changed in solver behaviour
1344 * Potentially add session activity as a feature in state vector
1346 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_session_changed()\n");
1350 * Usage for this address has changed
1352 * NOTE: values in addresses are already updated
1354 * @param solver solver handle
1355 * @param address the address
1356 * @param in_use usage state
1359 GAS_ril_address_inuse_changed (void *solver, struct ATS_Address *address, int in_use)
1361 //TODO! consider address_inuse_changed according to matthias' email
1363 * See matthias' email
1365 LOG(GNUNET_ERROR_TYPE_DEBUG,
1366 "API_address_inuse_changed() Usage for %s address of peer '%s' changed to %s\n",
1367 address->plugin, GNUNET_i2s (&address->peer), (GNUNET_YES == in_use) ? "USED" : "UNUSED");
1371 * Network scope for this address has changed
1373 * NOTE: values in addresses are already updated
1375 * @param solver solver handle
1376 * @param address the address
1377 * @param current_network the current network
1378 * @param new_network the new network
1381 GAS_ril_address_change_network (void *solver,
1382 struct ATS_Address *address,
1383 uint32_t current_network,
1384 uint32_t new_network)
1386 struct GAS_RIL_Handle *s = solver;
1387 struct RIL_Peer_Agent *agent;
1388 struct RIL_Network *net;
1389 uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
1391 LOG(GNUNET_ERROR_TYPE_DEBUG, "API_address_change_network() Network type changed, moving "
1392 "%s address of peer %s from '%s' to '%s'\n",
1393 (GNUNET_YES == address->active) ? "active" : "inactive", GNUNET_i2s (&address->peer),
1394 GNUNET_ATS_print_network_type (current_network), GNUNET_ATS_print_network_type (new_network));
1396 if (address->active && !ril_network_is_active(solver, new_network))
1398 GAS_ril_address_delete(solver, address, GNUNET_NO);
1402 agent = ril_get_agent(s, &address->peer, GNUNET_NO);
1405 //no agent there yet, so add as if address is new
1406 address->solver_information = ril_get_network (s, new_network);
1407 GAS_ril_address_add(s,address,new_network);
1411 net = ril_get_network (s, current_network);
1412 net->bw_in_assigned -= agent->bw_in;
1413 net->bw_out_assigned -= agent->bw_out;
1415 net = ril_get_network (s, new_network);
1416 net->bw_in_assigned -= min_bw;
1417 net->bw_out_assigned -= min_bw;
1418 address->solver_information = net;
1422 * Get application feedback for a peer
1424 * @param solver the solver handle
1425 * @param application the application
1426 * @param peer the peer to change the preference for
1427 * @param scope the time interval for this feedback: [now - scope .. now]
1428 * @param kind the kind to change the preference
1429 * @param score the score
1432 GAS_ril_address_preference_feedback (void *solver,
1434 const struct GNUNET_PeerIdentity *peer,
1435 const struct GNUNET_TIME_Relative scope,
1436 enum GNUNET_ATS_PreferenceKind kind,
1439 //TODO! collect reward until next reward calculation
1440 LOG(GNUNET_ERROR_TYPE_DEBUG,
1441 "API_address_preference_feedback() Peer '%s' got a feedback of %+.3f from application %s for "
1442 "preference %s for %d seconds\n", GNUNET_i2s (peer), "UNKNOWN",
1443 GNUNET_ATS_print_preference_type (kind), scope.rel_value_us / 1000000);
1447 * Start a bulk operation
1449 * @param solver the solver
1452 GAS_ril_bulk_start (void *solver)
1454 //TODO? consideration: keep bulk counter and stop agents during bulk
1456 * bulk counter up, but not really relevant, because there is no complete calculation of the
1457 * bandwidth assignment triggered anyway. Therefore, changes to addresses can come and go as
1458 * they want. Consideration: Step-pause during bulk-start-stop period...
1461 //LOG(GNUNET_ERROR_TYPE_DEBUG, "API_bulk_start()\n");
1465 * Bulk operation done
1468 GAS_ril_bulk_stop (void *solver)
1470 //TODO? consideration: keep bulk counter and stop agents during bulk
1472 * bulk counter down, see bulk_start()
1475 //LOG(GNUNET_ERROR_TYPE_DEBUG, "API_bulk_stop()\n");
1479 * Get the preferred address for a specific peer
1481 * @param solver the solver handle
1482 * @param peer the identity of the peer
1484 const struct ATS_Address *
1485 GAS_ril_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
1488 * activate agent, return currently chosen address
1490 struct GAS_RIL_Handle *s = solver;
1491 struct RIL_Peer_Agent *agent;
1493 agent = ril_get_agent (s, peer, GNUNET_NO);
1497 LOG(GNUNET_ERROR_TYPE_DEBUG,
1498 "API_get_preferred_address() No agent for peer '%s' do not suggest address\n",
1503 agent->active = GNUNET_YES;
1505 GNUNET_assert(NULL != agent->address_inuse);
1507 LOG(GNUNET_ERROR_TYPE_DEBUG,
1508 "API_get_preferred_address() Activated agent for peer '%s' with %s address\n",
1509 GNUNET_i2s (peer), agent->address_inuse->plugin);
1511 return agent->address_inuse;
1515 * Stop notifying about address and bandwidth changes for this peer
1517 * @param solver the solver handle
1518 * @param peer the peer
1521 GAS_ril_stop_get_preferred_address (void *solver, const struct GNUNET_PeerIdentity *peer)
1523 struct GAS_RIL_Handle *s = solver;
1524 struct RIL_Peer_Agent *agent;
1526 agent = ril_get_agent (s, peer, GNUNET_NO);
1527 agent->active = GNUNET_NO;
1529 LOG(GNUNET_ERROR_TYPE_DEBUG,
1530 "API_stop_get_preferred_address() Paused agent for peer '%s' with %s address\n",
1531 GNUNET_i2s (peer), agent->address_inuse->plugin);
1534 /* end of gnunet-service-ats-solver_ril.c */