Skip to search formSkip to main contentSkip to account menu

Max-min fairness

Known as: Max-min fair, Max-min fair scheduling 
In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Bottleneck (engineering)Bottleneck (network)Credit-based fair queuingFair queuing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Scheduling jobs across geo-distributed datacenters with max-min fairness
It has become routine for large volumes of data to be generated, stored, and processed across geographically distributed… 
2014
2014
Max-min fair wireless energy transfer for secure multiuser communication systems
This paper considers max-min fairness for wireless energy transfer in a downlink multiuser communication system. Our resource… 
2010
2010
Max-Min Fairness in 802.11 Mesh Networks
In this paper, we establish that the rate region of a large class of IEEE 802.11 mesh networks is log-convex, immediately… 
2008
2008
Redefinition of max-min fairness in multi-hop wireless networks
In this paper, it is shown that it is challenging to evaluate service fairness in multi-hop wireless networks due to intra-flow… 
2008
2008
Utility Max-Min Fair Congestion Control with Time-Varying Delays
  • K. MillerT. Harks
  • IEEE INFOCOM - The 27th Conference on Computer…
  • 2008
  • Corpus ID: 6064609
We present a framework for designing delay- independent end-to-end congestion control algorithms, where each end-user may have a… 
2007
2007
Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We… 
2007
2007
Max-min Utility Fairness in Link Aggregated Systems
We consider utility max-min fairness of application traffic of a next generation Internet (NGI) service model contending for… 
2005
2005
Centralized and distributed approximation algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of maximal flow routing and fair… 
2001
2001
Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows
We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a… 
1997
1997
Max-min fair rate control of ABR connections with nonzero MCRs
Traffic sources that do not have intrinsic temporal characteristics are expected to be transported over ATM networks using the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)