Data networks
Convergence complexity of optimistic rate based flow control algorithms (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Single-Source Unsplittable Flow Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Approximating max-min fair rates via distributed local scheduling with partial information
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Combining fairness with throughput: online routing with multiple objectives
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximate majorization and fair online load balancing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Using approximate majorization to characterize protocol fairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Equitable cost allocations via primal-dual-type algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Link Capacity Dimensioning in Proportionally Fair Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Hop-by-hop routing algorithms for premium traffic
ACM SIGCOMM Computer Communication Review
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic
Journal of Network and Systems Management
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Localized algorithm for aggregate fairness in wireless sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Fair cost-sharing methods for the minimum spanning tree game
Information Processing Letters
Client-driven channel management for wireless LANs
ACM SIGMOBILE Mobile Computing and Communications Review
Computing optimal max-min fair resource allocation for elastic flows
IEEE/ACM Transactions on Networking (TON)
Lexicographically Minimum and Maximum Load Linear Programming Problems
Operations Research
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Fairness and load balancing in wireless LANs using association control
IEEE/ACM Transactions on Networking (TON)
Efficient construction of network topology to conserve energy in wireless ad hoc networks
Computer Communications
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Operations Research
End-to-end maxmin fairness in multihop wireless networks: Theory and protocol
Journal of Parallel and Distributed Computing
Bandwidth allocation in networks: a single dual update subroutine for multiple objectives
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Fair sampling across network flow measurements
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Choosy: max-min fair sharing for datacenter jobs with constraints
Proceedings of the 8th ACM European Conference on Computer Systems
Hi-index | 0.00 |
We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria interacts in a complex fashion with the optimization of network utilization and throughput; in this work, we undertake an investigation of this relationship through the framework of approximation algorithms.In a range of settings including both high-speed networks and Internet applications, max-min fairness has emerged as a widely accepted formulation of the notion of fairness. Informally, we say that an allocation of bandwidth is max-min fair if there is no way to give more bandwidth to any connection without decreasing the allocation to a connection of lesser or equal bandwidth. Given a collection of transmission routes, this criterion imposes a certain equilibrium condition on the bandwidth allocation, and some simple flow control mechanisms converge quickly to this equilibrium state. Indeed, the vast majority of previous work on max-min fairness has focused on this issue of associating rates with connections that are specified by a fixed set of paths. Very little work has been devoted to understanding the relationship between the way in which one selects paths for routing, and the amount of throughput one obtains from the resulting max-min fair allocation on these paths.In this work we consider the problem of selecting paths for routing so as to provide a bandwidth allocation that is as fair as possible (in the max-min sense). We obtain the first approximation algorithms for this basic optimization problem, for single-source unsplittable routings in an arbitrary directed graph. Special cases of our model include several fundamental load balancing problems, endowing them with a natural fairness criterion to which our approach can be applied. Our results form an interesting counterpart to earlier work of Megiddo, who considered max-min fairness for single-source fractional flow. The optimization problems in our setting become NP-complete, and require the development of new techniques for relating fractional relaxations of routing to the equilibrium constraints imposed by the fairness criterion.