Skip to content
  • Thomas Huehn's avatar
    mac80211: improve minstrels rate sorting by means of throughput & probability · 2ff2b690
    Thomas Huehn authored
    
    
    This patch improves the way minstrel sorts rates according to throughput
    and success probability. 3 FOR-loops across the entire rate set in function
    minstrel_update_stats() which where used to determine the fastest, second
    fastest and most robust rate are reduced to 1 FOR-loop.
    
    The sorted list of rates according throughput is extended to the best four
    rates as we need them in upcoming joint rate and power control. The sorting
    is done via the new function minstrel_sort_best_tp_rates().
    
    The most robust rate selection is aligned with minstrel_ht's approach.
    Once any success probability is above 95% the one with the highest
    throughput is chosen as most robust rate. If success probabilities of all
    rates are below 95%, the rate with the highest succ. prob. is elected as
    most robust one
    
    Acked-by: default avatarFelix Fietkau <nbd@openwrt.org>
    Signed-off-by: default avatarThomas Huehn <thomas@net.t-labs.tu-berlin.de>
    Signed-off-by: default avatarJohannes Berg <johannes.berg@intel.com>
    2ff2b690