/*
This file is part of GNUnet.
- Copyright (C) 2011-2015 Christian Grothoff (and other contributing authors)
+ Copyright (C) 2011-2015 GNUnet e.V.
GNUnet is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published
You should have received a copy of the GNU General Public License
along with GNUnet; see the file COPYING. If not, write to the
- Free Software Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA.
+ Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+ Boston, MA 02110-1301, USA.
*/
-
/**
* @file ats/plugin_ats_proportional.c
* @brief ATS proportional solver
*/
#include "platform.h"
#include "gnunet_statistics_service.h"
-#include "gnunet_ats_plugin.h"
#include "gnunet_ats_service.h"
+#include "gnunet_ats_plugin.h"
#include "gnunet-service-ats_addresses.h"
-#define PROP_STABILITY_FACTOR 1.25
-
-
#define LOG(kind,...) GNUNET_log_from (kind, "ats-proportional",__VA_ARGS__)
-
/**
- *
- * NOTE: Do not change this documentation. This documentation is based
- * on gnunet.org:/vcs/fsnsg/ats-paper.git/tech-doku/ats-tech-guide.tex
- * use build_txt.sh to generate plaintext output
- *
- * ATS addresses : proportional solver
- *
- * The proportional solver ("proportional") distributes the available
- * bandwidth fair over all the addresses influenced by the
- * preference values. For each available network type an in- and
- * outbound quota is configured and the bandwidth available in
- * these networks is distributed over the addresses. The solver
- * first assigns every addresses the minimum amount of bandwidth
- * #GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT and then distributes the
- * remaining bandwidth available according to the preference
- * values. For each peer only a single address gets bandwidth
- * assigned and only one address marked as active. The most
- * important functionality for the solver is implemented in: *
- * find_address_it is an hashmap iterator returning the prefered
- * address for an peer * update_quota_per_network distributes
- * available bandwidth for a network over active addresses
- *
- * Changes to addresses automatically have an impact on the the
- * bandwidth assigned to other addresses in the same network since
- * the solver distributes the remaining bandwidth over the
- * addresses in the network. When changes to the addresses occur,
- * the solver first performs the changes, like adding or deleting
- * addresses, and then updates bandwidth assignment for the
- * affected network. Bandwidth assignment is only recalculated on
- * demand when an address is requested by a client for a peer or
- * when the addresses available have changed or an address changed
- * the network it is located in. When the bandwidth assignment has
- * changed the callback is called with the new bandwidth
- * assignments. The bandwidth distribution for a network is
- * recalculated due to: * address suggestion requests * address
- * deletions * address switching networks during address update *
- * preference changes
- *
- * 3.1 Data structures used
- *
- * For each ATS network (e.g. WAN, LAN, loopback) a struct Network
- * is used to specify network related information as total adresses
- * and active addresses in this network and the configured in- and
- * outbound quota. Each network also contains a list of addresses
- * added to the solver located in this network. The proportional
- * solver uses the addresses' solver_information field to store the
- * proportional network it belongs to for each address.
- *
- * 3.2 Initializing
- *
- * When the proportional solver is initialized the solver creates a
- * new solver handle and initializes the network structures with
- * the quotas passed from addresses and returns the handle solver.
- *
- * 3.3 Adding an address
- *
- * When a new address is added to the solver using s_add, a lookup
- * for the network for this address is done and the address is
- * enqueued in in the linked list of the network.
- *
- * 3.4 Updating an address
- *
- * The main purpose of address updates is to update the ATS
- * information for addresse selection. Important for the proportional
- * solver is when an address switches network it is located
- * in. This is common because addresses added by transport's
- * validation mechanism are commonly located in
- * #GNUNET_ATS_NET_UNSPECIFIED. Addresses in validation are located
- * in this network type and only if a connection is successful on
- * return of payload data transport switches to the real network
- * the address is located in. When an address changes networks it
- * is first of all removed from the old network using the solver
- * API function #GAS_proportional_address_delete() and the network in
- * the address struct is updated. A lookup for the respective new
- * proportional network is done and stored in the addresse's
- * solver_information field. Next the address is re-added to the
- * solver using the solver API function
- * #GAS_proportional_address_add(). If the address was marked as in
- * active, the solver checks if bandwidth is available in the
- * network and if yes sets the address to active and updates the
- * bandwidth distribution in this network. If no bandwidth is
- * available it sets the bandwidth for this address to 0 and tries
- * to suggest an alternative address. If an alternative address was
- * found, addresses' callback is called for this address.
- *
- * 3.5 Deleting an address
- *
- * When an address is removed from the solver, it removes the
- * respective address from the network and if the address was
- * marked as active, it updates the bandwidth distribution for this
- * network.
- *
- * 3.6 Requesting addresses
- *
- * When an address is requested for a peer the solver performs a
- * lookup for the peer entry in addresses address hashmap and
- * selects the best address. The selection of the most suitable
- * address is done in the find_address_it hashmap iterator
- * described in detail in section 3.7. If no address is returned,
- * no address can be suggested at the moment. If the address
- * returned is marked as active, the solver can return this
- * address. If the address is not marked as active, the solver
- * checks if another address belongign to this peer is marked as
- * active and marks the address as inactive, updates the bandwidth
- * for this address to 0, call the bandwidth changed callback for
- * this address due to the change and updates quota assignment for
- * the addresse's network. the now in-active address is belonging
- * to. The solver marks the new address as active and updates the
- * bandwidth assignment for this network.
- *
- * 3.7 Choosing addresses
- *
- * Choosing the best possible address for suggestion is done by
- * iterating over all addresses of a peer stored in addresses'
- * hashmap and using the hashmap iterator find_address_it to select
- * the best available address. Several checks are done when an
- * address is selected. First if this address is currently blocked
- * by addresses from being suggested. An address is blocked for the
- * duration of #ATS_BLOCKING_DELTA when it is suggested to
- * transport. Next it is checked if at least
- * #GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT bytes bandwidth is available
- * in the addresse's network, because suggesting an address without
- * bandwidth does not make sense. This also ensures that all active
- * addresses in this network get at least the minimum amount of
- * bandwidth assigned. In the next step the solver ensures that for
- * tcp connections inbound connections are prefered over outbound
- * connections. In the next stet the solver ensures that
- * connections are prefered in the following order: * connections
- * are already established and have bandwidth assigned *
- * connections with a shorter distance * connectes have a shorter
- * latency
- *
- * 3.8 Changing preferences
- *
- * 3.9 Shutdown
- *
- * During shutdown all network entries and aging processes are
- * destroyed and freed.
- *
- *
- * OLD DOCUMENTATION
- *
- * This solver assigns in and outbound bandwidth equally for all
- * addresses in specific network type (WAN, LAN) based on configured
- * in and outbound quota for this network.
- *
- * The solver is notified by addresses about changes to the addresses
- * and recalculates the bandwith assigned if required. The solver
- * notifies addresses by calling the GAS_bandwidth_changed_cb
- * callback.
- *
- * - Initialization
- *
- *
- *
- *
- * For each peer only a single is selected and marked as "active" in the address
- * struct.
- *
- * E.g.:
- *
- * You have the networks WAN and LAN and quotas
- * WAN_TOTAL_IN, WAN_TOTAL_OUT
- * LAN_TOTAL_IN, LAN_TOTAL_OUT
- *
- * If you have x addresses in the network segment LAN, the quotas are
- * QUOTA_PER_ADDRESS = LAN_TOTAL_OUT / x
- *
- * Quotas are automatically recalculated and reported back when addresses are
- * - requested
- *
+ * How much do we value stability over adaptation by default. A low
+ * value (close to 1.0) means we adapt as soon as possible, a larger
+ * value means that we have to have the respective factor of an
+ * advantage (or delay) before we adapt and sacrifice stability.
*/
+#define PROP_STABILITY_FACTOR 1.25
+
/**
- * Default value to assume for the proportionality factor,
- * if none is given in the configuration.
+ * Default value to assume for the proportionality factor, if none is
+ * given in the configuration. This factor determines how strong the
+ * bandwidth allocation will orient itself on the application
+ * preferences. A lower factor means a more balanced bandwidth
+ * distribution while a larger number means a distribution more in
+ * line with application (bandwidth) preferences.
*/
#define PROPORTIONALITY_FACTOR 2.0
*/
unsigned int active_addresses;
- /**
- * Number of networks in @a network_entries
- */
- unsigned int network_count;
};
/**
- * Function used to unload the plugin.
+ * Test if bandwidth is available in this network to add an additional address.
*
- * @param cls return value from #libgnunet_plugin_ats_proportional_init()
+ * @param net the network type to check
+ * @param extra for how many extra addresses do we check?
+ * @return #GNUNET_YES or #GNUNET_NO
*/
-void *
-libgnunet_plugin_ats_proportional_done (void *cls)
+static int
+is_bandwidth_available_in_network (struct Network *net,
+ int extra)
{
- struct GNUNET_ATS_SolverFunctions *sf = cls;
- struct GAS_PROPORTIONAL_Handle *s = sf->cls;
- struct AddressWrapper *cur;
- struct AddressWrapper *next;
- unsigned int c;
-
- for (c = 0; c < s->network_count; c++)
- {
- if (s->network_entries[c].total_addresses > 0)
- {
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Had %u addresses for network `%s' not deleted during shutdown\n",
- s->network_entries[c].total_addresses,
- s->network_entries[c].desc);
- //GNUNET_break(0);
- }
-
- if (s->network_entries[c].active_addresses > 0)
- {
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Had %u active addresses for network `%s' not deleted during shutdown\n",
- s->network_entries[c].active_addresses,
- s->network_entries[c].desc);
- //GNUNET_break(0);
- }
+ unsigned int na;
+ uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
- next = s->network_entries[c].head;
- while (NULL != (cur = next))
- {
- next = cur->next;
- GNUNET_CONTAINER_DLL_remove (s->network_entries[c].head,
- s->network_entries[c].tail,
- cur);
- GNUNET_free_non_null (cur->addr->solver_information);
- GNUNET_free(cur);
- }
- GNUNET_free (s->network_entries[c].stat_total);
- GNUNET_free (s->network_entries[c].stat_active);
- }
- if (s->active_addresses > 0)
- {
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Had %u active addresses not deleted during shutdown\n",
- s->active_addresses);
- // GNUNET_break (0);
- }
- GNUNET_free (s->network_entries);
- GNUNET_free (s);
- return NULL;
+ GNUNET_assert (((int)net->active_addresses) + extra >= 0);
+ na = net->active_addresses + extra;
+ if (0 == na)
+ return GNUNET_YES;
+ if ( ((net->total_quota_in / na) > min_bw) &&
+ ((net->total_quota_out / na) > min_bw) )
+ return GNUNET_YES;
+ return GNUNET_NO;
}
/**
- * Test if bandwidth is available in this network to add an additional address
+ * Test if all peers in this network require connectivity at level at
+ * least @a con.
*
- * @param net the network type to update
+ * @param s the solver handle
+ * @param net the network type to check
+ * @param con connection return value threshold to check
* @return #GNUNET_YES or #GNUNET_NO
*/
static int
-is_bandwidth_available_in_network (struct Network *net)
+all_require_connectivity (struct GAS_PROPORTIONAL_Handle *s,
+ struct Network *net,
+ unsigned int con)
{
- unsigned int na = net->active_addresses + 1;
- uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
-
- if (((net->total_quota_in / na) > min_bw)
- && ((net->total_quota_out / na) > min_bw))
- {
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Enough bandwidth available for %u active addresses in network `%s'\n",
- na,
- net->desc);
+ struct AddressWrapper *aw;
- return GNUNET_YES;
- }
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Not enough bandwidth available for %u active addresses in network `%s'\n",
- na,
- net->desc);
- return GNUNET_NO;
+ for (aw = net->head; NULL != aw; aw = aw->next)
+ if (con >
+ s->env->get_connectivity (s->env->cls,
+ &aw->addr->peer))
+ return GNUNET_NO;
+ return GNUNET_YES;
}
/**
- * Update bandwidth assigned to peers in this network
+ * Update bandwidth assigned to peers in this network. The basic idea
+ * is to assign every peer in the network the minimum bandwidth, and
+ * then distribute the remaining bandwidth proportional to application
+ * preferences.
*
* @param s the solver handle
* @param net the network type to update
- * this address
*/
static void
distribute_bandwidth (struct GAS_PROPORTIONAL_Handle *s,
struct Network *net)
{
+ const uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
struct AddressWrapper *aw;
- unsigned long long remaining_quota_in = 0;
- unsigned long long quota_out_used = 0;
- unsigned long long remaining_quota_out = 0;
- unsigned long long quota_in_used = 0;
- int count_addresses;
- uint32_t min_bw = ntohl (GNUNET_CONSTANTS_DEFAULT_BW_IN_OUT.value__);
- double relative_peer_prefence;
- double sum_relative_peer_prefences; /* Important: has to be double not float due to precision */
- double cur_pref; /* Important: has to be double not float due to precision */
+ unsigned long long remaining_quota_in;
+ unsigned long long quota_out_used;
+ unsigned long long remaining_quota_out;
+ unsigned long long quota_in_used;
+ unsigned int count_addresses;
+ double sum_relative_peer_prefences;
double peer_weight;
double total_weight;
- const double *peer_relative_prefs = NULL; /* Important: has to be double not float due to precision */
-
- uint32_t assigned_quota_in = 0;
- uint32_t assigned_quota_out = 0;
-
+ const double *peer_relative_prefs;
LOG (GNUNET_ERROR_TYPE_INFO,
"Recalculate quota for network type `%s' for %u addresses (in/out): %llu/%llu \n",
net->total_quota_in,
net->total_quota_in);
- if (net->active_addresses == 0)
- {
+ if (0 == net->active_addresses)
return; /* no addresses to update */
- }
-
- /* Idea
- * Assign every peer in network minimum Bandwidth
- * Distribute bandwidth left according to preference
- */
+ /* sanity checks */
if ((net->active_addresses * min_bw) > net->total_quota_in)
{
GNUNET_break(0);
return;
}
- remaining_quota_in = net->total_quota_in - (net->active_addresses * min_bw);
- remaining_quota_out = net->total_quota_out - (net->active_addresses * min_bw);
- LOG(GNUNET_ERROR_TYPE_DEBUG, "Remaining bandwidth : (in/out): %llu/%llu \n",
- remaining_quota_in, remaining_quota_out);
+ /* Calculate sum of relative preference for active addresses in this
+ network */
sum_relative_peer_prefences = 0.0;
-
- /* Calculate sum of relative preference for active addresses in this network */
count_addresses = 0;
for (aw = net->head; NULL != aw; aw = aw->next)
{
if (GNUNET_YES != aw->addr->active)
continue;
-
peer_relative_prefs = s->env->get_preferences (s->env->cls,
&aw->addr->peer);
- relative_peer_prefence = 0.0;
- relative_peer_prefence += peer_relative_prefs[GNUNET_ATS_PREFERENCE_BANDWIDTH];
- sum_relative_peer_prefences += relative_peer_prefence;
- count_addresses ++;
+ sum_relative_peer_prefences
+ += peer_relative_prefs[GNUNET_ATS_PREFERENCE_BANDWIDTH];
+ count_addresses++;
}
-
if (count_addresses != net->active_addresses)
{
GNUNET_break (0);
LOG (GNUNET_ERROR_TYPE_WARNING,
- "%s: Counted %u active addresses, but network says to have %u active addresses\n",
- net->desc, count_addresses, net->active_addresses);
- for (aw = net->head; NULL != aw; aw = aw->next)
- {
- if (GNUNET_YES != aw->addr->active)
- continue;
-
- LOG (GNUNET_ERROR_TYPE_WARNING,
- "Active: `%s' `%s' length %u\n",
- GNUNET_i2s (&aw->addr->peer),
- aw->addr->plugin,
- aw->addr->addr_len);
- }
+ "%s: Counted %u active addresses, expected %u active addresses\n",
+ net->desc,
+ count_addresses,
+ net->active_addresses);
+ /* try to fix... */
+ net->active_addresses = count_addresses;
}
-
LOG (GNUNET_ERROR_TYPE_INFO,
- "Total relative preference %.3f for %u addresses in network %s\n",
- sum_relative_peer_prefences, net->active_addresses, net->desc);
+ "Total relative preference %.3f for %u addresses in network %s\n",
+ sum_relative_peer_prefences,
+ net->active_addresses,
+ net->desc);
+ /* check how much we have to distribute */
+ remaining_quota_in = net->total_quota_in - (net->active_addresses * min_bw);
+ remaining_quota_out = net->total_quota_out - (net->active_addresses * min_bw);
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Proportionally distributable bandwidth (in/out): %llu/%llu\n",
+ remaining_quota_in,
+ remaining_quota_out);
+
+ /* distribute remaining quota; we do not do it exactly proportional,
+ but balance "even" distribution ("net->active_addresses") with
+ the preference sum using the "prop_factor". */
+ total_weight = net->active_addresses +
+ s->prop_factor * sum_relative_peer_prefences;
+ quota_out_used = 0;
+ quota_in_used = 0;
for (aw = net->head; NULL != aw; aw = aw->next)
{
- if (GNUNET_YES == aw->addr->active)
+ if (GNUNET_YES != aw->addr->active)
{
- peer_relative_prefs = s->env->get_preferences (s->env->cls,
- &aw->addr->peer);
+ /* set to 0, just to be sure */
+ aw->calculated_quota_in = 0;
+ aw->calculated_quota_out = 0;
+ continue;
+ }
+ peer_relative_prefs = s->env->get_preferences (s->env->cls,
+ &aw->addr->peer);
+ peer_weight = 1.0
+ + s->prop_factor * peer_relative_prefs[GNUNET_ATS_PREFERENCE_BANDWIDTH];
- cur_pref = peer_relative_prefs[GNUNET_ATS_PREFERENCE_BANDWIDTH];
- total_weight = net->active_addresses +
- s->prop_factor * sum_relative_peer_prefences;
- peer_weight = (1.0 + (s->prop_factor * cur_pref));
+ aw->calculated_quota_in = min_bw
+ + (peer_weight / total_weight) * remaining_quota_in;
+ aw->calculated_quota_out = min_bw
+ + (peer_weight / total_weight) * remaining_quota_out;
- assigned_quota_in = min_bw
- + ((peer_weight / total_weight) * remaining_quota_in);
- assigned_quota_out = min_bw
- + ((peer_weight / total_weight) * remaining_quota_out);
+ LOG (GNUNET_ERROR_TYPE_INFO,
+ "New quotas for peer `%s' with weight (cur/total) %.3f/%.3f (in/out) are: %u/%u\n",
+ GNUNET_i2s (&aw->addr->peer),
+ peer_weight,
+ total_weight,
+ (unsigned int) aw->calculated_quota_in,
+ (unsigned int) aw->calculated_quota_out);
+ quota_in_used += aw->calculated_quota_in;
+ quota_out_used += aw->calculated_quota_out;
+ }
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Total bandwidth assigned is (in/out): %llu /%llu\n",
+ quota_in_used,
+ quota_out_used);
+ /* +1 due to possible rounding errors */
+ GNUNET_break (quota_out_used <= net->total_quota_out + 1);
+ GNUNET_break (quota_in_used <= net->total_quota_in + 1);
+}
- LOG (GNUNET_ERROR_TYPE_INFO,
- "New quota for peer `%s' with weight (cur/total) %.3f/%.3f (in/out): %llu / %llu\n",
- GNUNET_i2s (&aw->addr->peer), peer_weight, total_weight,
- assigned_quota_in, assigned_quota_out);
- }
- else
- {
- assigned_quota_in = 0;
- assigned_quota_out = 0;
- }
- quota_in_used += assigned_quota_in;
- quota_out_used += assigned_quota_out;
- /* Prevent overflow due to rounding errors */
- if (assigned_quota_in > UINT32_MAX)
- assigned_quota_in = UINT32_MAX;
- if (assigned_quota_out > UINT32_MAX)
- assigned_quota_out = UINT32_MAX;
-
- /* Compare to current bandwidth assigned */
- aw->calculated_quota_in = assigned_quota_in;
- aw->calculated_quota_out = assigned_quota_out;
+/**
+ * Notify ATS service of bandwidth changes to addresses.
+ *
+ * @param s solver handle
+ * @param net the network to propagate changes in
+ */
+static void
+propagate_bandwidth (struct GAS_PROPORTIONAL_Handle *s,
+ struct Network *net)
+{
+ struct AddressWrapper *cur;
+
+ for (cur = net->head; NULL != cur; cur = cur->next)
+ {
+ if ( (cur->addr->assigned_bw_in == cur->calculated_quota_in) &&
+ (cur->addr->assigned_bw_out == cur->calculated_quota_out) )
+ continue;
+ cur->addr->assigned_bw_in = cur->calculated_quota_in;
+ cur->addr->assigned_bw_out = cur->calculated_quota_out;
+ if (GNUNET_YES == cur->addr->active)
+ s->env->bandwidth_changed_cb (s->env->cls,
+ cur->addr);
+ }
+}
+
+
+/**
+ * Distribute bandwidth. The addresses have already been selected,
+ * this is merely distributed the bandwidth among the addresses.
+ *
+ * @param s the solver handle
+ * @param n the network, can be NULL for all networks
+ */
+static void
+distribute_bandwidth_in_network (struct GAS_PROPORTIONAL_Handle *s,
+ struct Network *n)
+{
+ unsigned int i;
+
+ if (0 != s->bulk_lock)
+ {
+ s->bulk_requests++;
+ return;
}
- LOG(GNUNET_ERROR_TYPE_DEBUG,
- "Total bandwidth assigned is (in/out): %llu /%llu\n", quota_in_used,
- quota_out_used);
- if (quota_out_used > net->total_quota_out + 1) /* +1 is required due to rounding errors */
+ if (NULL != n)
{
- LOG(GNUNET_ERROR_TYPE_ERROR,
- "Total outbound bandwidth assigned is larger than allowed (used/allowed) for %u active addresses: %llu / %llu\n",
- net->active_addresses, quota_out_used, net->total_quota_out);
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Redistributing bandwidth in network %s with %u active and %u total addresses\n",
+ GNUNET_ATS_print_network_type(n->type),
+ n->active_addresses,
+ n->total_addresses);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_START,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_SINGLE);
+ distribute_bandwidth(s,
+ n);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_STOP,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_SINGLE);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_SINGLE);
+ propagate_bandwidth (s,
+ n);
+
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_SINGLE);
}
- if (quota_in_used > net->total_quota_in + 1) /* +1 is required due to rounding errors */
+ else
{
- LOG(GNUNET_ERROR_TYPE_ERROR,
- "Total inbound bandwidth assigned is larger than allowed (used/allowed) for %u active addresses: %llu / %llu\n",
- net->active_addresses, quota_in_used, net->total_quota_in);
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Redistributing bandwidth in all %u networks\n",
+ s->env->network_count);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_START,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_ALL);
+ for (i = 0; i < s->env->network_count; i++)
+ distribute_bandwidth (s,
+ &s->network_entries[i]);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_STOP,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_ALL);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_ALL);
+ for (i = 0; i < s->env->network_count; i++)
+ propagate_bandwidth (s,
+ &s->network_entries[i]);
+ s->env->info_cb (s->env->cls,
+ GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
+ GAS_STAT_SUCCESS,
+ GAS_INFO_PROP_ALL);
}
}
/**
- * Find index of a ATS property type in the array.
- */
-static int
-find_property_index (uint32_t type)
-{
- int existing_types[] = GNUNET_ATS_QualityProperties;
- int c;
-
- for (c = 0; c < GNUNET_ATS_QualityPropertiesCount; c++)
- if (existing_types[c] == type)
- return c;
- return GNUNET_SYSERR;
-}
-
-
-/**
- * Find a "good" address to use for a peer by iterating over the addresses for this peer.
- * If we already have an existing address, we stick to it.
- * Otherwise, we pick by lowest distance and then by lowest latency.
+ * Find a "good" address to use for a peer by iterating over the
+ * addresses for this peer. If we already have an existing address,
+ * we stick to it. Otherwise, we pick by lowest distance and then by
+ * lowest latency.
*
* @param cls the `struct FindBestAddressCtx *' where we store the result
- * @param key unused
+ * @param key the peer we are trying to find the best address for
* @param value another `struct ATS_Address*` to consider using
* @return #GNUNET_OK (continue to iterate)
*/
{
struct FindBestAddressCtx *ctx = cls;
struct ATS_Address *current = value;
- struct ATS_Address *current_best = current;
- struct AddressWrapper *asi;
+ struct AddressWrapper *asi = current->solver_information;
struct GNUNET_TIME_Relative active_time;
- struct GNUNET_TIME_Relative min_active_time;
double best_delay;
double best_distance;
double cur_delay;
double cur_distance;
- int index;
-
- current_best = NULL;
- asi = current->solver_information;
- if (NULL == asi)
+ unsigned int con;
+ int bw_available;
+ int need;
+
+ /* we need +1 slot if 'current' is not yet active */
+ need = (GNUNET_YES == current->active) ? 0 : 1;
+ /* we save -1 slot if 'best' is active and belongs
+ to the same network (as we would replace it) */
+ if ( (NULL != ctx->best) &&
+ (GNUNET_YES == ctx->best->active) &&
+ (((struct AddressWrapper *) ctx->best->solver_information)->network ==
+ asi->network) )
+ need--;
+ /* we can gain -1 slot if this peers connectivity
+ requirement is higher than that of another peer
+ in that network scope */
+ con = ctx->s->env->get_connectivity (ctx->s->env->cls,
+ key);
+ if (GNUNET_YES !=
+ all_require_connectivity (ctx->s,
+ asi->network,
+ con))
+ need--;
+ /* test if minimum bandwidth for 'current' would be available */
+ bw_available
+ = is_bandwidth_available_in_network (asi->network,
+ need);
+ if (! bw_available)
{
- GNUNET_break (0);
+ /* Bandwidth for this address is unavailable, so we cannot use
+ it. */
return GNUNET_OK;
}
-
- if (GNUNET_NO == is_bandwidth_available_in_network (asi->network))
- {
- return GNUNET_OK; /* There's no bandwidth available in this network */
- }
-
- if (NULL != ctx->best)
- {
- /* Compare current addresses with denominated 'best' address */
- current_best = ctx->best;
- }
- else
- {
- /* We do not have a 'best' address so take this address */
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Setting initial address %p\n",
- current);
- current_best = current;
- goto end;
- }
-
if (GNUNET_YES == current->active)
{
- GNUNET_assert (asi->activated.abs_value_us != GNUNET_TIME_UNIT_ZERO_ABS.abs_value_us);
active_time = GNUNET_TIME_absolute_get_duration (asi->activated);
- min_active_time.rel_value_us = ((double) GNUNET_TIME_UNIT_SECONDS.rel_value_us) *
- ctx->s->stability_factor;
- if (active_time.rel_value_us <= min_active_time.rel_value_us)
+ if (active_time.rel_value_us <=
+ ((double) GNUNET_TIME_UNIT_SECONDS.rel_value_us) * ctx->s->stability_factor)
{
/* Keep active address for stability reasons */
ctx->best = current;
return GNUNET_NO;
}
}
+ if (NULL == ctx->best)
+ {
+ /* We so far have nothing else, so go with it! */
+ ctx->best = current;
+ return GNUNET_OK;
+ }
/* Now compare ATS information */
- index = find_property_index (GNUNET_ATS_QUALITY_NET_DISTANCE);
- cur_distance = current->atsin[index].norm;
- best_distance = ctx->best->atsin[index].norm;
- index = find_property_index (GNUNET_ATS_QUALITY_NET_DELAY);
- cur_delay = current->atsin[index].norm;
- best_delay = ctx->best->atsin[index].norm;
+ cur_distance = current->norm_distance.norm;
+ best_distance = ctx->best->norm_distance.norm;
+ cur_delay = current->norm_delay.norm;
+ best_delay = ctx->best->norm_delay.norm;
/* user shorter distance */
if (cur_distance < best_distance)
{
if (GNUNET_NO == ctx->best->active)
{
- current_best = current; /* Use current */
+ /* Activity doesn't influence the equation, use current */
+ ctx->best = current;
}
else if ((best_distance / cur_distance) > ctx->s->stability_factor)
{
- /* Best and active address performs worse */
- current_best = current;
+ /* Distance change is significant, switch active address! */
+ ctx->best = current;
}
}
- else
- {
- /* Use current best */
- current_best = ctx->best;
- }
/* User connection with less delay */
if (cur_delay < best_delay)
{
-
if (GNUNET_NO == ctx->best->active)
{
- current_best = current; /* Use current */
+ /* Activity doesn't influence the equation, use current */
+ ctx->best = current;
}
else if ((best_delay / cur_delay) > ctx->s->stability_factor)
{
- /* Best and active address performs worse */
- current_best = current;
+ /* Latency change is significant, switch active address! */
+ ctx->best = current;
}
}
- else
- {
- /* Use current best */
- current_best = ctx->best;
- }
-
-end:
- ctx->best = current_best;
return GNUNET_OK;
}
/**
- * Find the currently best address for a peer from the set of addresses available
- * or return NULL of no address is available
+ * Find the currently best address for a peer from the set of
+ * addresses available or return NULL of no address is available.
*
* @param s the proportional handle
* @param addresses the address hashmap
const struct GNUNET_PeerIdentity *id)
{
struct FindBestAddressCtx fba_ctx;
-
- fba_ctx.best = NULL;
- fba_ctx.s = s;
- GNUNET_CONTAINER_multipeermap_get_multiple (addresses,
- id,
- &find_best_address_it,
- &fba_ctx);
- return fba_ctx.best;
-}
-
-
-/**
- * Hashmap Iterator to find current active address for peer
- *
- * @param cls last active address
- * @param key peer's key
- * @param value address to check
- * @return #GNUNET_NO on double active address else #GNUNET_YES;
- */
-static int
-get_active_address_it (void *cls,
- const struct GNUNET_PeerIdentity *key,
- void *value)
-{
- struct ATS_Address **dest = cls;
- struct ATS_Address *aa = (struct ATS_Address *) value;
-
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Checking address %p\n", aa);
-
- if (GNUNET_YES == aa->active)
- {
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Address %p is active\n", aa);
- if (NULL != (*dest))
- {
- /* should never happen */
- LOG (GNUNET_ERROR_TYPE_ERROR,
- "Multiple active addresses for peer `%s'\n",
- GNUNET_i2s (&aa->peer));
- GNUNET_break(0);
- return GNUNET_NO;
- }
- (*dest) = aa;
-
- }
- return GNUNET_OK;
-}
-
-
-/**
- * Find current active address for peer
- *
- * @param s the solver handle
- * @param peer the peer
- * @return active address or NULL
- */
-static struct ATS_Address *
-get_active_address (struct GAS_PROPORTIONAL_Handle *s,
- const struct GNUNET_PeerIdentity *peer)
-{
- struct ATS_Address *dest;
-
- dest = NULL;
- GNUNET_CONTAINER_multipeermap_get_multiple (s->env->addresses,
- peer,
- &get_active_address_it,
- &dest);
- return dest;
-}
-
-
-/**
- * Lookup network struct by type
- *
- * @param s the solver handle
- * @param type the network type
- * @return the network struct
- */
-static struct Network *
-get_network (struct GAS_PROPORTIONAL_Handle *s,
- enum GNUNET_ATS_Network_Type type)
-{
- if (type >= s->env->network_count)
- {
- GNUNET_break (0);
- return NULL;
- }
- return &s->network_entries[type];
+
+ fba_ctx.best = NULL;
+ fba_ctx.s = s;
+ GNUNET_CONTAINER_multipeermap_get_multiple (addresses,
+ id,
+ &find_best_address_it,
+ &fba_ctx);
+ return fba_ctx.best;
}
/**
- * Decrease address count in network
+ * Decrease number of active addresses in network.
*
* @param s the solver handle
* @param net the network type
address_decrement_active (struct GAS_PROPORTIONAL_Handle *s,
struct Network *net)
{
- if (net->active_addresses < 1)
- {
- GNUNET_break (0);
- }
- else
- {
- net->active_addresses--;
- GNUNET_STATISTICS_update (s->env->stats,
- net->stat_active, -1, GNUNET_NO);
- }
- if (s->active_addresses < 1)
- {
- GNUNET_break (0);
- }
- else
- {
- s->active_addresses--;
- GNUNET_STATISTICS_update (s->env->stats,
- "# ATS addresses total",
- -1,
- GNUNET_NO);
- }
+ GNUNET_assert (net->active_addresses > 0);
+ net->active_addresses--;
+ GNUNET_STATISTICS_update (s->env->stats,
+ net->stat_active,
+ -1,
+ GNUNET_NO);
+ GNUNET_assert (s->active_addresses > 0);
+ s->active_addresses--;
+ GNUNET_STATISTICS_update (s->env->stats,
+ "# ATS addresses total",
+ -1,
+ GNUNET_NO);
}
/**
- * Compares addresses
+ * Address map iterator to find current active address for peer.
+ * Asserts that only one address is active per peer.
*
- * @param a address a
- * @param b address b
- * @return GNUNET_YES if equal, GNUNET_NO else
+ * @param cls last active address
+ * @param key peer's key
+ * @param value address to check
+ * @return #GNUNET_NO on double active address else #GNUNET_YES;
*/
static int
-address_eq (struct ATS_Address *a, struct ATS_Address *b)
-{
- GNUNET_assert (NULL != a);
- GNUNET_assert (NULL != b);
- if (0 != strcmp(a->plugin, b->plugin))
- return GNUNET_NO;
- if (a->addr_len != b->addr_len)
- return GNUNET_NO;
- if (0 != memcmp (a->addr, b->addr, b->addr_len))
- return GNUNET_NO;
- if (a->session_id != b->session_id)
- return GNUNET_NO;
- return GNUNET_YES;
-}
-
-
-/**
- * Notify bandwidth changes to addresses
- *
- * @param s solver handle
- * @param net the network to propagate changes in
- */
-static void
-propagate_bandwidth (struct GAS_PROPORTIONAL_Handle *s,
- struct Network *net)
+get_active_address_it (void *cls,
+ const struct GNUNET_PeerIdentity *key,
+ void *value)
{
- struct AddressWrapper *cur;
+ struct ATS_Address **dest = cls;
+ struct ATS_Address *aa = value;
- for (cur = net->head; NULL != cur; cur = cur->next)
- {
- if ( (cur->addr->assigned_bw_in != cur->calculated_quota_in) ||
- (cur->addr->assigned_bw_out != cur->calculated_quota_out) )
- {
- cur->addr->assigned_bw_in = cur->calculated_quota_in;
- cur->addr->assigned_bw_out = cur->calculated_quota_out;
-
- /* Reset for next iteration */
- cur->calculated_quota_in = 0;
- cur->calculated_quota_out = 0;
- LOG (GNUNET_ERROR_TYPE_DEBUG,
- "Bandwidth for %s address %p for peer `%s' changed to %u/%u\n",
- (GNUNET_NO == cur->addr->active) ? "inactive" : "active",
- cur->addr,
- GNUNET_i2s (&cur->addr->peer),
- cur->addr->assigned_bw_in,
- cur->addr->assigned_bw_out);
-
- /* Notify on change */
- if ((GNUNET_YES == cur->addr->active))
- {
- s->env->bandwidth_changed_cb (s->env->cls,
- cur->addr);
- }
- }
- }
+ if (GNUNET_YES != aa->active)
+ return GNUNET_OK;
+ GNUNET_assert (NULL == (*dest));
+ (*dest) = aa;
+ return GNUNET_OK;
}
/**
- * Distribibute bandwidth
+ * Find current active address for peer
*
* @param s the solver handle
- * @param n the network, can be NULL for all network
+ * @param peer the peer
+ * @return active address or NULL
*/
-static void
-distribute_bandwidth_in_network (struct GAS_PROPORTIONAL_Handle *s,
- struct Network *n)
+static struct ATS_Address *
+get_active_address (struct GAS_PROPORTIONAL_Handle *s,
+ const struct GNUNET_PeerIdentity *peer)
{
- if (GNUNET_YES == s->bulk_lock)
- {
- s->bulk_requests++;
- return;
- }
-
- if (NULL != n)
- {
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Redistributing bandwidth in network %s with %u active and %u total addresses\n",
- GNUNET_ATS_print_network_type(n->type),
- n->active_addresses,
- n->total_addresses);
-
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_START,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_SINGLE);
-
- /* Distribute */
- distribute_bandwidth(s, n);
-
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_STOP,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_SINGLE);
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_SINGLE);
-
- /* Do propagation */
- propagate_bandwidth (s, n);
-
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_SINGLE);
- }
- else
- {
- int i;
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_START,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_ALL);
- for (i = 0; i < s->network_count; i++)
- {
- /* Distribute */
- distribute_bandwidth(s, &s->network_entries[i]);
- }
+ struct ATS_Address *dest;
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_STOP,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_ALL);
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_UPDATE_NOTIFICATION_START,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_ALL);
- for (i = 0; i < s->network_count; i++)
- {
- /* Do propagation */
- propagate_bandwidth(s, &s->network_entries[i]);
- }
- s->env->info_cb (s->env->cls,
- GAS_OP_SOLVE_UPDATE_NOTIFICATION_STOP,
- GAS_STAT_SUCCESS,
- GAS_INFO_PROP_ALL);
- }
+ dest = NULL;
+ GNUNET_CONTAINER_multipeermap_get_multiple (s->env->addresses,
+ peer,
+ &get_active_address_it,
+ &dest);
+ return dest;
}
/**
- * Update active address for a peer:
- * Check if active address exists and what the best address is, if addresses
- * are different switch
+ * Update active address for a peer. Check if active address exists
+ * and what the best address is, if addresses are different switch.
+ * Then reallocate bandwidth within the affected network scopes.
*
* @param s solver handle
+ * @param current_address the address currently active for the peer,
+ * NULL for none
* @param peer the peer to check
- * return the new address or NULL if no update was performed
- */
-static struct ATS_Address *
+ */
+static void
update_active_address (struct GAS_PROPORTIONAL_Handle *s,
+ struct ATS_Address *current_address,
const struct GNUNET_PeerIdentity *peer)
{
struct ATS_Address *best_address;
- struct ATS_Address *current_address;
- struct AddressWrapper *asi;
- struct Network *net;
-
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Updating active address for peer `%s'\n",
- GNUNET_i2s (peer));
-
- /* Find active address */
- current_address = get_active_address (s,
- peer);
-
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Peer `%s' has active address %p\n",
- GNUNET_i2s (peer),
- current_address);
+ struct AddressWrapper *asi_cur;
+ struct AddressWrapper *asi_best;
+ struct AddressWrapper *aw;
+ struct AddressWrapper *aw_min;
+ unsigned int a_con;
+ unsigned int con_min;
- /* Find best address */
best_address = get_best_address (s,
s->env->addresses,
peer);
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Peer `%s' has best address %p\n",
- GNUNET_i2s (peer),
- best_address);
-
+ if (NULL != best_address)
+ asi_best = best_address->solver_information;
+ else
+ asi_best = NULL;
+ if (current_address == best_address)
+ return; /* no changes */
if (NULL != current_address)
{
+ /* We switch to a new address (or to none);
+ mark old address as inactive. */
+ asi_cur = current_address->solver_information;
GNUNET_assert (GNUNET_YES == current_address->active);
+ LOG (GNUNET_ERROR_TYPE_INFO,
+ "Disabling previous active address for peer `%s'\n",
+ GNUNET_i2s (peer));
+ asi_cur->activated = GNUNET_TIME_UNIT_ZERO_ABS;
+ current_address->active = GNUNET_NO;
+ current_address->assigned_bw_in = 0;
+ current_address->assigned_bw_out = 0;
+ address_decrement_active (s,
+ asi_cur->network);
if ( (NULL == best_address) ||
- ( (NULL != best_address) &&
- (GNUNET_NO == address_eq (current_address,
- best_address)) ) )
- {
- /* We switch to a new address (or to none),
- mark old address as inactive */
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Disabling previous %s address %p for peer `%s'\n",
- (GNUNET_NO == current_address->active) ? "inactive" : "active",
- current_address,
- GNUNET_i2s (peer));
-
- asi = current_address->solver_information;
- net = asi->network;
- asi->activated = GNUNET_TIME_UNIT_ZERO_ABS;
- current_address->active = GNUNET_NO; /* No active any longer */
- current_address->assigned_bw_in = 0; /* no bandwidth assigned */
- current_address->assigned_bw_out = 0; /* no bandwidth assigned */
- address_decrement_active (s, net);
- distribute_bandwidth_in_network (s, net);
- }
+ (asi_best->network != asi_cur->network) )
+ distribute_bandwidth_in_network (s,
+ asi_cur->network);
if (NULL == best_address)
{
- /* We previously had an active address, but now we cannot suggest one
- * Therefore we have to disconnect the peer */
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Disconnecting peer `%s' with previous address %p\n",
- GNUNET_i2s (peer),
- current_address);
+ /* We previously had an active address, but now we cannot
+ * suggest one. Therefore we have to disconnect the peer.
+ * The above call to "distribute_bandwidth_in_network()
+ * does not see 'current_address' so we need to trigger
+ * the update here. */
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Disconnecting peer `%s'.\n",
+ GNUNET_i2s (peer));
s->env->bandwidth_changed_cb (s->env->cls,
current_address);
+ return;
}
}
if (NULL == best_address)
{
- LOG (GNUNET_ERROR_TYPE_INFO,
+ /* We do not have a new address, so we are done. */
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
"Cannot suggest address for peer `%s'\n",
GNUNET_i2s (peer));
- return NULL;
+ return;
}
-
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Suggesting new address %p for peer `%s'\n",
+ /* We do have a new address, activate it */
+ LOG (GNUNET_ERROR_TYPE_DEBUG,
+ "Selecting new address %p for peer `%s'\n",
best_address,
GNUNET_i2s (peer));
-
- if ( (NULL != current_address) &&
- (GNUNET_YES == address_eq (best_address, current_address)) )
- {
- GNUNET_break (GNUNET_NO != current_address->active);
- return best_address; /* Same same */
- }
-
- asi = best_address->solver_information;
- GNUNET_assert (NULL != asi);
- net = asi->network;
-
/* Mark address as active */
- asi->activated = GNUNET_TIME_absolute_get ();
best_address->active = GNUNET_YES;
-
- net->active_addresses++;
+ asi_best->activated = GNUNET_TIME_absolute_get ();
+ asi_best->network->active_addresses++;
s->active_addresses++;
GNUNET_STATISTICS_update (s->env->stats,
"# ATS active addresses total",
1,
GNUNET_NO);
GNUNET_STATISTICS_update (s->env->stats,
- net->stat_active,
+ asi_best->network->stat_active,
1,
GNUNET_NO);
LOG (GNUNET_ERROR_TYPE_INFO,
"Address %p for peer `%s' is now active\n",
best_address,
GNUNET_i2s (peer));
- /* Distribute bandwidth */
- distribute_bandwidth_in_network (s, net);
- return best_address;
+
+ if (GNUNET_NO ==
+ is_bandwidth_available_in_network (asi_best->network,
+ 0))
+ {
+ /* we went over the maximum number of addresses for
+ this scope; remove the address with the smallest
+ connectivity requirement */
+ con_min = UINT32_MAX;
+ aw_min = NULL;
+ for (aw = asi_best->network->head; NULL != aw; aw = aw->next)
+ {
+ if ( (con_min >
+ (a_con = s->env->get_connectivity (s->env->cls,
+ &aw->addr->peer))) &&
+ (GNUNET_YES == aw->addr->active) )
+ {
+ aw_min = aw;
+ con_min = a_con;
+ if (0 == con_min)
+ break;
+ }
+ }
+ update_active_address (s,
+ aw_min->addr,
+ &aw_min->addr->peer);
+ }
+ distribute_bandwidth_in_network (s,
+ asi_best->network);
}
/**
- * Changes the preferences for a peer in the problem
+ * The preferences for a peer in the problem changed.
*
* @param solver the solver handle
* @param peer the peer to change the preference for
* @param pref_rel the normalized preference value for this kind over all clients
*/
static void
-GAS_proportional_address_change_preference (void *solver,
- const struct GNUNET_PeerIdentity *peer,
- enum GNUNET_ATS_PreferenceKind kind,
- double pref_rel)
+GAS_proportional_change_preference (void *solver,
+ const struct GNUNET_PeerIdentity *peer,
+ enum GNUNET_ATS_PreferenceKind kind,
+ double pref_rel)
{
struct GAS_PROPORTIONAL_Handle *s = solver;
- struct ATS_Address *best_address;
- struct ATS_Address *active_address;
- struct AddressWrapper *asi;
-
- if (0 ==
- s->env->get_connectivity (s->env->cls,
- peer))
- return; /* Peer is not requested */
-
- /* This peer is requested, find best address */
- active_address = get_active_address (s,
- peer);
- best_address = update_active_address (s, peer);
-
- if ((NULL != best_address) && ((NULL != active_address) &&
- (GNUNET_YES == address_eq (active_address, best_address))))
- {
- asi = best_address->solver_information;
- GNUNET_assert (NULL != asi);
- /* We sticked to the same address, therefore redistribute */
- distribute_bandwidth_in_network (s, asi->network);
- }
+ if (GNUNET_ATS_PREFERENCE_BANDWIDTH != kind)
+ return; /* we do not care */
+ distribute_bandwidth_in_network (s,
+ NULL);
}
* @param score the score
*/
static void
-GAS_proportional_address_preference_feedback (void *solver,
- struct GNUNET_SERVER_Client *application,
- const struct GNUNET_PeerIdentity *peer,
- const struct GNUNET_TIME_Relative scope,
- enum GNUNET_ATS_PreferenceKind kind,
- double score)
+GAS_proportional_feedback (void *solver,
+ struct GNUNET_SERVICE_Client *application,
+ const struct GNUNET_PeerIdentity *peer,
+ const struct GNUNET_TIME_Relative scope,
+ enum GNUNET_ATS_PreferenceKind kind,
+ double score)
{
- struct GAS_PROPORTIONAL_Handle *s = solver;
-
- GNUNET_assert(NULL != peer);
- GNUNET_assert(NULL != s);
+ /* Proportional does not care about feedback */
}
*
* @param solver the solver handle
* @param peer the identity of the peer
- * @return best address
*/
-static const struct ATS_Address *
-GAS_proportional_get_preferred_address (void *solver,
- const struct GNUNET_PeerIdentity *peer)
+static void
+GAS_proportional_start_get_address (void *solver,
+ const struct GNUNET_PeerIdentity *peer)
{
struct GAS_PROPORTIONAL_Handle *s = solver;
- const struct ATS_Address *best_address;
- best_address = update_active_address (s, peer);
- if (s->bulk_lock > 0)
- return NULL;
- return best_address;
+ update_active_address (s,
+ get_active_address (s,
+ peer),
+ peer);
}
* @param peer the peer
*/
static void
-GAS_proportional_stop_get_preferred_address (void *solver,
- const struct GNUNET_PeerIdentity *peer)
+GAS_proportional_stop_get_address (void *solver,
+ const struct GNUNET_PeerIdentity *peer)
{
struct GAS_PROPORTIONAL_Handle *s = solver;
struct ATS_Address *cur;
struct AddressWrapper *asi;
- struct Network *cur_net;
cur = get_active_address (s,
peer);
- if (NULL != cur)
- {
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Disabling %s address %p for peer `%s'\n",
- (GNUNET_NO == cur->active) ? "inactive" : "active",
- cur,
- GNUNET_i2s (&cur->peer));
-
- /* Disabling current address */
- asi = cur->solver_information;
- cur_net = asi->network;
- asi->activated = GNUNET_TIME_UNIT_ZERO_ABS;
- cur->active = GNUNET_NO; /* No active any longer */
- cur->assigned_bw_in = 0; /* no bandwidth assigned */
- cur->assigned_bw_out = 0; /* no bandwidth assigned */
-
- address_decrement_active (s, cur_net);
-
- distribute_bandwidth_in_network (s, cur_net);
- }
+ if (NULL == cur)
+ return;
+ asi = cur->solver_information;
+ distribute_bandwidth_in_network (s,
+ asi->network);
}
/**
- * Bulk operation done
+ * Bulk operation done.
+ *
+ * @param solver our `struct GAS_PROPORTIONAL_Handle *`
*/
static void
GAS_proportional_bulk_stop (void *solver)
return;
}
s->bulk_lock--;
- if ((0 == s->bulk_lock) && (0 < s->bulk_requests))
+ if ( (0 == s->bulk_lock) &&
+ (0 < s->bulk_requests) )
{
LOG (GNUNET_ERROR_TYPE_INFO,
"No lock pending, recalculating\n");
- distribute_bandwidth_in_network (s, NULL);
+ distribute_bandwidth_in_network (s,
+ NULL);
s->bulk_requests = 0;
}
}
*
* @param solver solver handle
* @param address the address
- * @param type the ATSI type in HBO
- * @param abs_value the absolute value of the property
- * @param rel_value the normalized value
*/
static void
GAS_proportional_address_property_changed (void *solver,
- struct ATS_Address *address,
- enum GNUNET_ATS_Property type,
- uint32_t abs_value,
- double rel_value)
+ struct ATS_Address *address)
{
struct GAS_PROPORTIONAL_Handle *s = solver;
- struct AddressWrapper *asi;
- struct ATS_Address *best_address;
- struct ATS_Address *active_address;
-
- asi = address->solver_information;
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Property `%s' for peer `%s' address %p changed to %.2f\n",
- GNUNET_ATS_print_property_type (type),
- GNUNET_i2s (&address->peer),
- address,
- rel_value);
-
- if (0 ==
- s->env->get_connectivity (s->env->cls,
- &address->peer))
- return; /* Peer is not requested */
-
- /* This peer is requested, find active and best address */
- active_address = get_active_address(s,
- &address->peer);
- best_address = update_active_address (s,
- &address->peer);
-
- if ((NULL != best_address) && ((NULL != active_address) &&
- (GNUNET_YES == address_eq (active_address, best_address))))
- {
- asi = best_address->solver_information;
- GNUNET_assert (NULL != asi);
+ struct AddressWrapper *asi = address->solver_information;
- /* We sticked to the same address, therefore redistribute */
- distribute_bandwidth_in_network (s, asi->network);
- }
+ distribute_bandwidth_in_network (s,
+ asi->network);
}
struct Network *net;
struct AddressWrapper *aw;
- net = get_network (s,
- network);
- if (NULL == net)
- {
- GNUNET_break (0);
- return;
- }
+ GNUNET_assert (network < s->env->network_count);
+ net = &s->network_entries[network];
+ net->total_addresses++;
aw = GNUNET_new (struct AddressWrapper);
aw->addr = address;
+ aw->network = net;
+ address->solver_information = aw;
GNUNET_CONTAINER_DLL_insert (net->head,
net->tail,
aw);
- net->total_addresses++;
GNUNET_STATISTICS_update (s->env->stats,
"# ATS addresses total",
1,
net->stat_total,
1,
GNUNET_NO);
- aw->network = net;
- address->solver_information = aw;
-
+ update_active_address (s,
+ get_active_address (s,
+ &address->peer),
+ &address->peer);
LOG (GNUNET_ERROR_TYPE_INFO,
- "Adding new address %p for peer `%s', now total %u and active %u addresses in network `%s'\n",
- address,
+ "Added new address for `%s', now total %u and active %u addresses in network `%s'\n",
GNUNET_i2s (&address->peer),
net->total_addresses,
net->active_addresses,
net->desc);
-
- if (0 ==
- s->env->get_connectivity (s->env->cls,
- &address->peer))
- return; /* Peer is not requested */
-
- /* This peer is requested, find best address */
- update_active_address (s,
- &address->peer);
}
GNUNET_NO);
if (GNUNET_YES == address->active)
{
- /* Address was active, remove from network and update quotas*/
- address->active = GNUNET_NO;
- address->assigned_bw_in = 0;
- address->assigned_bw_out = 0;
- address_decrement_active (s, net);
- /* FIXME: this may trigger the solver unnecessarily,
- especially if update_active_address() succeeds! */
+ /* Address was active, remove from network and update quotas */
+ update_active_address (s,
+ address,
+ &address->peer);
distribute_bandwidth_in_network (s, net);
-
- if (NULL ==
- update_active_address (s,
- &address->peer))
- {
- /* No alternative address found, disconnect peer */
- LOG (GNUNET_ERROR_TYPE_INFO,
- "Disconnecting peer `%s' after deleting previous address %p\n",
- GNUNET_i2s (&address->peer),
- address);
- s->env->bandwidth_changed_cb (s->env->cls,
- address);
- }
}
GNUNET_free (aw);
address->solver_information = NULL;
sf.cls = s;
sf.s_add = &GAS_proportional_address_add;
sf.s_address_update_property = &GAS_proportional_address_property_changed;
- sf.s_get = &GAS_proportional_get_preferred_address;
- sf.s_get_stop = &GAS_proportional_stop_get_preferred_address;
- sf.s_pref = &GAS_proportional_address_change_preference;
- sf.s_feedback = &GAS_proportional_address_preference_feedback;
+ sf.s_get = &GAS_proportional_start_get_address;
+ sf.s_get_stop = &GAS_proportional_stop_get_address;
+ sf.s_pref = &GAS_proportional_change_preference;
+ sf.s_feedback = &GAS_proportional_feedback;
sf.s_del = &GAS_proportional_address_delete;
sf.s_bulk_start = &GAS_proportional_bulk_start;
sf.s_bulk_stop = &GAS_proportional_bulk_stop;
s->prop_factor = f_tmp;
LOG (GNUNET_ERROR_TYPE_INFO,
"Using %s of %.3f\n",
- "PROP_PROPORTIONALITY_FACTOR"
- , f_tmp);
+ "PROP_PROPORTIONALITY_FACTOR",
+ f_tmp);
}
}
}
+/**
+ * Function used to unload the plugin.
+ *
+ * @param cls return value from #libgnunet_plugin_ats_proportional_init()
+ */
+void *
+libgnunet_plugin_ats_proportional_done (void *cls)
+{
+ struct GNUNET_ATS_SolverFunctions *sf = cls;
+ struct GAS_PROPORTIONAL_Handle *s = sf->cls;
+ struct AddressWrapper *cur;
+ struct AddressWrapper *next;
+ unsigned int c;
+
+ for (c = 0; c < s->env->network_count; c++)
+ {
+ GNUNET_break (0 == s->network_entries[c].total_addresses);
+ GNUNET_break (0 == s->network_entries[c].active_addresses);
+ next = s->network_entries[c].head;
+ while (NULL != (cur = next))
+ {
+ next = cur->next;
+ GNUNET_CONTAINER_DLL_remove (s->network_entries[c].head,
+ s->network_entries[c].tail,
+ cur);
+ GNUNET_free_non_null (cur->addr->solver_information);
+ GNUNET_free(cur);
+ }
+ GNUNET_free (s->network_entries[c].stat_total);
+ GNUNET_free (s->network_entries[c].stat_active);
+ }
+ GNUNET_break (0 == s->active_addresses);
+ GNUNET_free (s->network_entries);
+ GNUNET_free (s);
+ return NULL;
+}
+
+
/* end of plugin_ats_proportional.c */
projects / oweals / gnunet.git / blobdiff