max-min fairnessresource allocationwater-filling algorithmsystem-scale algorithmIn this paper, the Utility Max-Min (UMM) fairness criteria is analyzed, and a general algorithm of resource allocation based on UMM fairness is provided, named system-scale, which can be applied in various problems of ...
As far as we know, this is the first quiescent distributed algorithm that solves the max-min fairness optimization problem. In an exponentially growing IoT scenario of connected nodes (Cisco and Ericsson predict around 30 billions of connected devices by 2020) where different strategies and ...
max-min fairnessresource allocationwater-filling algorithmsystem-scale algorithmIn this paper, the Utility Max-Min (UMM) fairness criteria is analyzed, and a general algorithm of resource allocation based on UMM fairness is provided, named system-scale, which can be...
Upward max-min fairness is a well-known relaxation of max-min fairness and can be achieved by an algorithm extended from water-filling algorithm. In this paper, we propose a price-based multipath congestion control protocol whose equilibrium point satisfies upward max-min fairness. Our protocol ...
Upward max-min fairness is a well-known relaxation of max-min fairness and can be achieved by an algorithm extended from water-filling algorithm. In this paper, we propose a price-based multipath congestion control protocol whose equilibrium point satisfies upward max-min fairness. Our protocol ...
Free disposal correspondsto the cases where a bottleneck argument can be made, and Water Filling is the general form of allpreviously known centralized algorithms for such cases. Our derivations are based on the relationbetween max-min fairness and leximin ordering. All our results apply mutatis ...