Matrix analysis
Data networks (2nd ed.)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Journal of the ACM (JACM)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
On achieving fairness and efficiency in high-speed shared medium access
IEEE/ACM Transactions on Networking (TON)
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
A packet scheduling approach to QoS support in multihop wireless networks
Mobile Networks and Applications
Fairness comparison of FAST TCP and TCP Reno
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Flow-level stability of data networks with non-convex and time-varying rate regions
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Equilibrium of heterogeneous congestion control: existence and uniqueness
IEEE/ACM Transactions on Networking (TON)
Computer Communications
Congestion control in utility fair networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resource Allocation in Streaming Environments
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
IEEE Transactions on Information Theory
An axiomatic theory of fairness in network resource allocation
INFOCOM'10 Proceedings of the 29th conference on Information communications
A hybrid game model based on reputation for spectrum allocation in wireless networks
Computer Communications
Queue dynamics with window flow control
IEEE/ACM Transactions on Networking (TON)
Non-cooperative spectrum access in cognitive radio networks: A game theoretical model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability and benefits of suboptimal utility maximization
IEEE/ACM Transactions on Networking (TON)
On the Efficiency-Fairness Trade-off
Management Science
Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.06 |
It has been shown that as long as traffic sources adapt their rates to aggregate congestion measure in their paths, they implicitly maximize certain utility. In this paper we study some counter-intuitive throughput behaviors in such networks, pertaining to whether a fair allocation is always inefficient and whether increasing capacity always raises aggregate throughput. A bandwidth allocation policy can be defined in terms of a class of utility functions parameterized by a scalar α that can be interpreted as a quantitative measure of fairness. An allocation is fair if α is large and efficient if aggregate throughput is large. All examples in the literature suggest that a fair allocation is necessarily inefficient. We characterize exactly the tradeoff between fairness and throughput in general networks. The characterization allows us both to produce the first counter-example and trivially explain all the previous supporting examples. Surprisingly, our counter-example has the property that a fairer allocation is always more efficient. In particular it implies that maxmin fairness can achieve a higher throughput than proportional fairness. Intuitively, we might expect that increasing link capacities always raises aggregate throughput. We show that not only can throughput be reduced when some link increases its capacity, more strikingly, it can also be reduced when all links increase their capacities by the same amount. If all links increase their capacities proportionally, however, throughput will indeed increase. These examples demonstrate the intricate interactions among sources in a network setting that are missing in a single-link topology.