1 problem

Flow scalability characterizes weighted α-fairness for arbitrary network topologies
Flow-scalability conjecture. A network is flow scalable if and only if it maximizes a weighted $\alpha$ -fair utility function.
openfairness network-scalability network-utility-maximization
0 responses
05

Flow scalability characterizes weighted α-fairness for arbitrary network topologies